2877 search results - page 278 / 576 » Computational Biology |
210
click to vote
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
189
click to vote
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Mu˜noz et al. recently studied the problem of filling an incomplete multichromos...
184
click to vote
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
An important question in genome evolution is whether there exist fragile regions (rearrangement hotspots) where chromosomal rearrangements are happening over and over again. Althou...
165
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
186
click to vote
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...