Sciweavers

2711 search results - page 277 / 543
» Mapping sequences by parts
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 7 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
RECOMB
2004
Springer
16 years 7 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
APBC
2004
15 years 8 months ago
EMAGEN: An Efficient Approach to Multiple Whole Genome Alignment
Following advances in biotechnology, many new whole genome sequences are becoming available every year. A lot of useful information can be derived from the alignment and compariso...
Jitender S. Deogun, Jingyi Yang, Fangrui Ma
BMCBI
2007
148views more  BMCBI 2007»
15 years 6 months ago
BPhyOG: An interactive server for genome-wide inference of bacterial phylogenies based on overlapping genes
Background: Overlapping genes (OGs) in bacterial genomes are pairs of adjacent genes of which the coding sequences overlap partly or entirely. With the rapid accumulation of seque...
Yingqin Luo, Cong Fu, Da-Yong Zhang, Kui Lin
BMCBI
2007
154views more  BMCBI 2007»
15 years 6 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...