SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy

Feijão P, Meidanis J (2009)
In: Algorithms in Bioinformatics. Salzberg SL, Warnow T (Eds); Lecture Notes in Computer Science, 5724. 85-96.

Book Chapter | Published | English

No fulltext has been uploaded

Author
;
Book Editor
Salzberg, Steven L. ; Warnow, Tandy
Publishing Year
PUB-ID

Cite this

Feijão P, Meidanis J. SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy. In: Salzberg SL, Warnow T, eds. Algorithms in Bioinformatics. Lecture Notes in Computer Science. Vol 5724. 2009: 85-96.
Feijão, P., & Meidanis, J. (2009). SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy. In S. L. Salzberg & T. Warnow (Eds.), Lecture Notes in Computer Science: Vol. 5724. Algorithms in Bioinformatics (pp. 85-96).
Feijão, P., and Meidanis, J. (2009). “SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy” in Algorithms in Bioinformatics, ed. S. L. Salzberg and T. Warnow Lecture Notes in Computer Science, vol. 5724, 85-96.
Feijão, P., & Meidanis, J., 2009. SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy. In S. L. Salzberg & T. Warnow, eds. Algorithms in Bioinformatics. Lecture Notes in Computer Science. no.5724 pp. 85-96.
P. Feijão and J. Meidanis, “SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy”, Algorithms in Bioinformatics, S.L. Salzberg and T. Warnow, eds., Lecture Notes in Computer Science, vol. 5724, 2009, pp.85-96.
Feijão, P., Meidanis, J.: SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy. In: Salzberg, S.L. and Warnow, T. (eds.) Algorithms in Bioinformatics. Lecture Notes in Computer Science. 5724, p. 85-96. (2009).
Feijão, Pedro, and Meidanis, João. “SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy”. Algorithms in Bioinformatics. Ed. Steven L. Salzberg and Tandy Warnow. 2009.Vol. 5724. Lecture Notes in Computer Science. 85-96.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar
ISBN Search