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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics and theoretical computer science 2017-04, Vol.19 (2)
Hauptverfasser: Martinez, Megan A, Riehl, Manda
Format: Artikel
Sprache:eng
Schlagworte:
Graphs
Nesting
Ribonucleic acid
RNA
Similarity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 2
container_start_page
container_title Discrete mathematics and theoretical computer science
container_volume 19
creator Martinez, Megan A
Riehl, Manda
description 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.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2000697986</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2000697986</sourcerecordid><originalsourceid>FETCH-proquest_journals_20006979863</originalsourceid><addsrcrecordid>eNqNjLsKwkAQAA9BMD7-YUGwO7gk5lWKKBYKFvbhEjfmQnKn2Q3i35vCD7CaYoaZCM8P40imKlIzMSdqlPKDbJt44rKDwjRYsnEWCuQ3ogWuEQgZXAUWiY19SDKdaXVv-ANlq4mQQNs7nGEDV-g0l_VY0VJMK90Srn5ciPXxcNuf5LN3r2Fc5Y0bejuqPFBKxVmSpXH4X_UFtyI8ag</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2000697986</pqid></control><display><type>article</type><title>A bijection between the set of nesting-similarity classes and L &amp; P matchings</title><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Martinez, Megan A ; Riehl, Manda</creator><creatorcontrib>Martinez, Megan A ; Riehl, Manda</creatorcontrib><description>Matchings are frequently used to model RNA secondary structures; however, notall matchings can be realized as RNA motifs. One class of matchings, called theL &amp;&amp; P matchings, is the most restrictive model for RNA secondary structuresin the Largest Hairpin Family (LHF). The L &amp;&amp; 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.</description><identifier>EISSN: 1365-8050</identifier><language>eng</language><publisher>Nancy: DMTCS</publisher><subject>Graphs ; Nesting ; Ribonucleic acid ; RNA ; Similarity</subject><ispartof>Discrete mathematics and theoretical computer science, 2017-04, Vol.19 (2)</ispartof><rights>Copyright DMTCS 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Martinez, Megan A</creatorcontrib><creatorcontrib>Riehl, Manda</creatorcontrib><title>A bijection between the set of nesting-similarity classes and L &amp; P matchings</title><title>Discrete mathematics and theoretical computer science</title><description>Matchings are frequently used to model RNA secondary structures; however, notall matchings can be realized as RNA motifs. One class of matchings, called theL &amp;&amp; P matchings, is the most restrictive model for RNA secondary structuresin the Largest Hairpin Family (LHF). The L &amp;&amp; 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.</description><subject>Graphs</subject><subject>Nesting</subject><subject>Ribonucleic acid</subject><subject>RNA</subject><subject>Similarity</subject><issn>1365-8050</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNjLsKwkAQAA9BMD7-YUGwO7gk5lWKKBYKFvbhEjfmQnKn2Q3i35vCD7CaYoaZCM8P40imKlIzMSdqlPKDbJt44rKDwjRYsnEWCuQ3ogWuEQgZXAUWiY19SDKdaXVv-ANlq4mQQNs7nGEDV-g0l_VY0VJMK90Srn5ciPXxcNuf5LN3r2Fc5Y0bejuqPFBKxVmSpXH4X_UFtyI8ag</recordid><startdate>20170401</startdate><enddate>20170401</enddate><creator>Martinez, Megan A</creator><creator>Riehl, Manda</creator><general>DMTCS</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BFMQW</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20170401</creationdate><title>A bijection between the set of nesting-similarity classes and L &amp; P matchings</title><author>Martinez, Megan A ; Riehl, Manda</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20006979863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Graphs</topic><topic>Nesting</topic><topic>Ribonucleic acid</topic><topic>RNA</topic><topic>Similarity</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Martinez, Megan A</creatorcontrib><creatorcontrib>Riehl, Manda</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Continental Europe Database</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Discrete mathematics and theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Martinez, Megan A</au><au>Riehl, Manda</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A bijection between the set of nesting-similarity classes and L &amp; P matchings</atitle><jtitle>Discrete mathematics and theoretical computer science</jtitle><date>2017-04-01</date><risdate>2017</risdate><volume>19</volume><issue>2</issue><eissn>1365-8050</eissn><abstract>Matchings are frequently used to model RNA secondary structures; however, notall matchings can be realized as RNA motifs. One class of matchings, called theL &amp;&amp; P matchings, is the most restrictive model for RNA secondary structuresin the Largest Hairpin Family (LHF). The L &amp;&amp; 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.</abstract><cop>Nancy</cop><pub>DMTCS</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 1365-8050
ispartof Discrete mathematics and theoretical computer science, 2017-04, Vol.19 (2)
issn 1365-8050
language eng
recordid cdi_proquest_journals_2000697986
source DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Graphs
Nesting
Ribonucleic acid
RNA
Similarity
title A bijection between the set of nesting-similarity classes and L & P matchings
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T22%3A55%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20bijection%20between%20the%20set%20of%20nesting-similarity%20classes%20and%20L%20&%20P%20matchings&rft.jtitle=Discrete%20mathematics%20and%20theoretical%20computer%20science&rft.au=Martinez,%20Megan%20A&rft.date=2017-04-01&rft.volume=19&rft.issue=2&rft.eissn=1365-8050&rft_id=info:doi/&rft_dat=%3Cproquest%3E2000697986%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2000697986&rft_id=info:pmid/&rfr_iscdi=true