16 search results - page 1 / 4 » On-Line Viterbi Algorithm for Analysis of Long Biological Se... |
WABI
2007
Springer
13 years 11 months ago
2007
Springer
FSTTCS
2000
Springer
13 years 9 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
BMCBI
2006
13 years 5 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...