The exact multiple pattern matching problem solved by a reference tree approach

DOI10.1016/j.tcs.2021.06.003OpenAlexW3175881578MaRDI QIDQ2044955

Chin Lung Lu, Shyong Jian Shyu, Yi-Kung Shieh, Richard Chia-Tung Lee

Publication date: 11 August 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.003

zbMATH Keywords

suffix arraysuffix treeDNA sequenceexact multiple pattern matchingreference stringreference tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• SPAdes
• Velvet
• SOAPdenovo
• Mauve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• String processing and information retrieval. 22nd international symposium, SPIRE 2015, London, UK, September 1--4, 2015. Proceedings
• Replacing suffix trees with enhanced suffix arrays
• Parallel computation for the all-pairs suffix-prefix problem
• On-line construction of suffix trees
• Compressed suffix trees with full functionality
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Fully compressed suffix trees
• New text indexing functionalities of the compressed suffix arrays
• Error Detecting and Error Correcting Codes
• Fast and Lightweight LCP-Array Construction Algorithms
• Algorithms on Strings
• Encyclopedia of Algorithms
• Trickier XBWT tricks

This page was built for publication: The exact multiple pattern matching problem solved by a reference tree approach