Sorting linear genomes with rearrangements and indels

Dias Vieira Braga M, Stoye J (2015)
IEEE/ACM Transactions on Computational Biology and Bioinformatics 12(3): 500-506.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
DOI
Autor*in
Dias Vieira Braga, MaríliaUniBi; Stoye, JensUniBi
Einrichtung
Technische Fakultät > AG Genominformatik
Centrum für Biotechnologie > Arbeitsgruppe J. Stoye
Centrum für Biotechnologie > Institut für Bioinformatik
Erscheinungsjahr
2015
Zeitschriftentitel
IEEE/ACM Transactions on Computational Biology and Bioinformatics
Band
12
Ausgabe
3
Seite(n)
500-506
ISSN
1545-5963
Page URI
https://pub.uni-bielefeld.de/record/2677844

Zitieren

Dias Vieira Braga M, Stoye J. Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2015;12(3):500-506.
Dias Vieira Braga, M., & Stoye, J. (2015). Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 12(3), 500-506. doi:10.1109/TCBB.2014.2329297
Dias Vieira Braga, Marília, and Stoye, Jens. 2015. “Sorting linear genomes with rearrangements and indels”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 12 (3): 500-506.
Dias Vieira Braga, M., and Stoye, J. (2015). Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics 12, 500-506.
Dias Vieira Braga, M., & Stoye, J., 2015. Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 12(3), p 500-506.
M. Dias Vieira Braga and J. Stoye, “Sorting linear genomes with rearrangements and indels”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 12, 2015, pp. 500-506.
Dias Vieira Braga, M., Stoye, J.: Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 12, 500-506 (2015).
Dias Vieira Braga, Marília, and Stoye, Jens. “Sorting linear genomes with rearrangements and indels”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 12.3 (2015): 500-506.

4 Zitationen in Europe PMC

Daten bereitgestellt von Europe PubMed Central.

Genomic Distance with High Indel Costs.
da Silva PH, Machado R, Dantas S, Braga MDV., IEEE/ACM Trans Comput Biol Bioinform 14(3), 2017
PMID: 28113562
SMORE: Synteny Modulator of Repetitive Elements.
Berkemer SJ, Hoffmann A, Murray CRA, Stadler PF., Life (Basel) 7(4), 2017
PMID: 29088079
Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.
Lyubetsky V, Gershgorin R, Gorbunov K., BMC Bioinformatics 18(1), 2017
PMID: 29212445
Orthologs, turn-over, and remolding of tRNAs in primates and fruit flies.
Velandia-Huerto CA, Berkemer SJ, Hoffmann A, Retzlaff N, Romero Marroquín LC, Hernández-Rosales M, Stadler PF, Bermúdez-Santana CI., BMC Genomics 17(1), 2016
PMID: 27515907

24 References

Daten bereitgestellt von Europe PubMed Central.


AUTHOR UNKNOWN, 0
Multichromosomal median and halving problems under different genomic distances.
Tannier E, Zheng C, Sankoff D., BMC Bioinformatics 10(), 2009
PMID: 19386099
Genome dedoubling by DCJ and reversal
thomas, BMC Bioinformatics 12(), 2012
Restricted DCJ model: rearrangement problems with chromosome reincorporation.
Kovac J, Warren R, Braga MD, Stoye J., J. Comput. Biol. 18(9), 2011
PMID: 21899428
DCJ path formulation for genome transformations which include insertions, deletions, and duplications.
Yancopoulos S, Friedberg R., J. Comput. Biol. 16(10), 2009
PMID: 19803734
Double cut and join with insertions and deletions.
Braga MD, Willing E, Stoye J., J. Comput. Biol. 18(9), 2011
PMID: 21899423
Restricted DCJ-indel model: Sorting linear genomes with DCJ and indels
da, BMC Bioinformatics 13(), 2012

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Sorting signed permutations by reversals and insertions/deletions of contiguous segments
AUTHOR UNKNOWN, J Discrete Algorithms 1(), 2001

AUTHOR UNKNOWN, 0
Two notes on genome rearrangement.
Ozery-Flato M, Shamir R., J Bioinform Comput Biol 1(1), 2003
PMID: 15290782
Balanced vertices in trees and a simpler algorithm to compute the genomic distance
erd?s, Appl Math Lett 24(), 2011

AUTHOR UNKNOWN, 0
A unifying view of genome rearrangements
bergeron, Proc 6th Int Conf Algorithms Bioinform 4175(), 2006
Efficient sorting of genomic permutations by translocation, inversion and block interchange.
Yancopoulos S, Attie O, Friedberg R., Bioinformatics 21(16), 2005
PMID: 15951307

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
The ABCs of MGR with DCJ.
Adam Z, Sankoff D., Evol. Bioinform. Online 4(), 2008
PMID: 19204809
Genomic distance under gene substitutions.
Braga MD, Machado R, Ribeiro LC, Stoye J., BMC Bioinformatics 12 Suppl 9(), 2011
PMID: 22151231

AUTHOR UNKNOWN, 0
DCJ-indel and DCJ-substitution distances with distinct operation costs
da, Algorithms Mol Biol 8(), 2013
UniMoG--a unifying framework for genomic distance calculation and sorting based on DCJ.
Hilker R, Sickinger C, Pedersen CN, Stoye J., Bioinformatics 28(19), 2012
PMID: 22815356
On the weight of indels in genomic distances.
Braga MD, Machado R, Ribeiro LC, Stoye J., BMC Bioinformatics 12 Suppl 9(), 2011
PMID: 22151784
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Quellen

PMID: 26357261
PubMed | Europe PMC

Suchen in

Google Scholar