3 search results - page 1 / 1 » Choosing the best heuristic for seeded alignment of DNA sequ... |
BMCBI
2006
13 years 4 months ago
2006
BIBM
2009
IEEE
13 years 8 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
BMCBI
2007
13 years 4 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...