Near-optimal algorithm to count occurrences of subsequences...

Discrete Mathematics Algorithms and Applications 2017 / 06 Vol. 9; Iss. 3

Near-optimal algorithm to count occurrences of subsequences of a given length

Torres-Jimenez, Jose, Izquierdo-Marquez, Idelfonso, Ramirez-Acuna, Daniel, Peralta, Rene
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
9
Language:
english
Journal:
Discrete Mathematics, Algorithms and Applications
DOI:
10.1142/S1793830917500422
Date:
June, 2017
File:
PDF, 194 KB
english, 2017
Conversion to is in progress
Conversion to is failed