A bijection between the set of nesting-similarity classes and L & P matchings

Matchings are frequently used to model RNA secondary structures; however, notall matchings can be realized as RNA motifs. One class of matchings, called theL && P matchings, is the most restrictive model for RNA secondary structuresin the Largest Hairpin Family (LHF). The L && P matc...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science 2017-04, Vol.19 (2)
Main Authors: Martinez, Megan A, Riehl, Manda
Format: Article
Language:English
Subjects:
Graphs
Nesting
Ribonucleic acid
RNA
Similarity
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Matchings are frequently used to model RNA secondary structures; however, notall matchings can be realized as RNA motifs. One class of matchings, called theL && P matchings, is the most restrictive model for RNA secondary structuresin the Largest Hairpin Family (LHF). The L && P matchings were enumerated in20152015 by Jefferson, and they are equinumerous with the set ofnesting-similarity classes of matchings, enumerated by Klazar. We provide abijection between these two sets. This bijection preserves noncrossingmatchings, and preserves the sequence obtained reading left to right of whetheran edge begins or ends at that vertex.
ISSN:1365-8050