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.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Sammelwerksbeitrag | Veröffentlicht | Englisch
Autor
;
Herausgeber
;
Erscheinungsjahr
Buchtitel
Algorithms in Bioinformatics
Band
5724
Seite
85-96
PUB-ID

Zitieren

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). doi:10.1007/978-3-642-04241-6_8
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, Salzberg, S. L., and Warnow, T. eds. 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.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar
ISBN Suche