697 search results - page 25 / 140 » Improving EAs for Sequencing Problems |
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
In this study, an algorithm is proposed to solve the multi-frame structure from motion (MFSfM) problem for monocular video sequences in dynamic scenes. The algorithm uses the epip...
DASFAA
2003
IEEE
14 years 1 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
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...
RECOMB
2001
Springer
14 years 8 months ago
2001
Springer
For the last twenty years fragment assembly in DNA sequencing followed the "overlap - layout - consensus" paradigm that is used in all currently available assembly tools...