Bounded Hairpin Completion (Q3618601)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Bounded Hairpin Completion	scientific article

Statements

scholarly article

0 references

Bounded Hairpin Completion (English)

0 references

0 references

0 references

0 references

Language and Automata Theory and Applications

0 references

publication date

2 April 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-00982-2_37

0 references

0 references

Superposition based on Watson-Crick-like complementarity

0 references

0 references

0 references

Deleting string rewriting systems preserve regularity

0 references

Contextual insertions/deletions and computability

0 references

Developments in Language Theory

0 references

On some algorithmic problems regarding the hairpin completion

0 references

Hairpin Completion Versus Hairpin Reduction

0 references

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

0 references

SOME REMARKS ON THE HAIRPIN COMPLETION

0 references

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-00982-2_37

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3618601

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3618601&oldid=35101519"