DBScholar

Back to papers

On the String Matching with k Differences in DNA Databases

Summary: Introduces a BWT(y)-based index for approximate DNA-string matching with insertions, deletions, and mismatches. Pattern decomposition enables candidate filtering and verification in O(k|T|) time, with average |T|=O(|Σ|^{2k}), outperforming prior methods for small k. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12793
Venue
VLDB
Year
2021
Pagerank
-
Overall Rank
13,474 | 7.56%
DOI
10.14778/3447689.3447695

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{chen_vldb21,
        title = {{On the String Matching with k Differences in DNA Databases}},
        author = {Chen, Yangjun and Nguyen, Hoang Hai},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {6},
        pages = {903--915},
        doi = {10.14778/3447689.3447695},
        url = {https://doi.org/10.14778/3447689.3447695},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers