5404 search results - page 13 / 1081 » Global Computing for Bioinformatics |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
DNA
2004
Springer
14 years 24 days ago
2004
Springer
DNA
2004
Springer
14 years 24 days ago
2004
Springer
TCBB
2010
13 years 5 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
