Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
From MaRDI portal
Publication:2471049
Recommendations
Cites work
- A course in combinatorics.
- Applied combinatorics.
- Approximate string-matching with q-grams and maximal matches
- Combinatorial algorithms for DNA sequence assembly
- Complexity of DNA sequencing by hybridization.
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- DNA sequencing and string learning
- Euler circuits and DNA sequencing by hybridization
- scientific article; zbMATH DE number 1953078 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- On some properties of DNA graphs
Cited in
(5)- Identification of repeats in DNA sequences using nucleotide distribution uniformity
- Using a VOM model for reconstructing potential coding regions in EST sequences
- Model of perfect tandem repeat with random pattern and empirical homogeneity testing poly-criteria for latent periodicity revelation in biological sequences
- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction
- A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
This page was built for publication: Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471049)