An asymmetric approach to preserve common intervals while sorting by reversals

Dias Vieira Braga M, Gautier C, Sagot M-F (2009)
Algorithms for Molecular Biology 4(1): 16.

Download
OA
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Volltext vorhanden für diesen Nachweis
Autor
; ;
Abstract / Bemerkung
Background: The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios. However, the number of sequences is huge and some additional criteria should be used to obtain a more accurate analysis. One strategy is searching for sequences that respect constraints, such as the common intervals (clusters of co-localised genes). Another approach is to explore the whole space of sorting sequences, eventually grouping them into classes of equivalence. Recently both strategies started to be put together, to restrain the space to the sequences that respect constraints. In particular an algorithm has been proposed to list classes whose sorting sequences do not break the common intervals detected between the two inital genomes A and B. This approach may reduce the space of sequences and is symmetric (the result of the analysis sorting A into B can be obtained from the analysis sorting B into A). Results: We propose an alternative approach to restrain the space of sorting sequences, using progressive instead of initial detection of common intervals (the list of common intervals is updated after applying each reversal). This may reduce the space of sequences even more, but is shown to be asymmetric. Conclusions: We suggest that our method may be more realistic when the relation ancestor-descendant between the analysed genomes is clear and we apply it to do a better characterisation of the evolutionary scenario of the bacterium Rickettsia felis with respect to one of its ancestors.
Erscheinungsjahr
Zeitschriftentitel
Algorithms for Molecular Biology
Band
4
Zeitschriftennummer
1
Seite
16
ISSN
PUB-ID

Zitieren

Dias Vieira Braga M, Gautier C, Sagot M-F. An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology. 2009;4(1):16.
Dias Vieira Braga, M., Gautier, C., & Sagot, M. - F. (2009). An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology, 4(1), 16. doi:10.1186/1748-7188-4-16
Dias Vieira Braga, M., Gautier, C., and Sagot, M. - F. (2009). An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology 4, 16.
Dias Vieira Braga, M., Gautier, C., & Sagot, M.-F., 2009. An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology, 4(1), p 16.
M. Dias Vieira Braga, C. Gautier, and M.-F. Sagot, “An asymmetric approach to preserve common intervals while sorting by reversals”, Algorithms for Molecular Biology, vol. 4, 2009, pp. 16.
Dias Vieira Braga, M., Gautier, C., Sagot, M.-F.: An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology. 4, 16 (2009).
Dias Vieira Braga, Marília, Gautier, Christian, and Sagot, Marie-France. “An asymmetric approach to preserve common intervals while sorting by reversals”. Algorithms for Molecular Biology 4.1 (2009): 16.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2018-01-10T12:46:02Z

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Quellen

PMID: 20042101
PubMed | Europe PMC

Suchen in

Google Scholar