226 search results - page 9 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
CIBCB
2007
IEEE
14 years 1 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
ALGORITHMICA
1999
13 years 7 months ago
1999
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
ISMB
1996
13 years 8 months ago
1996
Weconsider the problemof automaticdiscoveryof patterns and the corresponding subfamilies in a set of biosequences. Thesequences are unaligned and may contain noise of unknownlevel...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
BMCBI
2007
13 years 7 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...