A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates
Rubert D, Feijão P, Dias Vieira Braga M, Stoye J, Martinez FHV (2016)
In: Algorithms in Bioinformatics. WABI 2016. Frith M, Storm Pedersen CN (Eds); Lecture Notes in Bioinformatics, 9838. Cham: Springer: 293-306.
Konferenzbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Rubert, DiegoUniBi 
;
Feijão, PedroUniBi;
Dias Vieira Braga, MaríliaUniBi;
Stoye, JensUniBi ;
Martinez, Fábio Henrique Viduani
;
Feijão, PedroUniBi;
Dias Vieira Braga, MaríliaUniBi;
Stoye, JensUniBi ;
Martinez, Fábio Henrique ViduaniHerausgeber*in
Frith, Martin;
Storm Pedersen, Christian Nørgaard
Einrichtung
Erscheinungsjahr
2016
Titel des Konferenzbandes
Algorithms in Bioinformatics. WABI 2016
Serien- oder Zeitschriftentitel
Lecture Notes in Bioinformatics
Band
9838
Seite(n)
293-306
Konferenz
16th International Workshop, WABI 2016
Konferenzort
Aarhus, Denmark
Konferenzdatum
2016-08-22 – 2016-08-24
ISBN
978-3-319-43680-7
Page URI
https://pub.uni-bielefeld.de/record/2903708
Zitieren
Rubert D, Feijão P, Dias Vieira Braga M, Stoye J, Martinez FHV. A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. In: Frith M, Storm Pedersen CN, eds. Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Bioinformatics. Vol 9838. Cham: Springer; 2016: 293-306.
Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., & Martinez, F. H. V. (2016). A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. In M. Frith & C. N. Storm Pedersen (Eds.), Lecture Notes in Bioinformatics: Vol. 9838. Algorithms in Bioinformatics. WABI 2016 (pp. 293-306). Cham: Springer. https://doi.org/10.1007/978-3-319-43681-4_24
Rubert, Diego, Feijão, Pedro, Dias Vieira Braga, Marília, Stoye, Jens, and Martinez, Fábio Henrique Viduani. 2016. “A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates”. In Algorithms in Bioinformatics. WABI 2016, ed. Martin Frith and Christian Nørgaard Storm Pedersen, 9838:293-306. Lecture Notes in Bioinformatics. Cham: Springer.
Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., and Martinez, F. H. V. (2016). “A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates” in Algorithms in Bioinformatics. WABI 2016, Frith, M., and Storm Pedersen, C. N. eds. Lecture Notes in Bioinformatics, vol. 9838, (Cham: Springer), 293-306.
Rubert, D., et al., 2016. A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. In M. Frith & C. N. Storm Pedersen, eds. Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Bioinformatics. no.9838 Cham: Springer, pp. 293-306.
D. Rubert, et al., “A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates”, Algorithms in Bioinformatics. WABI 2016, M. Frith and C.N. Storm Pedersen, eds., Lecture Notes in Bioinformatics, vol. 9838, Cham: Springer, 2016, pp.293-306.
Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., Martinez, F.H.V.: A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. In: Frith, M. and Storm Pedersen, C.N. (eds.) Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Bioinformatics. 9838, p. 293-306. Springer, Cham (2016).
Rubert, Diego, Feijão, Pedro, Dias Vieira Braga, Marília, Stoye, Jens, and Martinez, Fábio Henrique Viduani. “A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates”. Algorithms in Bioinformatics. WABI 2016. Ed. Martin Frith and Christian Nørgaard Storm Pedersen. Cham: Springer, 2016.Vol. 9838. Lecture Notes in Bioinformatics. 293-306.
Google Scholar
ISBN Suche