Improved approximate pattern matching on hypertext

DOI10.1016/S0304-3975(99)00333-3MaRDI QIDQ1566744zbMATH OpenOpenAlexFDO

Authors Gonzalo Navarro

Publication date 4 June 2000

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

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00333-3, http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3265541

zbMATH Keywords

approximate structure matchinggraph algorithms

Mathematics Subject Classification ID

Computing methodologies for text processing; mathematical typography (68U15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Pattern Matching in Hypertext
• Pattern matching in hypertext
• Fast pattern matching in indexed texts
• Approximating Approximate Pattern Matching
• Improving an algorithm for approximate pattern matching
• Combinatorial Pattern Matching
• String Processing and Information Retrieval
• Faster approximate pattern matching in compressed repetitive texts
• Approximate pattern matching on elastic-degenerate text
• An Improved Algorithm For Approximate String Matching

Cites work

• A subquadratic algorithm for approximate limited expression matching
• Fast string matching with k differences
• Finding approximate patterns in strings
• New and faster filters for multiple approximate string matching
• Pattern Matching in Hypertext
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(20)

• On the complexity of approximately matching a string to a directed graph
• The complexity of approximate pattern matching on de Bruijn graphs
• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• Pattern Matching in Hypertext
• On the complexity of string matching for graphs
• Pattern matching in hypertext
• Hypertext searching -- a survey
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
• Sequence to graph alignment using gap-sensitive co-linear chaining
• On the Complexity of String Matching for Graphs
• Quantum time complexity and algorithms for pattern matching on labeled graphs
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Elastic-degenerate string matching with 1 error or mismatch
• Complexity results and algorithms for representing paths in digraphs
• Fast pattern matching with epsilon transitions
• A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Representing paths in digraphs
• Fast pattern matching with epsilon transitions
• Parameterized matching on non-linear structures

This page was built for publication: Improved approximate pattern matching on hypertext

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