198 search results - page 24 / 40 » Efficient computation of absent words in genomic sequences |
118
click to vote
ACST
2006
14 years 11 months ago
2006
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
Protein sequence alignments are more reliable the shorter the evolutionary distance. Here, we align distantly related proteins using many closely spaced intermediate sequences as ...
129
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...