A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class
From MaRDI portal
Publication:924681
DOI10.1016/j.tcs.2007.09.026zbMath1145.92313OpenAlexW1992492061MaRDI QIDQ924681
Publication date: 19 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.026
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Biochemistry, molecular biology (92C40) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Classifying RNA pseudoknotted structures
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Tree adjoining grammars for RNA structure prediction
- Planarizing Graphs - A Survey and Annotated Bibliography
- Efficient Planarity Testing
This page was built for publication: A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class