Paper Info
Title
Hairpin structures in DNA words
Abstract
We formalize the notion of a DNA hairpin secondary structure, examining its mathematical properties. Two related secondary structures are also investigated, taking into the account imperfect bonds (bulges, mismatches) and multiple hairpins. We characterize maximal sets of hairpin-forming DNA sequences, as well as hairpin-free ones. We study their algebraic properties and their computational complexity. Related polynomial-time algorithms deciding hairpin-freedom of regular sets are presented. Finally, effective methods for design of long hairpin-free DNA words are given.
Year
DOI
Venue
2005
10.1007/11753681_12
DNA
Keywords
Field
DocType
account imperfect bond,hairpin structure,mathematical property,algebraic property,long hairpin-free dna word,related secondary structure,effective method,hairpin-forming dna sequence,related polynomial-time,computational complexity,dna hairpin secondary structure,dna sequence,secondary structure
Algorithm,DNA,Pushdown automaton,DNA sequencing,Regular language,Algebraic properties,Protein secondary structure,A-DNA,Mathematics,Computational complexity theory
Conference
Volume
ISSN
ISBN
3892
0302-9743
3-540-34161-7
Citations 
PageRank 
References 
17
1.07
11
Authors
5
Name
Order
Citations
PageRank
Lila Kari11123124.45
Stavros Konstantinidis228331.10
Elena Losseva3443.48
Petr Sosík447968.66
Gabriel Thierrin526334.89