A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
A Practical Index for Genome Searching
[chapter]
2003
Lecture Notes in Computer Science
Current search tools for computational biology trade efficiency for precision, losing many relevant matches. We push in the direction of obtaining maximum efficiency from an indexing scheme that does not lose any relevant match. We show that it is feasible to search the human genome efficiently on an average desktop computer. Indexed Approximate String Matching The problem we focus on is: Given a long text T 1...n , and a (comparatively) short pattern P 1...m , both sequences over alphabet Σ of
doi:10.1007/978-3-540-39984-1_26
fatcat:6jo5repwxff2tc5okuyfzuhibq