Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson--Crick Base Pairs

DOI10.1137/15M1008841zbMath1375.05053arXiv1501.03238OpenAlexW2963046103MaRDI QIDQ4594481

Francis Black, Elizabeth Drellich, Julianna S. Tymoczko

Publication date: 24 November 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

plane treesRNA foldingnoncrossing matchings

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Biochemistry, molecular biology (92C40)

Related Items (2)

Folding Words Around Trees: Models Inspired by RNA ⋮ \(k\)-foldability of words

Cites Work

• Rational parking functions and Catalan numbers
• On the enumeration of non-crossing pairings of well-balanced binary strings
• Enumeration of non-crossing pairings on bit strings
• Combinatorics of RNA secondary structures
• Noncrossing Partitions in Surprising Locations
• Handbook of Enumerative Combinatorics

This page was built for publication: Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson--Crick Base Pairs