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/dmaa/Torres-JimenezI17
%A Torres-Jimenez, Jose
%A Izquierdo-Marquez, Idelfonso
%A Ramirez-Acuna, Daniel
%A Peralta, René
%D 2017
%J Discret. Math. Algorithms Appl.
%K dblp
%N 3
%P 1750042:1-1750042:10
%T Near-optimal algorithm to count occurrences of subsequences of a given length.
%U http://dblp.uni-trier.de/db/journals/dmaa/dmaa9.html#Torres-JimenezI17
%V 9
@article{journals/dmaa/Torres-JimenezI17,
added-at = {2023-02-03T00:00:00.000+0100},
author = {Torres-Jimenez, Jose and Izquierdo-Marquez, Idelfonso and Ramirez-Acuna, Daniel and Peralta, René},
biburl = {https://www.bibsonomy.org/bibtex/2e4126ce0476074435d372faed0784ac6/dblp},
ee = {https://www.wikidata.org/entity/Q47663982},
interhash = {60f37612f02a7d26063a2ddc503df9e3},
intrahash = {e4126ce0476074435d372faed0784ac6},
journal = {Discret. Math. Algorithms Appl.},
keywords = {dblp},
number = 3,
pages = {1750042:1-1750042:10},
timestamp = {2024-04-09T01:33:54.000+0200},
title = {Near-optimal algorithm to count occurrences of subsequences of a given length.},
url = {http://dblp.uni-trier.de/db/journals/dmaa/dmaa9.html#Torres-JimenezI17},
volume = 9,
year = 2017
}