1421 search results - page 62 / 285 » Algorithms for subsequence combinatorics |
94
Voted
CPM
2004
Springer
15 years 8 months ago
2004
Springer
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
114
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
116
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
112
Voted
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
115
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...