Revision as of 23:31, 8 February 2015 view source CNHume (talk \| contribs) 159 edits Added references to more recent research to the Background section. ← Older edit		Revision as of 23:32, 8 February 2015 view source CNHume (talk \| contribs) 159 edits m →‎{{header\|C++}} Newer edit →
Line 330: '''Background''' Given two sequences, lengths m and n, of symbols drawn from some alphabet ~~symbols~~, a small number of symbols may generate a large O(m*n) number of pairs where two input sequences match. This occurs, for example, in the Bioinformatics applications of nucleotide and protein sequencing.

Longest common subsequence: Difference between revisions