2004
DOI: 10.1016/j.disc.2004.04.001
|View full text |Cite
|
Sign up to set email alerts
|

Enumerative aspects of secondary structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 27 publications
(22 citation statements)
references
References 9 publications
0
22
0
Order By: Relevance
“…Although we have demonstrated them on rather short recurrences, there is nothing that restricts the length of a recurrence (at least in principle). (For example, the interlacing method has been successfully applied to a certain sequence given by a recurrence of length 10 [23].) Also, there is no reason to require the coefficient functions to be rational.…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…Although we have demonstrated them on rather short recurrences, there is nothing that restricts the length of a recurrence (at least in principle). (For example, the interlacing method has been successfully applied to a certain sequence given by a recurrence of length 10 [23].) Also, there is no reason to require the coefficient functions to be rational.…”
Section: Discussionmentioning
confidence: 99%
“…However, neither of those proofs was suitable for proving the log-convexity of closely related sequences enumerating secondary structures of single-stranded nucleic acids (see, e.g., [23]). This prompted a search for other methods, and resulted in developing three similar methods, which we describe here as the calculus method, the finite difference method and the interlacing method.…”
Section: Calculus Method-motzkin Numbersmentioning
confidence: 99%
See 3 more Smart Citations