BOOK-CHAPTER
Efficient Approximate Subsequence Matching Using Hybrid Signatures
Tao QiuXiaochun YangBin WangYutong HanSiyao Wang
Year: 2018 Lecture notes in computer science Pages: 600-609 Publisher: Springer Science+Business Media
Keywords:
Subsequence Substring Computer science Longest common subsequence problem Matching (statistics) Similarity (geometry) Focus (optics) Pattern matching Algorithm Data mining Pattern recognition (psychology) Artificial intelligence Data structure Mathematics Image (mathematics)
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
14
Refs
0.05
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Genomics and Phylogenetic Studies
Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology
RNA and protein synthesis mechanisms
Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology
Related Documents
JOURNAL ARTICLE
Hobbes3: Dynamic generation of variable-length signatures for efficient approximate subsequence mappings
Year: 2016 Vol: 14 Pages: 169-180
JOURNAL ARTICLE
Approximate Hough transform for video subsequence matching
Chih‐Yi ChiuYu-Cyuan LiouTsung‐Han Tsai
Year: 2014 Pages: 1-6
BOOK-CHAPTER
Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index
Tae Sik HanSeung-Kyu KoJaewoo Kang
Lecture notes in computer science Year: 2007 Pages: 585-600
JOURNAL ARTICLE
Radius-aware approximate blank node matching using signatures
Christina LantzakiPanagiotis PapadakosAnastasia AnalytiYannis Tzitzikas
Journal: Knowledge and Information Systems Year: 2016 Vol: 50 (2)Pages: 505-542