Conference icon

Conference

Minimum recombination histories by branch and bound

Abstract:

Recombination plays an important role in creating genetic diversity within species, and inferring pasi recombination events is central to many problems in genetics. Given a set M of sampled sequences, finding an evolutionary history for M with the minimum number of recombination events is a computationally very challenging problem. In this paper, we present a novel branch and bound algorithm for-tackling that problem. Our method is shown to be far more efficient than the only preexisting exac...

Expand abstract
Publication status:
Published

Actions


Authors


Lyngso, RB More by this author
Volume:
3692
Pages:
239-250
Publication date:
2005
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:4615be76-422f-40b0-a80d-a2b862f32aa9
Source identifiers:
102909
Local pid:
pubs:102909
ISBN:
3-540-29008-7

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP