Sciweavers

166 search results - page 22 / 34
» Suffix trees for very large genomic sequences
Sort
View
BMCBI
2010
132views more  BMCBI 2010»
14 years 12 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
JCDL
2006
ACM
172views Education» more  JCDL 2006»
15 years 5 months ago
A comprehensive comparison study of document clustering for a biomedical digital library MEDLINE
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
Illhoi Yoo, Xiaohua Hu
BMCBI
2010
189views more  BMCBI 2010»
14 years 12 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
ISBI
2011
IEEE
14 years 3 months ago
Automated lineage tree reconstruction from Caenorhabditis elegans image data using particle filtering based cell tracking
Caenorhabditis elegans is an important model organism for the study of molecular mechanisms of development and disease processes, due to its well-known genome and invariant cell l...
Noemí Carranza-Herrezuelo, Ihor Smal, Oleh ...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 3 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant