Sciweavers

980 search results - page 140 / 196
» Faster Possibility Detection by Combining Two Approaches
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
15 years 6 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,...
ICCV
2003
IEEE
16 years 8 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
RECOMB
2007
Springer
16 years 6 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
RECOMB
2006
Springer
16 years 6 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
BMCBI
2008
99views more  BMCBI 2008»
15 years 6 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey