205 search results - page 27 / 41 » Incomparability of Results Between Phylogenetic Search Progr... |
174
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
175
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
182
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
174
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Accurate peptide identification is important to high-throughput proteomics analyses that use mass spectrometry. Search programs compare fragmentation spectra (MS/MS) o...
182
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...