Database Paper Browser

Back to papers

A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application

Summary: Introduces a subsequence matching framework with gaps-range-tolerances in both query and target, plus max-gap and min-match constraints for Q-by-humming. A space- and time-efficient DP method finds the best-matching subsequence under these constraints, demonstrated on 2D music time-series and outperforming DP-based and probabilistic baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10305
Venue
VLDB
Year
2011
Pagerank
4.3441378e-05
Overall Rank
9,428 | 34.42%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
251 Robust and Fast Similarity Search for Moving Object Trajectories 2005 SIGMOD 0.00030644658
358 On The Marriage of Lp-norms and Edit Distance 2004 VLDB 0.0002599481
699 Exact Indexing of Dynamic Time Warping 2002 VLDB 0.00018015254
1,061 Warping Indexes with Envelope Transforms for Query by Humming 2003 SIGMOD 0.00014368716
Previous Page 1 / 1 Next

Semantically Similar Papers