Pattern matching and consensus problems on weighted sequences and profiles
From MaRDI portal
Publication:2000001
DOI10.1007/s00224-018-9881-2zbMath1423.68620OpenAlexW2963301048MaRDI QIDQ2000001
Solon P. Pissis, Jakub Radoszewski, Tomasz Kociumaka
Publication date: 27 June 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9881-2
Related Items (3)
Property Suffix Array with Applications in Indexing Weighted Sequences ⋮ Indexing weighted sequences: neat and efficient ⋮ Streaming \(k\)-mismatch with error correcting and applications
Cites Work
- The property suffix tree with dynamic properties
- Polynomial kernels for weighted problems
- Linear-time computation of prefix table for weighted strings {\&} applications
- Fast profile matching algorithms - A survey
- Property matching and weighted matching
- Errata for ``Faster index for property matching
- Nearly optimal binary search trees
- On a class of \(O(n^ 2)\) problems in computational geometry
- Streaming \(k\)-mismatch with error correcting and applications
- Faster index for property matching
- On-Line Pattern Matching on Uncertain Sequences and Applications
- Computing Partitions with Applications to the Knapsack Problem
- Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
- Fast Average-Case Pattern Matching on Weighted Sequences
- Algorithms on Strings
- On the complexity of \(k\)-SAT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pattern matching and consensus problems on weighted sequences and profiles
