Methods for Analyzing RNA Pseudoknots via Chord Diagrams and Intersection Graphs Authors: Rayan Ibrahim, Allison H. Moore Published: 2026 ABSTRACT RNA molecules are known to form complex secondary structures including pseudoknots. A systematic framework for the enumeration, classification and prediction of secondary structures is critical to determine the biological significance of the molecular configurations of RNA. Chord diagrams are mathematical objects widely used to represent RNA secondary structures and to analyze structural motifs, however a mathematically rigorous enumeration of pseudoknots remains a challenge. We introduce a method that incorporates a distance-based metric \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ to analyze the intersection graph of a chord diagram associated with a pseudoknotted structure. In particular, our method formally defines a pseudoknot in terms of a weighted vertex cover of a certain intersection graph constructed from a partition of the chord diagram representing the nucleotide sequence of the RNA molecule. In this graph theoretic context, we introduce a rigorous algorithm that enumerates pseudoknots, classifies secondary structures, and is sensitive to three-dimensional topological features. We implement our methods in MATLAB and test the algorithm on pseudoknotted structures from the bpRNA-1m database. Our findings confirm that genus is a robust quantifier of pseudoknot complexity. Introduction Ribonucleic acid (RNA) is a molecule essential to many functions of life, notably gene expression, cellular communication, and the storage and transfer of genetic information. The primary structure of RNA refers to the sequence of its four nitrogenous bases adenine (A), guanine (G), cytosine (C), and uracil (U), attached along a sugar-phosphate backbone (Elliott and Ladomery 2023). It is well known that RNA molecules fold into a variety of secondary and tertiary structures related to their natural functions via complementary Watson-Crick base pairings and other pairings (Watson et al. 2013; Elliott and Ladomery 2023). Common secondary structure motifs include hairpin loops, stems (i.e. ‘stacks’), bulges, interior loops, multiloops, single-stranded regions, and pseudoknots (Reidys 2011), (Danaee et al. 2018, Figure 1) (see Figure 4). A pseudoknot is a secondary structure motif representing a three-dimensional folding pattern. Pseudoknots were first recognized in the study of the turnip yellow mosaic virus (Rietveld et al. 1982; Dumas et al. 1987), but the term was coined in Studnicka et al. (1978). The simplest type of pseudoknotted structure is an H-type pseudoknot, formed when nucleobases along the loop of a hairpin bond with nucleobases elsewhere along the sequence (Brierley et al. 2007). A variety of pseudoknot motifs have been characterized including H-type, K-type, L-type, and M-type motifs (Kucharík et al. 2015; Andrikos et al. 2022). RNA secondary structures may be represented graphically with chord diagrams, objects common in enumerative combinatorics and topology. In the representation of an RNA secondary structure, bonded pairs are indicated by arcs (‘chords’) along a line segment or circle. A precursor to a chord diagram representing secondary structures appears in Waterman (1978) as a connection to predictive models using base-pairing matrices (Tinoco et al. 1971). There, RNA secondary structures were defined as simple planar graphs on a set of n labeled points such that a path along the n points represents the primary structure, with other edges representing bonds between bases (Waterman 1978, Definition 2.1). These planar graphs correspond to crossingless chord diagrams, which have since been studied extensively as models for secondary structures (Bon et al. 2008; Reidys et al. 2011; Kabak et al. 2004; Waterman and Smith 1978; Waterman 1979; Penner and Waterman 1993; Schmitt and Waterman 1994). Pseudoknots occur only when the corresponding chord diagrams contain chords that cross each other (Bon et al. 2008; Kabak et al. 2004; Reidys et al. 2011). Despite the relative simplicity of a chord diagram, there is no agreed-upon method for quantifying the complexity of RNA pseudoknotting. A naive count of crossings overemphasizes contributions from helical stacking, and different methods for reducing parallel bonds may yield different enumerations of pseudoknots. Moreover, existing methods may ignore some topological features of the 3D conformation. We investigate these discrepancies in Sections 2.2 and 3.1. Our goal is to construct a mathematically rigorous and topologically robust framework for quantifying pseudoknot complexity in RNA, presented in the familiar language of graph theory and building upon conventions implicitly assumed in the bpRNA method (Danaee et al. 2018) and bpRNA-1m database (Danaee et al. 2018). The bpRNA-1m database aggregates over 100K RNA secondary structures from seven sources (Cannone et al. 2002; Zwieb 2003; Rosenblad 2003; Juhling et al. 2009; Brown 1998; Griffiths-Jones 2003; Berman et al. 2000). Internal annotation routines and the enumeration of pseudoknots and other structural motifs are conducted via the algorithmic tool bpRNA (Danaee et al. 2018). This database provides the primary test case for our graph theoretic procedures. The strategy presented here verifies the reproducibility of both our methods and those of the bpRNA tool (Danaee et al. 2018), while illustrating discrepancies resulting from topological conformations. Section 2 develops a mathematical formulation of pseudoknotting using chord diagrams and intersection graphs. The relevant graph theoretical background is reviewed in Section 2.1, and we prove a relationship between vertex cover numbers and the genus of a chord diagram in Theorem 2. In Section 2.2, we investigate precedent theories of pseudoknotting (particularly those in Danaee et al. 2018) and convey these notions into our mathematical framework. Specifically, we use a weighted vertex cover of an intersection graph constructed from a partition of the chord diagram corresponding to an RNA molecule to give a precise enumeration of pseudoknots (note that enumeration via vertex cover appeared in Kabak et al. (2004)). In Section 3, we introduce the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-reduction algorithm, which systematically reduces the complexity of a chord diagram to quantify pseudoknots in a robust manner that takes into account 3D topological features, including nestings, crossings, and a distance-based threshold \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ. An explicit MATLAB implementation of our algorithm is provided in Supplementary Information. Examples 2 and 3 in this section demonstrate discrepancies in the existing methodology that are corrected by our current methods. In Section 4 we present the results of our analyses. We report quantities of pseudoknots, improving upon previous methods. In Bon et al. (2008) it was shown that these basic motifs constitute the irreducible pseudoknots of genus equal to one (see Section 4.3 for a discussion on genus). Moreover, they posit that the topological genus of a chord diagram provides a classification of RNA secondary structures with pseudoknots. Our analysis in Section 4.3 together with Theorem 2 confirms that even with additional topological considerations, genus is a robust classifier of pseudoknot complexity. Combinatorial Theory Chord Diagrams A linear chord diagram D is a set of n points on an oriented line segment together with a (partial) matching of the points. Circular chord diagrams are obtained by joining the endpoints of the segment; however we will restrict to linear chord diagrams throughout. We denote chords as pairs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c = (\ell , r)$$\end{document}c=(ℓ,r), where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document}ℓ and r denote left and right endpoints, respectively. Because chord diagrams are matchings, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell < r$$\end{document}ℓ r_{\max }$$\end{document}r′>rmax, i.e. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c'$$\end{document}c′ crosses every chord in S. No other right endpoint of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'$$\end{document}S′ is less than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r_{\max }$$\end{document}rmax, as otherwise S or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'$$\end{document}S′ are chord obstructed. Thus any pair of chords from S and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'$$\end{document}S′ cross.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square $$\end{document}□ In other words, Theorem 3 says that two segments \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s,s'\in S$$\end{document}s,s′∈S cross whenever any chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c\in s, c'\in s'$$\end{document}c∈s,c′∈s′ cross. The segment graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS of a chord diagram is a variation on an intersection graph whose vertex set is the set of segments, where two vertices are adjacent if their segments cross (Danaee et al. 2018). Vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS are weighted by the number of chords contained in their corresponding segments. The terminology PK-segment refers to any segment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s\in {{\mathcal {S}}}$$\end{document}s∈S that crosses any other segment. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{{\mathcal {S}}}\subset G_{{\mathcal {S}}}$$\end{document}HS⊂GS be the subgraph with isolated vertices removed, referred to as the PK-segment graph in Danaee et al. (2018). In Danaee et al. (2018), pseudoknotted structures are identified by finding a maximum weight independent set I in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{{\mathcal {S}}}$$\end{document}HS via a heuristic approach, with an exact algorithm used in the specific case of components which are paths. As we have formalized above, the set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P = V(G_{{\mathcal {S}}})-I$$\end{document}P=V(GS)-I is a minimum weight vertex cover of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS. That is, P is a set of segments of minimum cardinality in C that when removed from D leave a pseudoknot-free structure. We may now formally quantify the size of a pseudoknotted structure according to the conventions of the bpRNA-1m database, as implied by the algorithms of Danaee et al. (2018). Definition 5 (Pseudoknotted Structures - bpRNA Segment Graph Method) A secondary structure is pseudoknotted if its segment graph contains at least one edge and is called pseudoknot-free otherwise. The number of pseudoknots in a pseudoknotted structure is the minimum cardinality over all vertex covers of minimum weight of the segment graph. Any segment contained in a minimum cardinality minimum weight vertex cover may be called simply ‘a pseudoknot.’ It is important to note that in Danaee et al. (2018), the number of pseudoknots is not the number of chords in the corresponding cover, in general. Example 1 Figure 3 shows the chord diagram representing the secondary structure of tRNA (76-MER) found in Escherichia coli with 8 segments. The PK-segments are \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,3,4,5,6,8\}$$\end{document}{2,3,4,5,6,8}. The maximum weight independent set in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{{\mathcal {S}}}$$\end{document}HS is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{3,8\}$$\end{document}{3,8}. The minimum weight vertex cover in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,4,5,6\}$$\end{document}{2,4,5,6}, indicating four pseudoknots in this structure according to the conventions of Danaee et al. (2018). Remark 3 A connection between the vertex-covering problem and pseudoknot enumeration was made in Kabak et al. (2004). Remark 4 While pseudoknotted structures represent three-dimensional folding patterns and there is a historical precedent for describing them using topological descriptors (Studnicka et al. 1978), pseudoknots as above are unrelated to pseudoknots in the current knot theory literature (Hanaki 2010). Fig. 3(Top) Linear chord diagram of transfer RNA molecule of type 76-MER from Escherichia coli (PDB_652) with segments labeled. (Bottom) Segment graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS with weights (Top) Linear chord diagram of transfer RNA molecule of type 76-MER from Escherichia coli (PDB_652) with segments labeled. (Bottom) Segment graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS with weights Crossingless Secondary Structures Let D be a chord diagram with no crossings, and let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {S}}}$$\end{document}S be the segment partition of D. We say an unpaired base is nested in a segment S if it is between the left and right endpoints of the innermost chord of S. A stem in D is a k-nesting with no other bases between the endpoints of any two consecutive chords. Segments are composed of stems. Let S be a segment and let c and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c'$$\end{document}c′ be two consecutive chords in a segment S, with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell < \ell '$$\end{document}ℓ<ℓ′. If there are sequences of unpaired bases in the intervals \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\ell ,\ell ')$$\end{document}(ℓ,ℓ′) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(r,r')$$\end{document}(r,r′), i.e. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell ' - \ell \ge 2$$\end{document}ℓ′-ℓ≥2 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r-r' \ge 2$$\end{document}r-r′≥2, then those two sequences together comprise an interior loop. If exactly one of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\ell ,\ell ')$$\end{document}(ℓ,ℓ′) or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(r,r')$$\end{document}(r,r′) contains a sequence of unpaired bases, that sequence is a bulge. If two or more segments \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {T}$$\end{document}T are nested in S, then there is a multiloop composed of all unpaired bases b nested in S and not nested in any segment in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {T}$$\end{document}T. Note multiloops may have length zero (that is, a multiloop may be the empty set). The exterior loop of D is the set of all unpaired bases which are not nested in any chord. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b_0$$\end{document}b0 is the first paired base and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b_f$$\end{document}bf is the last paired base in the base sequence, the set of unpaired bases less than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b_0$$\end{document}b0 and greater than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b_f$$\end{document}bf are a part of the exterior loop called the dangling ends. The exterior loop can be thought of as the multiloop gained from an imaginary base pair bonding of the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$5'$$\end{document}5′-end and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$3'$$\end{document}3′-end, under which all chords are nested. The crossingless secondary structures are illustrated in Figure 4.Fig. 4An illustrated example of secondary structures in a crossingless chord diagram. There are eight stems in this structure An illustrated example of secondary structures in a crossingless chord diagram. There are eight stems in this structure Qualitatively Similar Pseudoknotted Structures Identifying nested chords in a chord diagram is a common strategy for reducing the complexity of the combinatorial analysis of secondary structures because it allows for the reduction of helices to a single chord, or alternatively to a single vertex in an intersection graph. For example, nested chords are identified as segments in Danaee et al. (2018) (Definition 3 above), as ‘stacks’ in Bon et al. (2008), as ‘shadows’ in Reidys et al. (2011), or as edges in tree diagrams of pseudoknot-free structures in Benedetti and Morosetti (1996) and elsewhere. Such reductions also preserve some invariants of interest, for example the topological genus (see Definition 4 and Bon et al. (2008)). In contrast to r-nestings, r-crossings in chord diagrams are typically left untouched by simplification algorithms. Consequently, the existence of an r-crossing implies the existence of at least r pseudoknots according to the conventions of Danaee et al. (2018). Consider the following two examples. Example 2 (Discrepancies due to weights) Consider two weighted segment graphs, each isomorphic to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_3$$\end{document}P3, with weights (1, 5, 3) and (1, 5, 4), respectively. Such graphs represent nearly identical K-type secondary structures which differ only by a single bonded pair in the third stem. By Danaee et al. (2018) and Definition 5, the minimum cardinality over vertex covers of minimum weight determines the number of pseudoknots: 2 and 1, respectively. Note that the addition of one pair results in a decrease in the number of pseudoknots. Fig. 5Two closely related instances of bonding between two hairpins Two closely related instances of bonding between two hairpins Example 3 (Discrepancies due to r-crossings) Consider a nucleotide sequence that contains a repetitious subsequence appearing in reverse. For an example, we follow Figure 5. This structure contains subsequence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma =X'Y'Z'$$\end{document}σ=X′Y′Z′, complementary sequence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma '=ZYX$$\end{document}σ′=ZYX, and reverse complementary sequence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{\sigma }'=XYZ$$\end{document}σ¯′=XYZ. Bonds formed between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}σ and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma '$$\end{document}σ′ result in an r-nesting (Figure 5(A)), whereas bonds formed between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}σ and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{\sigma }'$$\end{document}σ¯′ form an r-crossing (Figure 5(B)). We assume here that either set of bonds is possible. In particular, the parity of number of half-turns in the helical stem may determine whether \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma '$$\end{document}σ′ or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{\sigma }'$$\end{document}σ¯′ is nearer to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}σ in a 3D conformation. Despite the heuristic similarity of the resulting pseudoknotted structures, their segment graphs differ significantly. By the conventions of Danaee et al. (2018) (Definition 5) the two structures are of pseudoknotting size 1 and 3, respectively. Moreover, the difference increases with additional base pairing in the hairpin stem. The general observation is that variances in bonding from spatial conformations (e.g. helical twisting) may result in a quantification of pseudoknotting that is artificially high. Of 30 structures exhibiting the most pseudoknotting in Table 1, there are 28 that contain both a complementary and reverse complementary sequence (possibly not contiguous) near the site of the 3-crossing. One example RNA structure involving a 3-crossing and 5-nesting is bpRNA_CRW_55315. This structure contains a 3-crossing with left bases GCA at indices 2107, 2108, and 2112 and right bases AGU at indices 2164, 2165, and 2167, which is the reverse of the triple UGA at indices 2162, 2163, and 2164. Methods To further reduce complexity and to more effectively relate similar secondary structures, we propose in this section an alternative method for quantifying the size of a pseudoknotted structure and a new simplification algorithm that identifies both r-crossings and r-nestings in chord diagrams. In addition to handling complexity issues arising from r-crossings, this method will also eliminate some discrepancies resulting from weighted graphs and include a parameter accounting for distance between nucleotides. The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-Segment Graph Method In this subsection, we give a partitioning procedure that identifies r-crossings in a manner similar to that of r-nestings. We implement the procedure in an algorithm that incorporates an additional distance parameter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ in terms of the nucleotide sequence. An augmented segment of a chord diagram is a maximal nonempty set of chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S = \{c_1,c_2,\dots ,c_k\}$$\end{document}S={c1,c2,⋯,ck} forming a k-nesting or a k-crossing which is not chord obstructed. Revisiting Examples 2 and 3 above, notice that an intersection graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {A}}}$$\end{document}GA produced with augmented segments would yield two pseudoknotted structures of size 1 in Example 2 and two structures of size 2 in Example 3. The chord distance between two chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_1 = (\ell _1,r_1)$$\end{document}c1=(ℓ1,r1) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_2 = (\ell _2,r_2)$$\end{document}c2=(ℓ2,r2) is\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} d(c_1,c_2) = \max \{|\ell _1 - \ell _2|, |r_1 - r_2|\}. \end{aligned}$$\end{document}d(c1,c2)=max{|ℓ1-ℓ2|,|r1-r2|}.We say that a pair of nested or crossed chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_1, c_2$$\end{document}c1,c2 are \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d(c_1,c_2) \le \tau $$\end{document}d(c1,c2)≤τ and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_1$$\end{document}c1 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_2$$\end{document}c2 are not chord obstructed. A k-crossing or k-nesting \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{c_1,\dots ,c_k\}$$\end{document}{c1,⋯,ck} is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near if for each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i=1,\dots ,k-1$$\end{document}i=1,⋯,k-1 we have \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_i$$\end{document}ci and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_{i+1}$$\end{document}ci+1 are \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near. A \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment of a chord diagram is a maximal nonempty set of chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S = \{c_1,c_2,\dots ,c_k\}$$\end{document}S={c1,c2,⋯,ck} forming a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near k-nesting or a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near k-crossing.2 As with segments or augmented segments, the set of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segments \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {S}}}_\tau $$\end{document}Sτ also partitions the set of chords C. We have the following statement. Theorem 4 Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {S}}}_\tau $$\end{document}Sτ be the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partition of a linear chord diagram D and let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_1,S_2 \in {{\mathcal {S}}}_\tau $$\end{document}S1,S2∈Sτ. If there are chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c \in S_1$$\end{document}c∈S1 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c' \in S_2$$\end{document}c′∈S2 such that c and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c'$$\end{document}c′ are crossed, then for every pair \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c \in S_1$$\end{document}c∈S1 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c' \in S_2$$\end{document}c′∈S2, the chords c and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c'$$\end{document}c′ are crossed. Proof The proof is analogous to that of Theorem 3. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square $$\end{document}□ Generalizing the segment graph, we may now define the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment intersection graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_\tau $$\end{document}Gτ to be the weighted graph whose vertex set is the set of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segments, where two vertices are adjacent if the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segments cross. When \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0, define \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\tau =0}:=G_{{\mathcal {S}}}$$\end{document}Gτ=0:=GS. When \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞, the graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {A}}}:=G_{\infty }$$\end{document}GA:=G∞ is the intersection graph of the augmented segment partition. The notation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_\tau $$\end{document}Dτ will indicate the chord diagram corresponding to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_\tau $$\end{document}Gτ, in which each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment corresponds to a chord. As with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {A}}}$$\end{document}GA we use the notation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {S}}}$$\end{document}DS and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {A}}}$$\end{document}DA analogously. We may now formally revise the method for quantifying the size of pseudoknotted structures in RNA. Definition 6 (Pseudoknotted Structures - \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-Segment Graph Method) A secondary structure is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-pseudoknotted if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_\tau $$\end{document}Gτ contains at least one edge and is called pseudoknot-free otherwise. For \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau \ge 1$$\end{document}τ≥1, the number of pseudoknots is the minimum cardinality of a vertex cover of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_\tau $$\end{document}Gτ. For \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0, the number of pseudoknots is the minimum cardinality over all vertex covers of minimum weight of the segment graph. The definition in the case of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 is explicitly made to agree with the conventions of Danaee et al. (2018).Fig. 6Different tau-partitions of bpRNA_PDB_652 for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0, 1$$\end{document}τ=0,1, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\infty $$\end{document}∞ Different tau-partitions of bpRNA_PDB_652 for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0, 1$$\end{document}τ=0,1, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\infty $$\end{document}∞ Example 4 Figure 6. The maximum distance between any two non-chord obstructed chords is three. That is, the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partition is the same for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau \ge 3$$\end{document}τ≥3. This RNA structure has four pseudoknots according to the conventions of Danaee et al. (2018), and two pseudoknots according to Definition 6. The main difference comes from chords (19, 56) and (20, 57) becoming part of the same segment for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ large enough. Algorithm 1 in the next section implements the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partition procedure. Algorithm 1Tau-Segment Partition The input to the algorithm is a chord diagram with set of chords C (a list of base pairs indexed by left endpoint) and a non-negative integer parameter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ. Selecting a pair of chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c,c'\in C$$\end{document}c,c′∈C, the algorithm loops to build the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment containing c. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0, it checks whether the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c,c'$$\end{document}c,c′ are nested and not chord obstructed. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau >0$$\end{document}τ>0, the algorithm checks whether c and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c'$$\end{document}c′ are \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near and not chord obstructed. If the criterion is met, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c'$$\end{document}c′ is added to the segment containing c and the next pair is selected. If not, the segment is closed. The next unvisited pair of chords are then selected and the process repeats to build the next segment until all chords have been exhausted. Tau-Segment Partition The Supplementary Information section contains Algorithm 1 implemented in Matlab in the function called findSegments. Pseudoknot Quantification Process Here, we apply the definitions and algorithm above to the bpRNA-1m(90) database (Danaee et al. 2018). The database bpRNA-1m(90) is a subset of bpRNA-1m restricted to the 28,370 RNA secondary structures with less than 90% sequence similarity. This database contains 3,320 RNA structures reported to contain at least one pseudoknot, i.e. structures whose segment graphs contain at least one edge, with a total of 7,164 pseudoknots reported according to Definition 5 (the prior bpRNA Segment Graph Method). To analyze the data, we implement both the segment and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment graph methods and analyze secondary structures via the Matlab code provided in the Supplementary Information. Chord diagrams associated with RNA structures are stored as Matlab arrays. The input to the Tau-Segment Partition algorithm is the set of chords C from a chord diagram D and an integer parameter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ. To carry out any of the above methods, we first call the findSegments function to create a segment partition of the chord diagram. The parameter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ determines which segment partition is created, with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0,\infty , 1<\tau <\infty $$\end{document}τ=0,∞,1<τ<∞ corresponding to the segment partition, augmented segment partition, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-partition, respectively. See Figure 6. Depending on whether the segment partition contains any segments which cross each other, one of two subroutines is implemented. If the segment partition contains no segments which cross, then the secondary structures of the chord diagram are analyzed by the function classifyBases. This function outputs the primary base sequence with each base classified as belonging to one of the secondary structure motifs given in Section 2.3. If the segment partition contains segments which cross, then we construct the corresponding weighted segment graph with the function makeSegmentGraph. The pseudoknots of the chord diagram are then identified and analyzed by the findPKs process: Find list of all maximal independent sets I.If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = 0$$\end{document}τ=0: Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}$$\end{document}I∈I.Subset all maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I.Subset maximum cardinality maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I.If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau > 0$$\end{document}τ>0: Subset all maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I.Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}'$$\end{document}I∈I′.Subset maximum weight maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I.Dualize the independent sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''$$\end{document}I′′ to vertex covers \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}$$\end{document}P.Select first vertex cover \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P\in \mathcal {P}$$\end{document}P∈P with respect to the lexicographical ordering from the indexing of segments by left endpoints.Step (1) applies the Bron-Kerbosch algorithm (Bron and Kerbosch 1973; Birand 2014) to find all maximal cardinality independent sets. The importance of the lexicographical ordering in step (5) will become apparent after Example 5 below. Find list of all maximal independent sets I. Find list of all maximal independent sets I. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = 0$$\end{document}τ=0: Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}$$\end{document}I∈I.Subset all maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I.Subset maximum cardinality maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = 0$$\end{document}τ=0: Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}$$\end{document}I∈I.Subset all maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I.Subset maximum cardinality maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}$$\end{document}I∈I. Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}$$\end{document}I∈I. Subset all maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I. Subset all maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I. Subset maximum cardinality maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. Subset maximum cardinality maximum weight sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau > 0$$\end{document}τ>0: Subset all maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I.Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}'$$\end{document}I∈I′.Subset maximum weight maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau > 0$$\end{document}τ>0: Subset all maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I.Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}'$$\end{document}I∈I′.Subset maximum weight maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. Subset all maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I. Subset all maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}'\subseteq \mathcal {I}$$\end{document}I′⊆I. Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}'$$\end{document}I∈I′. Calculate weight of each set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I \in \mathcal {I}'$$\end{document}I∈I′. Subset maximum weight maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. Subset maximum weight maximum cardinality sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''\subseteq \mathcal {I}' \subseteq \mathcal {I}$$\end{document}I′′⊆I′⊆I. Dualize the independent sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''$$\end{document}I′′ to vertex covers \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}$$\end{document}P. Dualize the independent sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {I}''$$\end{document}I′′ to vertex covers \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}$$\end{document}P. Select first vertex cover \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P\in \mathcal {P}$$\end{document}P∈P with respect to the lexicographical ordering from the indexing of segments by left endpoints. Select first vertex cover \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P\in \mathcal {P}$$\end{document}P∈P with respect to the lexicographical ordering from the indexing of segments by left endpoints. The output of this process is a vertex cover P. In the case that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0, this vertex cover represents a pseudoknotted structure by Definition 5, where the number of pseudoknots is quantified by the minimum cardinalities of vertex covers of minimum weight. In the cases where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau > 0$$\end{document}τ>0, the minimum weight minimum cardinality vertex cover represents a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-pseudoknotted structure by Definition 6. After identifying pseudoknots, one may still want to analyze the crossingless secondary structures of the RNA molecule. Therefore the last part of the process removes all chords which compose a pseudoknot, leaving a set of chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C'=C-P$$\end{document}C′=C-P. In the case of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = 0$$\end{document}τ=0, the set of chords \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C'$$\end{document}C′ is crossingless. In the case \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau > 0$$\end{document}τ>0, it may be that chords in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C'$$\end{document}C′ still cross because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C'$$\end{document}C′ may contain independent crossings and nestings, however no two segments cross in the augmented segment partition of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C'$$\end{document}C′. Setting \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ (which corresponds to an augmented segment partition), we enter the secondary structure classification subroutine (classifyBases) assessing secondary structure using the definitions given in Section 2.3, with independent crossings handled as nestings (and thus a type of stem). This entire process is summarized in a flow chart provided in the Supplementary Information section. Example 5 (Lexicographical Ordering Matters) Here we apply the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0-reduction method to the RNA structure 3DIG from the Protein Data Bank (Serganov et al. 2008; Serganov 2008) (see Figure 7). There are two choices for a minimum cardinality minimum weight vertex cover, here of cardinality three. Namely, both covers contain the two segments highlighted in red, and differ by whether the cover contains segment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(40,52)\}$$\end{document}{(40,52)} or segment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(41,54)\}$$\end{document}{(41,54)}. Removing either cover yields a chord diagram with no crossings, and finding the secondary structures, we may obtain two different pseudoknot types depending on the cover removed. If we remove the cover containing segment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(40,52)\}$$\end{document}{(40,52)}, then the pseudoknot corresponding to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(40,52)\}$$\end{document}{(40,52)} connects a bulge to a bulge. However if instead we remove the cover containing segment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(41,54)\}$$\end{document}{(41,54)} then the pseudoknot corresponding to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(41,54)\}$$\end{document}{(41,54)} connects an interior loop to another interior loop. As a result, the two choices for a vertex cover have a different effect on the secondary structure classification and consequently pseudoknot typing.Fig. 7RNA structure with bpRNA reference name PDB_455 and PDB reference name 3DIG. Structures such as nestings not relevant for the discussion have been omitted for clarity RNA structure with bpRNA reference name PDB_455 and PDB reference name 3DIG. Structures such as nestings not relevant for the discussion have been omitted for clarity Discussion We applied the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-Segment Graph Method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 to independently verify the quantities reported in bpRNA-1m(90) (Danaee et al. 2018). By Definition 5, structures are pseudoknotted when their segment graphs contain at least one edge, and the number of pseudoknots is quantified by the minimum cardinalities of vertex covers of minimum weight. In agreement with Danaee et al. (2018), we obtained 3,320 graphs containing at least one edge in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS from RNA structures and a total quantity of 7,164 pseudoknots, as determined by the sum over the cardinalities of the vertex covers. Applying the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-Segment Graph Method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ (the augmented segment graph method) for every structure in bpRNA-1m(90), we found a minimum vertex cover for each structure. The number of pseudoknots (the sum of vertex cover numbers over all graphs) was 6,548 with this method. With \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0, we found 31 unique RNA structures containing 13 or more pseudoknots. These structures are listed in Table 1. When the method was applied with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞, we found that the same 31 structures contained the most pseudoknots amongst all structures in the database. With the exception of the last structure, Oceanobacillus iheyensis, from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ there was a uniform decrease in pseudoknotting by two that resulted from a single 3-crossing being consolidated into one segment by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-reduction. This uniformity in behavior is explained by the fact that all but the last structure are of type 23S prokaryotic ribosomal RNA, originating in various bacterial organisms (Elliott and Ladomery 2023). Over the entire bpRNA-1m(90) database, a total of 573 structures had a decrease in numbers of pseudoknots when analyzed with the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ versus \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 methods. Of these, 531 structures decreased in quantity of pseudoknots by 1, 41 structures by 2, and 1 structure decreased by 3 (bpRNA_CRW_55316, Plasmodium falciparum). Of the 41 structures which decreased by 2, there were 6 unique RNA types with 36 of them being of type 23S. Structures that changed from having a nonzero quantity of pseudoknots to zero pseudoknots are shown in Table 2. Of these, one structure (Homo sapiens) decreased from 2 to 0 pseudoknots. All other structures decreased from 1 to 0 pseudoknots. Maximum Values of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ and Persistence of Partitions Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau \ge 1$$\end{document}τ≥1. As distances between chords are finite, there is a minimum value of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ, say \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _{m}$$\end{document}τm, such that for any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _{*} \ge \tau _m$$\end{document}τ∗≥τm the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _{*}$$\end{document}τ∗-segment partition and the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm-segment partition are identical. The quantity \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm is precisely the minimum value of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ such that the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partition is equivalent to the augmented segment partition. For all structures in bpRNA-1m(90), we calculate \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm by first finding the augmented segment partition, and then finding the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partition for each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau > 0$$\end{document}τ>0 until the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partition is equal to the augmented segment partition. We find that the average \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm is 13.035 and the median is 8. The mean absolute deviation is 10.96 and the median absolute deviation is 2. There are 323 structures with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm at least 17, and 33 structures with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm at least 100. Structures with large \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm contain correspondingly large bulges and internal loops; large \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm results from large gaps between chords which are nested but not \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-near for many values of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ. See for example Figure 10. We verified this by keeping track of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partitions during the process of calculating \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm. In sum, persistent \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partitions are indicative of large bulges and internal loops. Classifying Bases We implemented the classifyBases routine with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 to analyze secondary structures and compare quantities obtained from the bpRNA-1m database (see also (Danaee et al. 2018, Figure 8b)). Quantities are shown in Table 11 (left). We observed slight discrepancies in pseudoknot type counts, though the general shape of the distribution is the same. The discrepancies with the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 method arise from the labeling of multiloops and external loops, as some structures in Danaee et al. (2018) have bases in the external loop that are labeled as a multiloop base. This is a bpRNA software bug that has since been fixed in a fork of Danaee (2018). The structure bpRNA_CRW_10025 is one example in which the secondary structure labeling is incorrect; bases 357, 385-393, 433-440, 604-633, 690-695, and 728-742 are labeled as part of a multiloop in bpRNA-1m, but by our definition they are part of the exterior loop. Note that the counts of pseudoknot types in Figure 11 (left) differ only when an exterior loop or multiloop is part of the pseudoknot type. Figure 11 (right) shows a comparison of pseudoknot type counts between the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 method and the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ method. Calculation of Genus and Clique Numbers After implementing the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment graph method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ we calculated the genus and maximum clique numbers of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {S}}}$$\end{document}DS and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {A}}}$$\end{document}DA and the segment graphs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {S}}}$$\end{document}GS and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{\mathcal {A}}}$$\end{document}GA respectively in Matlab. The results are reported in Figure 12, Table 3, and Figure 13. Out of 3,320 segment graphs, 3,208 are forests, and out of 3,320 augmented segment graphs, 3,210 are forests. Table 4 shows the frequency of forests with a given maximum tree size. This is important to note in the context of using genus and vertex covers for pseudoknot quantification. By Theorem 2, if the intersection graph of a chord diagram D is a forest F, then the genus \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma (D)$$\end{document}γ(D) is equal to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta (F)$$\end{document}β(F). That is, for acyclic intersection graphs, an increase in genus implies an increase in the vertex cover. From this, we see that the genus of a corresponding chord diagram of an RNA structure is a robust quantifier of pseudoknot complexity. This is further supported by the bubble charts in Figure 13. Remark 5 Lastly, we remark that relative to k-nestings, pseudoknots resulting from k-crossings are comparatively rare (Danaee et al. 2018; Reidys et al. 2011). Although the present work is focused on the enumeration of pseudoknots resulting from all such structures, the definitions and algorithms presented in Section 3.1 remain valid in the absence of k-crossings. One may simply remove chords contained in k-crossings from a chord diagram and proceed with the current algorithm to analyze pseudoknots resulting from nestings alone. However, one may reasonably have the goal of treating crossings and nestings asymmetrically. In principle, one could modify the definition of the augmented \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-partition in Section 3.1 to incorporate two distance parameters \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _n$$\end{document}τn and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _c$$\end{document}τc, with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _n$$\end{document}τn defining a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _n$$\end{document}τn-near k-nesting, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _c$$\end{document}τc defining a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _c$$\end{document}τc-near k-crossing. By setting \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _c=\infty $$\end{document}τc=∞, one could force the consolidation of any k-crossing to a single element in the partition, while retaining flexibility with the nesting distance parameter. Such a revision would require nontrivial modifications to the Matlab code. Appendix Figures 8–13 and Tables 1-4.Fig. 8A comparison of total number of pseudoknots between the segment graph method (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0) and augmented segment graph method (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞.) For each method, the number of structures containing r pseudoknots is givenTable 1The 31 RNA structures with at least 13 pseudoknots when analyzed with the segment graph method. The rightmost column compares the number of pseudoknots in each structure via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment graph method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = \infty $$\end{document}τ=∞. All structures with the exception of PDB_647 are RNA type 23S ribosomal RNA.IDDomainOrganism\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {A}}$$\end{document}GAIDDomainOrganism\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {A}}$$\end{document}GACRW_55315EukaryotaEuglena gracilis1513\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vdots $$\end{document}⋮CRW_55268BacteriaAcinetobacter calcoaceticus1412CRW_55269BacteriaAeromonas hydrophila1412CRW_55297BacteriaListeria monocytogenes1412CRW_55271BacteriaBartonella bacilliformis1412CRW_55298BacteriaListeria monocytogenes1412CRW_55275BacteriaBurkholderia mallei1412CRW_55299BacteriaMycoplasma genitalium1412CRW_55276BacteriaBordetella pertussis1412CRW_55303BacteriaNeisseria gonorrhoeae1412CRW_55279BacteriaClostridium botulinum B1412CRW_55305BacteriaPseudomonas aeruginosa1412CRW_55283BacteriaCitrobacter freundii1412CRW_55306BacteriaPlesiomonas shigelloides1412CRW_55284BacteriaCampylobacter jejuni1412CRW_55307BacteriaRuminobacter amylophilus1412CRW_55285BacteriaChlamydophila psittaci 6BC1412CRW_55308BacteriaRickettsia prowazekii (str. Madrid E)1412CRW_55287BacteriaDeinococcus radiodurans1412CRW_55312BacteriaStaphylococcus carnosus1412CRW_55290BacteriaEnterococcus faecalis1412CRW_55313BacteriaThermotoga maritima1412CRW_55291BacteriaErysipelothrix rhusiopathiae (str. 715)1412CRW_55314EukaryotaChlamydomonas reinhardtii1412CRW_55292BacteriaHaemophilus influenzae (operons A-F)1412CRW_55317EukaryotaSpinacia oleracea1412CRW_55295BacteriaLeptospira interrogans1412CRW_55338EukaryotaCyanophora paradoxa1412CRW_55296BacteriaLactococcus lactis1412CRW_55270BacteriaBacillus anthracis1311PDB_647BacteriaOceanobacillus iheyensis1311Table 2The 40 RNA structures with nonzero quantity of pseudoknots when analyzed with the segment graph method but zero pseudoknots using \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ segment graph method. One structure (Homo sapiens) decreased from 2 to 0 pseudoknots. All other structures decreased from 1 to 0 pseudoknots.IDDomainOrganismLengthMethodIDDomainOrganismLengthMethodCRW_1213BacteriaActinomyces israelii734CSA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vdots $$\end{document}⋮CRW_1219BacteriaActinomyces israelii1145CSACRW_1563BacteriaClavibacter sp. R1_2_cr476CSACRW_4401BacteriaStreptomyces mobaraensis1197CSACRW_1725BacteriaArthrobacter sp.300CSACRW_4409BacteriaStreptomyces olivoreticuli1216CSACRW_17723BacteriaLachnospira multipara977CSACRW_4416BacteriaStreptomyces salmonis1136CSACRW_17729BacteriaMoorella thermoautotrophica869CSACRW_4449Bacteriacoryneform actinomycete B755679CSACRW_17730BacteriaMoorella thermoautotrophica821CSACRW_4908BacteriaAcidocella facilis922CSACRW_17811BacteriaThermoanaerobacter acetoethylicus770CSACRW_4910BacteriaAcidiphilium angustum977CSACRW_17823BacteriaThermoanaerobacter ethanolicus650CSACRW_4918BacteriaAcidiphilium sp.944CSACRW_17834BacteriaThermoanaerobacterium thermosulfurigenes930CSACRW_7455Bacteriaunidentified eubacterium 37SW-1277CSACRW_20267BacteriaMarigold phyllody phytoplasma1015CSACRW_7488BacteriaProteobacteria sp484CSACRW_20554BacteriaMycoplasma collis372CSACRW_7494Bacteriauncultured alpha proteobacterium410CSACRW_20606BacteriaBeet leafhopper transmitted virescence phytoplasma700CSACRW_7502Bacteriauncultured alpha proteobacterium222CSACRW_20626BacteriaPotato witches’-broom phytoplasma658CSACRW_7614BacteriaNitrobacter sp.452CSACRW_20629BacteriaPaulownia witches’-broom phytoplasma698CSACRW_7802BacteriaRhodovulum euryhalinum1138CSACRW_3719BacteriaActinomycetales sp.472CSACRW_7938BacteriaSphingomonas asaccharolytica629CSACRW_3726BacteriaActinomycetales sp.503CSACRW_8046Bacteriauncultured alpha proteobacterium751CSACRW_3729BacteriaActinomycetales sp.502CSACRW_8048Bacteriauncultured alpha proteobacterium730CSACRW_3732BacteriaActinomycetales sp.478CSACRW_8050Bacteriauncultured alpha proteobacterium690CSACRW_4109BacteriaMycobacterium xenopi942CSAPDB_567artificial sequencessynthetic construct35X-RAYCRW_4363BacteriaStreptomyces abikoensis1177CSAPDB_512EukaryotaHomo sapiens12X-RAY A comparison of total number of pseudoknots between the segment graph method (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0) and augmented segment graph method (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞.) For each method, the number of structures containing r pseudoknots is given Table 1The 31 RNA structures with at least 13 pseudoknots when analyzed with the segment graph method. The rightmost column compares the number of pseudoknots in each structure via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment graph method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = \infty $$\end{document}τ=∞. All structures with the exception of PDB_647 are RNA type 23S ribosomal RNA.IDDomainOrganism\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {A}}$$\end{document}GAIDDomainOrganism\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {A}}$$\end{document}GACRW_55315EukaryotaEuglena gracilis1513\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vdots $$\end{document}⋮CRW_55268BacteriaAcinetobacter calcoaceticus1412CRW_55269BacteriaAeromonas hydrophila1412CRW_55297BacteriaListeria monocytogenes1412CRW_55271BacteriaBartonella bacilliformis1412CRW_55298BacteriaListeria monocytogenes1412CRW_55275BacteriaBurkholderia mallei1412CRW_55299BacteriaMycoplasma genitalium1412CRW_55276BacteriaBordetella pertussis1412CRW_55303BacteriaNeisseria gonorrhoeae1412CRW_55279BacteriaClostridium botulinum B1412CRW_55305BacteriaPseudomonas aeruginosa1412CRW_55283BacteriaCitrobacter freundii1412CRW_55306BacteriaPlesiomonas shigelloides1412CRW_55284BacteriaCampylobacter jejuni1412CRW_55307BacteriaRuminobacter amylophilus1412CRW_55285BacteriaChlamydophila psittaci 6BC1412CRW_55308BacteriaRickettsia prowazekii (str. Madrid E)1412CRW_55287BacteriaDeinococcus radiodurans1412CRW_55312BacteriaStaphylococcus carnosus1412CRW_55290BacteriaEnterococcus faecalis1412CRW_55313BacteriaThermotoga maritima1412CRW_55291BacteriaErysipelothrix rhusiopathiae (str. 715)1412CRW_55314EukaryotaChlamydomonas reinhardtii1412CRW_55292BacteriaHaemophilus influenzae (operons A-F)1412CRW_55317EukaryotaSpinacia oleracea1412CRW_55295BacteriaLeptospira interrogans1412CRW_55338EukaryotaCyanophora paradoxa1412CRW_55296BacteriaLactococcus lactis1412CRW_55270BacteriaBacillus anthracis1311PDB_647BacteriaOceanobacillus iheyensis1311 The 31 RNA structures with at least 13 pseudoknots when analyzed with the segment graph method. The rightmost column compares the number of pseudoknots in each structure via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment graph method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = \infty $$\end{document}τ=∞. All structures with the exception of PDB_647 are RNA type 23S ribosomal RNA. Table 2The 40 RNA structures with nonzero quantity of pseudoknots when analyzed with the segment graph method but zero pseudoknots using \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ segment graph method. One structure (Homo sapiens) decreased from 2 to 0 pseudoknots. All other structures decreased from 1 to 0 pseudoknots.IDDomainOrganismLengthMethodIDDomainOrganismLengthMethodCRW_1213BacteriaActinomyces israelii734CSA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vdots $$\end{document}⋮CRW_1219BacteriaActinomyces israelii1145CSACRW_1563BacteriaClavibacter sp. R1_2_cr476CSACRW_4401BacteriaStreptomyces mobaraensis1197CSACRW_1725BacteriaArthrobacter sp.300CSACRW_4409BacteriaStreptomyces olivoreticuli1216CSACRW_17723BacteriaLachnospira multipara977CSACRW_4416BacteriaStreptomyces salmonis1136CSACRW_17729BacteriaMoorella thermoautotrophica869CSACRW_4449Bacteriacoryneform actinomycete B755679CSACRW_17730BacteriaMoorella thermoautotrophica821CSACRW_4908BacteriaAcidocella facilis922CSACRW_17811BacteriaThermoanaerobacter acetoethylicus770CSACRW_4910BacteriaAcidiphilium angustum977CSACRW_17823BacteriaThermoanaerobacter ethanolicus650CSACRW_4918BacteriaAcidiphilium sp.944CSACRW_17834BacteriaThermoanaerobacterium thermosulfurigenes930CSACRW_7455Bacteriaunidentified eubacterium 37SW-1277CSACRW_20267BacteriaMarigold phyllody phytoplasma1015CSACRW_7488BacteriaProteobacteria sp484CSACRW_20554BacteriaMycoplasma collis372CSACRW_7494Bacteriauncultured alpha proteobacterium410CSACRW_20606BacteriaBeet leafhopper transmitted virescence phytoplasma700CSACRW_7502Bacteriauncultured alpha proteobacterium222CSACRW_20626BacteriaPotato witches’-broom phytoplasma658CSACRW_7614BacteriaNitrobacter sp.452CSACRW_20629BacteriaPaulownia witches’-broom phytoplasma698CSACRW_7802BacteriaRhodovulum euryhalinum1138CSACRW_3719BacteriaActinomycetales sp.472CSACRW_7938BacteriaSphingomonas asaccharolytica629CSACRW_3726BacteriaActinomycetales sp.503CSACRW_8046Bacteriauncultured alpha proteobacterium751CSACRW_3729BacteriaActinomycetales sp.502CSACRW_8048Bacteriauncultured alpha proteobacterium730CSACRW_3732BacteriaActinomycetales sp.478CSACRW_8050Bacteriauncultured alpha proteobacterium690CSACRW_4109BacteriaMycobacterium xenopi942CSAPDB_567artificial sequencessynthetic construct35X-RAYCRW_4363BacteriaStreptomyces abikoensis1177CSAPDB_512EukaryotaHomo sapiens12X-RAY The 40 RNA structures with nonzero quantity of pseudoknots when analyzed with the segment graph method but zero pseudoknots using \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ segment graph method. One structure (Homo sapiens) decreased from 2 to 0 pseudoknots. All other structures decreased from 1 to 0 pseudoknots. Fig. 9Left: Distribution of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm over all RNA structures in bpRNA-1m(90) restricted to values of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm within one and a half standard deviations from the mean. Right: Distribution of number of unique \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partitions Fig. 10The RNA structure bpRNA_RFAM_4761 is an example of a structure with large \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m=117$$\end{document}τm=117 resulting from an interior loop Fig. 11(Left) A comparison of counts of pseudoknot types reported in bpRNA-1m versus our \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0. Discrepancies result from a known bug in the bpRNA software. (Right) A comparison of counts of pseudoknot types using our \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {A}}$$\end{document}GA methods with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞, respectively Fig. 12A comparison of the genus of the segment graph and the augmented segment graph Table 3The frequency of clique numbers for segment and augmented segment graphs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega (G)$$\end{document}ω(G) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {S}}}}$$\end{document}GS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {A}}}}$$\end{document}GA 1040232143177360964467 Table 4For each segment and augmented segment graph that is a forest, we calculate the maximum order of a tree component.Max Tree Order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {S}}}}$$\end{document}GS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {A}}}}$$\end{document}GA Max Tree Order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {S}}}}$$\end{document}GS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {A}}}}$$\end{document}GA 1040766214491410877399899997746376371011527271133671711222 Left: Distribution of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm over all RNA structures in bpRNA-1m(90) restricted to values of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m$$\end{document}τm within one and a half standard deviations from the mean. Right: Distribution of number of unique \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}τ-segment partitions The RNA structure bpRNA_RFAM_4761 is an example of a structure with large \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _m=117$$\end{document}τm=117 resulting from an interior loop (Left) A comparison of counts of pseudoknot types reported in bpRNA-1m versus our \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS method with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0. Discrepancies result from a known bug in the bpRNA software. (Right) A comparison of counts of pseudoknot types using our \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {S}}$$\end{document}GS and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\mathcal {A}}$$\end{document}GA methods with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞, respectively A comparison of the genus of the segment graph and the augmented segment graph Table 3The frequency of clique numbers for segment and augmented segment graphs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega (G)$$\end{document}ω(G) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {S}}}}$$\end{document}GS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {A}}}}$$\end{document}GA 1040232143177360964467 The frequency of clique numbers for segment and augmented segment graphs Table 4For each segment and augmented segment graph that is a forest, we calculate the maximum order of a tree component.Max Tree Order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {S}}}}$$\end{document}GS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {A}}}}$$\end{document}GA Max Tree Order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {S}}}}$$\end{document}GS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{{{\mathcal {A}}}}$$\end{document}GA 1040766214491410877399899997746376371011527271133671711222 For each segment and augmented segment graph that is a forest, we calculate the maximum order of a tree component. Fig. 13Two bubble chart comparisons. Left: Comparison between genera of the chord diagrams \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {S}}}$$\end{document}DS and pseudoknot count via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 method. Right: Comparison between genera of the chord diagrams \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {A}}}$$\end{document}DA and pseudoknot count via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ method Two bubble chart comparisons. Left: Comparison between genera of the chord diagrams \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {S}}}$$\end{document}DS and pseudoknot count via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =0$$\end{document}τ=0 method. Right: Comparison between genera of the chord diagrams \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_{{\mathcal {A}}}$$\end{document}DA and pseudoknot count via the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau =\infty $$\end{document}τ=∞ method