Sciweavers

178 search results - page 1 / 36
» An improved string composition method for sequence compariso...
Sort
View
BMCBI
2008
71views more  BMCBI 2008»
13 years 5 months ago
An improved string composition method for sequence comparison
Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison
Guoqing Lu, Shunpu Zhang, Xiang Fang
ALMOB
2008
131views more  ALMOB 2008»
13 years 5 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ICPR
2010
IEEE
13 years 8 months ago
Spatial Representation for Efficient Sequence Classification
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
Pavel Kuksa, Vladimir Pavlovic
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
13 years 10 months ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 9 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang