Abhijit Chattaraj, Laxmi Parida. An inexact-suffix-tree-based algorithm for detecting extensible patterns. Theoretical Computer Science, 335(1):3-14, 2005. [doi]
@article{ChattarajP05,
title = {An inexact-suffix-tree-based algorithm for detecting extensible patterns},
author = {Abhijit Chattaraj and Laxmi Parida},
year = {2005},
doi = {10.1016/j.tcs.2004.12.013},
url = {http://dx.doi.org/10.1016/j.tcs.2004.12.013},
tags = {rule-based},
researchr = {https://researchr.org/publication/ChattarajP05},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {335},
number = {1},
pages = {3-14},
}