Sciweavers

217 search results - page 7 / 44
» A new algorithm for gap constrained sequence mining
Sort
View
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
14 years 2 months ago
A General Framework for Local Pairwise Alignment Statistics with Gaps
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
Pasi Rastas
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
13 years 12 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
JCP
2006
139views more  JCP 2006»
13 years 7 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana
BMCBI
2005
142views more  BMCBI 2005»
13 years 7 months ago
CLU: A new algorithm for EST clustering
Background: The continuous flow of EST data remains one of the richest sources for discoveries in modern biology. The first step in EST data mining is usually associated with EST ...
Andrey A. Ptitsyn, Winston Hide
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
14 years 27 days ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai