Finding Common RNA Pseudoknot Structures in Polynomial Time
Author:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 223-232
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A New Distance for High Level RNA Secondary Structure ComparisonIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2005
- A polynomial-time algorithm for the matching of crossing contact-map patternsIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- On the computational complexity of 2-interval pattern matching problemsTheoretical Computer Science, 2004
- Computing Similarity between RNA Structures1999
- Finding Common Subsequences with Arcs and Pseudoknots1999
- The Ribonuclease P DatabaseNucleic Acids Research, 1999
- Computing similarity between RNA strings1995