Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/mst/GawrychowskiIIK18
%A Gawrychowski, Pawel
%A I, Tomohiro
%A Inenaga, Shunsuke
%A Köppl, Dominik
%A Manea, Florin
%D 2018
%J Theory Comput. Syst.
%K dblp
%N 1
%P 162-191
%T Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.
%U http://dblp.uni-trier.de/db/journals/mst/mst62.html#GawrychowskiIIK18
%V 62
@article{journals/mst/GawrychowskiIIK18,
added-at = {2021-10-14T00:00:00.000+0200},
author = {Gawrychowski, Pawel and I, Tomohiro and Inenaga, Shunsuke and Köppl, Dominik and Manea, Florin},
biburl = {https://www.bibsonomy.org/bibtex/26a743bfaa0d3c410ea1e53364895a0fa/dblp},
ee = {https://doi.org/10.1007/s00224-017-9794-5},
interhash = {667581efb4360ba49eaf3f42139a80c6},
intrahash = {6a743bfaa0d3c410ea1e53364895a0fa},
journal = {Theory Comput. Syst.},
keywords = {dblp},
number = 1,
pages = {162-191},
timestamp = {2024-04-08T20:53:05.000+0200},
title = {Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.},
url = {http://dblp.uni-trier.de/db/journals/mst/mst62.html#GawrychowskiIIK18},
volume = 62,
year = 2018
}
