1421 search results - page 35 / 285 » Algorithms for subsequence combinatorics |
103
click to vote
COMBINATORICS
2000
14 years 11 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
115
click to vote
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
CPM
2009
Springer
15 years 3 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
SPIRE
2001
Springer
15 years 4 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
BIOINFORMATICS
2000
14 years 11 months ago
2000
Motivation: Efficient, accurate and automatic clustering of large protein sequence datasets, such as complete proteomes, into families, according to sequence similarity. Detection...