4 search results - page 1 / 1 » Finding Approximate Palindromes in Strings Quickly and Simpl... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
PR
2002
13 years 4 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
BMCBI
2011
12 years 8 months ago
2011
Background: The Biodiversity Heritage Library (BHL) is a large digital archive of legacy biological literature, comprising over 31 million pages scanned from books, monographs, an...