56 search results - page 10 / 12 » Approximate String Matching in DNA Sequences |
BMCBI
2007
13 years 7 months ago
2007
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
WOB
2004
13 years 9 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
TCS
2008
13 years 7 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...