de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Dokument suchen
On the Inversion-Indel Distance
Basic definitions
Common and unique markers
Indels
Rearrangements modeled by DCJ
Methods
The relational diagram
DCJ sorting and DCJ distance
Inversion model
Cutting and merging bad components
Runs, indel-potential and the DCJ-indel distance
Results
Finding optimal integrations
Finding safe integrations - the inversion-indel distance in the absence of bad components
Bounds for the inversion-indel distance in the presence of bad components
The component tree
The costs of cutting and merging bad components in the inversion-indel model
The colored component tree
Conclusions
Competing interests
Authors’ contributions
Acknowledgements
Declaration
Authors' details
References
Aufsatz in einer Zeitschrift
On the Inversion-Indel Distance
Entstehung
2013
JPEG-Download
verfügbare Breiten
JPEG groß
JPEG original
Seiten an
Seiten aus
