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.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor/in
;
Erscheinungsjahr
Zeitschriftentitel
IEEE/ACM Transactions on Computational Biology and Bioinformatics
Band
10
Ausgabe
4
Seite(n)
819-831
ISSN
PUB-ID

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, 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

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

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