Sciweavers

93 search results - page 7 / 19
» Quadratic Time Algorithms for Finding Common Intervals in Tw...
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 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
ISMB
1996
13 years 8 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
BMCBI
2005
132views more  BMCBI 2005»
13 years 7 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
12 years 11 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
SAC
2006
ACM
14 years 1 months ago
Discretization from data streams: applications to histograms and data mining
Abstract. In this paper we propose a new method to perform incremental discretization. The basic idea is to perform the task in two layers. The first layer receives the sequence o...
João Gama, Carlos Pinto