An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Hideo BannaiTravis GagieTomohiro IShunsuke InenagaGad M. LandauMoshe LewensteinPublished in: Inf. Process. Lett. (2012)
Keyphrases
- straight line
- detection algorithm
- compressed pattern matching
- dynamic programming
- matching algorithm
- learning algorithm
- digital straight line
- line detection
- string matching
- np hard
- computational complexity
- computationally efficient
- expectation maximization
- hough transform
- optimal solution
- similarity measure
- machine learning