Sciweavers

8431 search results - page 79 / 1687
» Algorithmically Independent Sequences
Sort
View
RIVF
2008
14 years 11 months ago
Speeding up subset seed algorithm for intensive protein sequence comparison
Abstract--Sequence similarity search is a common and repeated task in molecular biology. The rapid growth of genomic databases leads to the need of speeding up the treatment of thi...
Van Hoa Nguyen, Dominique Lavenier
TCS
1998
14 years 9 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
RECOMB
2010
Springer
14 years 7 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 3 months ago
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
Thang Nguyen Bui, Waleed A. Youssef
JCSS
2002
95views more  JCSS 2002»
14 years 9 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao