Finding Pseudo-Repetitions

Gawrychowski, Pawel; Manea, Florin; Mercas, Robert; Nowotka, Dirk; Tiseanu, Catalin

doi:10.4230/LIPIcs.STACS.2013.257

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Finding Pseudo-Repetitions

MPS-Authors

/persons/resource/persons118149

Gawrychowski, Pawel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2013/3939/
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gawrychowski, P., Manea, F., Mercas, R., Nowotka, D., & Tiseanu, C. (2013). Finding Pseudo-Repetitions. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science (pp. 257-268). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.STACS.2013.257.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0015-3AB7-6

Abstract

There is no abstract available