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. Berlin, Heidelberg: Springer Berlin Heidelberg: 85-96.
Sammelwerksbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Feijão, PedroUniBi;
Meidanis, João
Herausgeber*in
Salzberg, Steven L.;
Warnow, Tandy
Einrichtung
Erscheinungsjahr
2009
Buchtitel
Algorithms in Bioinformatics
Serientitel
Lecture Notes in Computer Science
Band
5724
Seite(n)
85-96
ISBN
978-3-642-04240-9
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/2659405
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. Berlin, Heidelberg: Springer Berlin Heidelberg; 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). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-04241-6_8
Feijão, Pedro, and Meidanis, João. 2009. “SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy”. In Algorithms in Bioinformatics, ed. Steven L. Salzberg and Tandy Warnow, 5724:85-96. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg.
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, (Berlin, Heidelberg: Springer Berlin Heidelberg), 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 Berlin, Heidelberg: Springer Berlin Heidelberg, 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, Berlin, Heidelberg: Springer Berlin Heidelberg, 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. Springer Berlin Heidelberg, Berlin, Heidelberg (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. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.Vol. 5724. Lecture Notes in Computer Science. 85-96.
Google Scholar
ISBN Suche