On-line weighted pattern matching
From MaRDI portal
Publication:1740646
DOI10.1016/j.ic.2019.01.001zbMath1421.68254OpenAlexW2907738060WikidataQ128663088 ScholiaQ128663088MaRDI QIDQ1740646
Panagiotis Charalampopoulos, Jakub Radoszewski, Costas S. Iliopoulos, Solon P. Pissis
Publication date: 2 May 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.01.001
weighted sequenceonline pattern matchinguncertain sequenceposition weight matrix (PWM)string-matching automaton
Related Items
Property Suffix Array with Applications in Indexing Weighted Sequences, Indexing weighted sequences: neat and efficient
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time approximation algorithms for weighted LCS problem
- Linear-time computation of prefix table for weighted strings {\&} applications
- A black box for online approximate pattern matching
- String processing and information retrieval. 18th international symposium, SPIRE 2011, Pisa, Italy, October 17--21, 2011. Proceedings
- Property matching and weighted matching
- Crochemore's partitioning on weighted strings and applications
- Property suffix array with applications
- On-Line Pattern Matching on Uncertain Sequences and Applications
- A fast string searching algorithm
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Efficient string matching
- Fast Pattern Matching in Strings
- Approximate Matching in Weighted Sequences
- Fast Average-Case Pattern Matching on Weighted Sequences
- Algorithms on Strings
- Weighted LCS