UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ

Hilker R, Sickinger C, Pedersen CNS, Stoye J (2012)
Bioinformatics 28(19): 2509-2511.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Erscheinungsjahr
2012
Zeitschriftentitel
Bioinformatics
Band
28
Ausgabe
19
Seite(n)
2509-2511
ISSN
1367-4803
eISSN
1460-2059
Page URI
https://pub.uni-bielefeld.de/record/2510984

Zitieren

Hilker R, Sickinger C, Pedersen CNS, Stoye J. UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics. 2012;28(19):2509-2511.
Hilker, R., Sickinger, C., Pedersen, C. N. S., & Stoye, J. (2012). UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics, 28(19), 2509-2511. doi:10.1093/bioinformatics/bts440
Hilker, Rolf, Sickinger, Corinna, Pedersen, Christian N. S., and Stoye, Jens. 2012. “UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ”. Bioinformatics 28 (19): 2509-2511.
Hilker, R., Sickinger, C., Pedersen, C. N. S., and Stoye, J. (2012). UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics 28, 2509-2511.
Hilker, R., et al., 2012. UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics, 28(19), p 2509-2511.
R. Hilker, et al., “UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ”, Bioinformatics, vol. 28, 2012, pp. 2509-2511.
Hilker, R., Sickinger, C., Pedersen, C.N.S., Stoye, J.: UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics. 28, 2509-2511 (2012).
Hilker, Rolf, Sickinger, Corinna, Pedersen, Christian N. S., and Stoye, Jens. “UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ”. Bioinformatics 28.19 (2012): 2509-2511.

16 Zitationen in Europe PMC

Daten bereitgestellt von Europe PubMed Central.

Evolutionary dynamics of the chromatophore genome in three photosynthetic Paulinella species.
Lhee D, Ha JS, Kim S, Park MG, Bhattacharya D, Yoon HS., Sci Rep 9(1), 2019
PMID: 30796245
The complete mitochondrial genome of the early flowering plant Nymphaea colorata is highly repetitive with low recombination.
Dong S, Zhao C, Chen F, Liu Y, Zhang S, Wu H, Zhang L, Liu Y., BMC Genomics 19(1), 2018
PMID: 30107780
Assembly and comparative analysis of the complete mitochondrial genome sequence of Sophora japonica 'JinhuaiJ2'.
Shi Y, Liu Y, Zhang S, Zou R, Tang J, Mu W, Peng Y, Dong S., PLoS One 13(8), 2018
PMID: 30114217
Mitochondrial genome evolution in the Saccharomyces sensu stricto complex.
Ruan J, Cheng J, Zhang T, Jiang H., PLoS One 12(8), 2017
PMID: 28813471
Algorithms for reconstruction of chromosomal structures.
Lyubetsky V, Gershgorin R, Seliverstov A, Gorbunov K., BMC Bioinformatics 17(), 2016
PMID: 26780836
Sorting Linear Genomes with Rearrangements and Indels.
Braga MD, Stoye J., IEEE/ACM Trans Comput Biol Bioinform 12(3), 2015
PMID: 26357261
High variability of mitochondrial gene order among fungi.
Aguileta G, de Vienne DM, Ross ON, Hood ME, Giraud T, Petit E, Gabaldón T., Genome Biol Evol 6(2), 2014
PMID: 24504088

16 References

Daten bereitgestellt von Europe PubMed Central.

The inversion distance problem
Bergeron A., 2005
On sorting by translocations.
Bergeron A, Mixtacki J, Stoye J., J. Comput. Biol. 13(2), 2006
PMID: 16597257
A unifying view of genome rearrangements
Bergeron A., 2006
Balanced vertices in trees and a simpler algorithm to compute the genomic distance
Erdős PL., 2011
Polynomial-time algorithm for computing translocation distance between genomes
Hannenhalli S., 1996
Transforming men into mice (polynomial algorithm for genomic distance problem)
Hannenhalli S, Pevzner PA., 1995
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Hannenhalli S, Pevzner PA., 1999
Genome rearrangements: a correct algorithm for optimal capping
Jean G, Nikolski M., 2007
Restricted DCJ model: rearrangement problems with chromosome reincorporation.
Kovac J, Warren R, Braga MD, Stoye J., J. Comput. Biol. 18(9), 2011
PMID: 21899428
Estimating true evolutionary distances under the DCJ model
Lin Y, Moret BME., 2008
Advances on sorting by reversals
Tannier E., 2007
Efficient algorithms for multichromosomal genome rearrangements
Tesler G., 2002
GRIMM: genome rearrangements web server.
Tesler G., Bioinformatics 18(3), 2002
PMID: 11934753
Initial sequence of the chimpanzee genome and comparison with the human genome.
Chimpanzee Sequencing and Analysis Consortium., Nature 437(7055), 2005
PMID: 16136131
Efficient sorting of genomic permutations by translocation, inversion and block interchange.
Yancopoulos S, Attie O, Friedberg R., Bioinformatics 21(16), 2005
PMID: 15951307
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Quellen

PMID: 22815356
PubMed | Europe PMC

Suchen in

Google Scholar