Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data

DOI10.4036/iis.2015.37zbMath1478.68064OpenAlexW2326248815MaRDI QIDQ5135244

Kazuyuki Narisawa, Ayumi Shinohara, Takashi Katsura, Hiroyuki Ota

Publication date: 19 November 2020

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2015.37

zbMATH Keywords

data structurepermuted pattern matchingmulti-track

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05)

Related Items (1)

Permuted pattern matching algorithms on multi-track strings

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Permuted Pattern Matching on Multi-track Strings
• Similarity estimation techniques from rounding algorithms
• Efficient randomized pattern-matching algorithms
• Dynamic programming algorithm optimization for spoken word recognition
• Locality-sensitive hashing scheme based on p-stable distributions

This page was built for publication: Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data