1421 search results - page 95 / 285 » Algorithms for subsequence combinatorics |
129
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
134
click to vote
SARA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
128
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
142
click to vote
TCBB
2010
15 years 2 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...
127
click to vote
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...