Classical and quantum algorithms for constructing text from dictionary problem

DOI10.1007/s11047-021-09863-1zbMath1530.68273arXiv2005.14335OpenAlexW3188874188MaRDI QIDQ6095516

Vladislav Remidovskii, Kamil Khadiev

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.14335

zbMATH Keywords

quantum computationquantum algorithmstring constructionsequence assembly

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Quantum algorithm for dynamic programming approach for DAGs and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum pattern matching fast on average
• String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
• Guide to competitive programming. Learning and improving algorithms through contests
• Quantum-over-classical advantage in solving multiplayer games
• Using a VOM model for reconstructing potential coding regions in EST sequences
• On the quantum and classical complexity of solving subtraction games
• Upperbounds on the probability of finding marked connected components using quantum walks
• Quantum Computation and Quantum Information
• Efficient randomized pattern-matching algorithms
• Strengths and Weaknesses of Quantum Computing
• Optimal in-place suffix sorting

This page was built for publication: Classical and quantum algorithms for constructing text from dictionary problem