Sciweavers

Share
4 search results - page 1 / 1
» Finding Approximate Palindromes in Strings Quickly and Simpl...
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
11 years 11 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: 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)-...
L. Allison
PR
2002
112views more  PR 2002»
11 years 11 months ago
Finding approximate palindromes in strings
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...
Alexandre H. L. Porto, Valmir C. Barbosa
IPPS
2003
IEEE
12 years 5 months ago
Approximate Search Engine Optimization for Directory Service
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...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
BMCBI
2011
11 years 3 months ago
Extracting scientific articles from a large digital archive: BioStor and the Biodiversity Heritage Library
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...
Roderic D. M. Page
books