Shortest common supersequence problem

#	Item
1	Multiple Sequence Alignment and Phylogenetic Reconstruction: Theory and Methods in Biological Data Analysis Gianluca Della Vedova Add to Reading List Source URL: www.statistica.unimib.it Language: English - Date: 2004-04-21 05:50:41 Bioinformatics Computational phylogenetics Phylogenetics Combinatorics Dynamic programming Sequence alignment Multiple sequence alignment Phylo Homology Shortest common supersequence problem Longest common subsequence problem Alignment-free sequence analysis
2	CS109A Notes for LectureSubstrings In ML notation, x is a substring of y if y = u^x^v for some strings u and v. Similar notion for lists, i.e., y = u@x@v. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:15 Combinatorics Formal languages Longest common subsequence problem String Substring Subsequence Diff Shortest common supersequence Longest common substring problem Mathematics Dynamic programming Theoretical computer science
3	Multiple Sequence Alignment and Phylogenetic Reconstruction: Theory and Methods in Biological Data Analysis Gianluca Della Vedova Add to Reading List Source URL: www.statistica.unimib.it Language: English - Date: 2004-04-21 05:50:41 Mathematics Applied mathematics Sequence alignment Multiple sequence alignment Phylo Shortest common supersequence Longest common subsequence problem Sequence analysis BLAST Science Bioinformatics Computational phylogenetics