Pages that link to "Item:Q1026117"
From MaRDI portal
The following pages link to On some algorithmic problems regarding the hairpin completion (Q1026117):
Displaying 16 items.
- Language theoretical properties of hairpin formations (Q418760) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- Further remarks on DNA overlap assembly (Q515580) (← links)
- On iterated hairpin completion (Q551189) (← links)
- Bounded hairpin completion (Q553314) (← links)
- A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Iterated Hairpin Completions of Non-crossing Words (Q2891380) (← links)
- Hairpin Lengthening and Shortening of Regular Languages (Q3166949) (← links)
- IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR (Q3224950) (← links)
- Bounded Hairpin Completion (Q3618601) (← links)
- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (Q4910458) (← links)
- Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words (Q5740531) (← links)
- State Complexity of Overlap Assembly (Q5859665) (← links)
- Hairpin completions and reductions: semilinearity properties (Q6095486) (← links)
