Window-Accumulated Subsequence Matching Problem is Linear

Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich. Window-Accumulated Subsequence Matching Problem is Linear. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania. pages 327-336, ACM Press, 1999. [doi]

@inproceedings{BoassonCGM99,
  title = {Window-Accumulated Subsequence Matching Problem is Linear},
  author = {Luc Boasson and Patrick Cégielski and Irène Guessarian and Yuri Matiyasevich},
  year = {1999},
  doi = {10.1145/303976.304008},
  url = {http://doi.acm.org/10.1145/303976.304008},
  researchr = {https://researchr.org/publication/BoassonCGM99},
  cites = {0},
  citedby = {0},
  pages = {327-336},
  booktitle = {Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania},
  publisher = {ACM Press},
  isbn = {1-58113-062-7},
}