1421 search results - page 96 / 285 » Algorithms for subsequence combinatorics |
138
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
131
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
141
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
147
click to vote
CPM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
132
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...