An efficient pattern matching algorithm on a subclass of context free grammars

DOI10.1007/978-3-540-30550-7_19MaRDI QIDQ5711956zbMATH OpenOpenAlexFDO

Authors Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b103739

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Nonnumerical algorithms (68W05)

Recommendations

• Improving Time and Space Complexity for Compressed Pattern Matching
• Pattern matching in compressed texts
• String Processing and Information Retrieval

Cited in

(5)

• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching
• scientific article; zbMATH DE number 4039342 (Why is no real title available?)
• Computing Longest Common Substring and All Palindromes from Compressed Strings

This page was built for publication: An efficient pattern matching algorithm on a subclass of context free grammars

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