Modeling of RNA secondary structures using two-way quantum finite automata
From MaRDI portal
Publication:2201368
DOI10.1016/j.chaos.2018.09.035zbMath1442.81016OpenAlexW2895513438WikidataQ129164035 ScholiaQ129164035MaRDI QIDQ2201368
Ajay Kumar, Amandeep Singh Bhatia
Publication date: 29 September 2020
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2018.09.035
quantum finite automatatwo-way quantum finite automatadouble helix loophairpin loopinternal loopribonucleic acid
Quantum computation (81P68) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution, Quantum \(\omega\)-automata over infinite words and their relationships, On the power of two-way multihead quantum finite automata, On relation between linear temporal logic and quantum finite automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
- Superiority of exact quantum automata for promise problems
- Application of distributed semi-quantum computing model in phase estimation
- Promise problems solved by quantum and classical finite automata
- An application of quantum finite automata to interactive proof systems
- Quantum automata and quantum grammars
- Formal language representation and modelling structures underlying RNA folding process
- Global multipartite entanglement dynamics in Grover's search algorithm
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Universal matrix insertion grammars with small size
- String variable grammar: A logic grammar formalism for the biological language of DNA
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- DNA Computing
- Debates with Small Transparent Quantum Verifiers