Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats

DOI10.1007/s10878-007-9050-zzbMath1128.92011OpenAlexW2070786032MaRDI QIDQ2471049

Hsun-Wen Chang, Pei-Fang (Jennifer) Tsai

Publication date: 18 February 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9050-z

zbMATH Keywords

Catalan numberDNA sequencingCombinatorial enumerationDNA digraphPattern graphReduced digraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Enumerative combinatorics (05A99)

Uses Software

• RepeatAssembler

Cites Work

• Approximate string-matching with \(q\)-grams and maximal matches
• Complexity of DNA sequencing by hybridization.
• Euler circuits and DNA sequencing by hybridization
• Combinatorial algorithms for DNA sequence assembly
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• On some properties of DNA graphs
• DNA sequencing and string learning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats