Online Windowed Subsequence Matching over Probabilistic Sequences
Summary: Online windowed subsequence matching over probabilistic sequences to handle noisy streams and CEP. Exact algorithm, randomized approximation with provable accuracy, adaptive filtering, and negation-enabled patterns; validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zheng Li (University of Massachusetts Lowell)
- 2. Tingjian Ge (University of Massachusetts Lowell)
BibTeX Citation
@inproceedings{li_sigmod12,
title = {{Online Windowed Subsequence Matching over Probabilistic Sequences}},
author = {Li, Zheng and Ge, Tingjian},
series = {{SIGMOD} '12},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2213836.2213868},
url = {https://dl.acm.org/doi/10.1145/2213836.2213868},
year = {2012}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,240 | E-Matching: Event Processing over Noisy Sequences in Real Time | 2013 | SIGMOD | 5.093636e-05 |
| 12,283 | RCSI: Scalable similarity search in thousand(s) of genomes | 2013 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,086 | Efficient and Effective KNN Sequence Search with Approximate n-grams | 2014 | VLDB |
| 2 | 3,125 | General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows | 2002 | SIGMOD |
| 3 | 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD |
| 4 | 8,780 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB |
| 5 | 5,162 | Online Event-driven Subsequence Matching over Financial Data Streams | 2004 | SIGMOD |
| 6 | 7,692 | Efficient Top-k Algorithms for Approximate Substring Matching | 2013 | SIGMOD |
| 7 | 9,232 | Window-Accumulated Subsequence matching Problem is linear | 1999 | PODS |
| 8 | 5,592 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB |
| 9 | 12,240 | E-Matching: Event Processing over Noisy Sequences in Real Time | 2013 | SIGMOD |
| 10 | 8,114 | Approximate Substring Matching over Uncertain Strings | 2011 | VLDB |