Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences.

Timo Beller|Katharina Berger|Enno Ohlebusch


Anthology ID:DBLP:conf/spire/BellerBO12
Volume:String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings
Year:2012
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:99-110
URL:https://doi.org/10.1007/978-3-642-34109-0_11
DOI:https://doi.org/10.1007/978-3-642-34109-0_11
DBLP:conf/spire/BellerBO12
BibTeX:
@inproceedings{beller-2012-spaceefficient, author = {Timo Beller and Katharina Berger and Enno Ohlebusch}, editor = {Liliana Calder\'{o}n-Benavides and Cristina N. Gonz\'{a}lez-Caro and Edgar Ch\'{a}vez and Nivio Ziviani}, title = {{Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences}}, booktitle = {{String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {99--110}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0_11}, doi = {https://doi.org/10.1007/978-3-642-34109-0_11} }