2994 search results - page 175 / 599 » Time sequences |
191
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
121
click to vote
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several pr...
136
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
128
click to vote
CPM
2005
Springer
15 years 5 months ago
2005
Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
111
Voted
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...