Title
k-foldability of words.
Abstract
We extend results regarding a combinatorial model introduced by Black et al.(2017) which generalizes the folding of the RNA molecule in biology. Consider a word on alphabet {A1,A¯1,…,Am,A¯m} in which A¯i is called the complement of Ai. A word w is foldable if can be wrapped around a rooted plane tree T, starting at the root and working counterclockwise such that one letter labels each half edge and the two letters labeling the same edge are complements. The tree T is called w-valid.
Year
DOI
Venue
2019
10.1016/j.dam.2018.12.028
Discrete Applied Mathematics
Keywords
DocType
Volume
Catalan numbers,Plane trees,Non-crossing perfect matchings
Journal
259
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
0
9
Name
Order
Citations
PageRank
Beth Bjorkman111.03
Garner Cochran200.34
Wei Gao300.68
Lauren Keough401.01
Rachel Kirsch511.07
Mitch Phillipson600.34
Danny Rorabaugh711.18
Heather Smith813.16
Jennifer Wise931.23