Combinatorial aspects of genome rearrangements and haplotype networks

Combinatorial aspects of genome rearrangements and haplotype networks

Show other versions (1)

The dissertation covers two problems motivated by computational biology: genome rearrangements, and haplotype networks.<p><p>Genome rearrangement problems are a particular case of edit distance problems, where one seeks to transform two given objects into one another using as few operati...

Full description

Bibliographic Details
Main Author: Labarre, Anthony
Other Authors: Doignon, Jean-Paul
Format: Doctoral Thesis
Language:fr
Published: Universite Libre de Bruxelles 2008
Subjects:
Sciences exactes et naturelles
Informatique générale
Bioinformatics
Genetics > Data processing
Bio-informatique
Génétique > Informatique
permutation
cycle graph/graphe des cycles
supergraph/supergraphe
edit distance/distance d'édition
sorting/tri
Online Access:http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210470

Internet

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210470

Similar Items