SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems

Feijão P, Meidanis J (2011)
IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(5): 1318-1329.

Download
No fulltext has been uploaded. References only!
Journal Article | Original Article | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
ISSN
PUB-ID

Cite this

Feijão P, Meidanis J. SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2011;8(5):1318-1329.
Feijão, P., & Meidanis, J. (2011). SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5), 1318-1329. doi:10.1109/TCBB.2011.34
Feijão, P., and Meidanis, J. (2011). SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, 1318-1329.
Feijão, P., & Meidanis, J., 2011. SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5), p 1318-1329.
P. Feijão and J. Meidanis, “SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, 2011, pp. 1318-1329.
Feijão, P., Meidanis, J.: SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 8, 1318-1329 (2011).
Feijão, Pedro, and Meidanis, J. “SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8.5 (2011): 1318-1329.
This data publication is cited in the following publications:
This publication cites the following data publications:

11 Citations in Europe PMC

Data provided by Europe PubMed Central.

Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.
Hartmann T, Chu AC, Middendorf M, Bernt M., IEEE/ACM Trans Comput Biol Bioinform 15(1), 2018
PMID: 28114075
Sorting by Cuts, Joins, and Whole Chromosome Duplications.
Zeira R, Shamir R., J Comput Biol 24(2), 2017
PMID: 27704866
Median Approximations for Genomes Modeled as Matrices.
Zanetti JP, Biller P, Meidanis J., Bull Math Biol 78(4), 2016
PMID: 27072561
eSTGt: a programming and simulation environment for population dynamics.
Spiro A, Shapiro E., BMC Bioinformatics 17(1), 2016
PMID: 27117841
Representing and decomposing genomic structural variants as balanced integer flows on sequence graphs.
Zerbino DR, Ballinger T, Paten B, Hickey G, Haussler D., BMC Bioinformatics 17(1), 2016
PMID: 27687569
Sampling and counting genome rearrangement scenarios.
Miklós I, Smith H., BMC Bioinformatics 16 Suppl 14(), 2015
PMID: 26452124
Reconstruction of ancestral gene orders using intermediate genomes.
Feijão P., BMC Bioinformatics 16 Suppl 14(), 2015
PMID: 26451811
Rearrangement-based phylogeny using the Single-Cut-or-Join operation.
Biller P, Feijão P, Meidanis J., IEEE/ACM Trans Comput Biol Bioinform 10(1), 2013
PMID: 23702549
Extending the algebraic formalism for genome rearrangements to include linear chromosomes.
Feijão P, Meidanis J., IEEE/ACM Trans Comput Biol Bioinform 10(4), 2013
PMID: 24334378

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Sources

PMID: 21339538
PubMed | Europe PMC

Search this title in

Google Scholar