Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes

Feijão P, Meidanis J (2013)
IEEE/ACM Transactions on Computational Biology and Bioinformatics 10(4): 819-831.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
DOI
Autor*in
Feijão, PedroUniBi; Meidanis, Joao
Einrichtung
Technische Fakultät > AG Genominformatik
Erscheinungsjahr
2013
Zeitschriftentitel
IEEE/ACM Transactions on Computational Biology and Bioinformatics
Band
10
Ausgabe
4
Seite(n)
819-831
ISSN
1545-5963
Page URI
https://pub.uni-bielefeld.de/record/2659331

Zitieren

Feijão P, Meidanis J. Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2013;10(4):819-831.
Feijão, P., & Meidanis, J. (2013). Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10(4), 819-831. doi:10.1109/TCBB.2012.161
Feijão, Pedro, and Meidanis, Joao. 2013. “Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (4): 819-831.
Feijão, P., and Meidanis, J. (2013). Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. IEEE/ACM Transactions on Computational Biology and Bioinformatics 10, 819-831.
Feijão, P., & Meidanis, J., 2013. Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10(4), p 819-831.
P. Feijão and J. Meidanis, “Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 10, 2013, pp. 819-831.
Feijão, P., Meidanis, J.: Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 10, 819-831 (2013).
Feijão, Pedro, and Meidanis, Joao. “Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 10.4 (2013): 819-831.

5 Zitationen in Europe PMC

Daten bereitgestellt von Europe PubMed Central.

On the rank-distance median of 3 permutations.
Chindelevitch L, Pereira Zanetti JP, Meidanis J., BMC Bioinformatics 19(suppl 6), 2018
PMID: 29745865
CSAR-web: a web server of contig scaffolding using algebraic rearrangements.
Chen KT, Lu CL., Nucleic Acids Res 46(w1), 2018
PMID: 29733393
Algebraic double cut and join : A group-theoretic approach to the operator on multichromosomal genomes.
Bhatia S, Egri-Nagy A, Francis AR., J Math Biol 71(5), 2015
PMID: 25502846
An efficient algorithm for the contig ordering problem under algebraic rearrangement distance.
Lu CL., J Comput Biol 22(11), 2015
PMID: 26247343
On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
Feijão P, Martinez F, Thévenin A., BMC Bioinformatics 16 Suppl 19(), 2015
PMID: 26695008

10 References

Daten bereitgestellt von Europe PubMed Central.

Efficient sorting of genomic permutations by translocation, inversion and block interchange.
Yancopoulos S, Attie O, Friedberg R., Bioinformatics 21(16), 2005
PMID: 15951307
Analysis of Circular Genome Rearrangement by Fusions, Fissions and Block-Interchanges
lu, BMC Bioinformatics (), 2006

meidanis, Comparative Genomics Empirical and Analytical Approaches to Gene Order Dynamics Map Alignment and Evolution of Gene Families (), 2000
Sorting by reversals, generalized transpositions, and translocations using permutation groups.
Huang YL, Lu CL., J. Comput. Biol. 17(5), 2010
PMID: 20500022

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
The solution space of sorting by DCJ.
Braga MD, Stoye J., J. Comput. Biol. 17(9), 2010
PMID: 20874401
A Unifying View of Genome Rearrangements
bergeron, Proc Sixth Int'l Workshop Algorithms in Bioinformatics (), 2006
SCJ: a breakpoint-like distance that simplifies several rearrangement problems.
Feijao P, Meidanis J., IEEE/ACM Trans Comput Biol Bioinform 8(5), 2011
PMID: 21339538
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Quellen

PMID: 24334378
PubMed | Europe PMC

Suchen in

Google Scholar