Patterns with bounded treewidth
- Submitting institution
-
Loughborough University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1928
- Type
- D - Journal article
- DOI
-
10.1016/j.ic.2014.08.010
- Title of journal
- Information and Computation
- Article number
- -
- First page
- 87
- Volume
- 239
- Issue
- -
- ISSN
- 0890-5401
- Open access status
- Out of scope for open access requirements
- Month of publication
- August
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 12
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper has impacted the state-of-the-art by establishing an approach to efficiently solvable pattern matching problems that has facilitated or inspired a significant number of subsequent insights and methods, e.g.:
- Fernau et al. Pattern Matching with Variables: Fast Algorithms and New Hardness Results. Proc. STACS 2015
- Day et al. Local Patterns. Proc. FSTTCS 2017
- Fernau et al. Revisiting Shinohara's algorithm for computing descriptive patterns. Theoretical Computer Science 733, 2018
The significance of the approach is also acknowledged by a survey article:
- Bulteau et al. Multivariate Algorithmics for NP-Hard String Problems. Bulletin of the EATCS, 2014
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -