An Efficient Hash-Based Algorithm for Sequence Data Searching

DOI10.1093/COMJNL/41.6.402MaRDI QIDQ4246266zbMATH OpenOpenAlexFDO

Authors

Publication date 31 May 1999

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/63a40fd37dc14f0865c40207a327d51c11101813

zbMATH Keywords

searching algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Recommendations

• A fast projection algorithm for sequence data searching
• Efficient similarity search for multi-dimensional time sequences
• scientific article; zbMATH DE number 2089862
• Similarity search based on shape k-d tree for multidimensional time sequence

Cited in

(3)

• An efficient algorithm for attribute-based subsequence matching
• A data association algorithm based on unequal length sequence data similarity mining
• A fast projection algorithm for sequence data searching

This page was built for publication: An Efficient Hash-Based Algorithm for Sequence Data Searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246266)