8431 search results - page 73 / 1687 » Algorithmically Independent Sequences |
HEURISTICS
2002
14 years 9 months ago
2002
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
119
click to vote
BIRD
2008
Springer
14 years 11 months ago
2008
Springer
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
ICPP
2007
IEEE
15 years 4 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...