1-Tuple DNA sequencing: computer analysis
- PMID: 2684223
- DOI: 10.1080/07391102.1989.10507752
1-Tuple DNA sequencing: computer analysis
Abstract
A new method of DNA reading was proposed at the end of 1988 by Lysov et al. According to the authors' claims it has certain advantages as compared to the Maxam-Gilbert and Sanger methods, which are revealed by automation and rapidity of DNA sequencing. Nevertheless its employment is hampered by a number of biological and mathematical problems. The present study proposes an algorithm that allows to overcome the computational difficulties occurring in the course of the method during reconstruction of the DNA sequence by its l-tuple composition. It is shown also that the biochemical problems connected with the loss of information about the l-tuple DNA composition during hybridization are not crucial and can be overcome by finding the maximal flow of minimal cost in the special graph.
Similar articles
-
An algorithm for the DNA sequence generation from k-tuple word contents of the minimal number of random fragments.J Biomol Struct Dyn. 1991 Apr;8(5):1085-102. doi: 10.1080/07391102.1991.10507867. J Biomol Struct Dyn. 1991. PMID: 1878166
-
Whole genome assembly from 454 sequencing output via modified DNA graph concept.Comput Biol Chem. 2009 Jun;33(3):224-30. doi: 10.1016/j.compbiolchem.2009.04.005. Epub 2009 May 3. Comput Biol Chem. 2009. PMID: 19477687
-
Automation of the Maxam-Gilbert chemical sequencing reactions.Biotechniques. 1994 Jun;16(6):1088-92, 1094-5. Biotechniques. 1994. PMID: 8074875
-
Vector representations and related matrices of DNA primary sequence based on L-tuple.Math Biosci. 2010 Oct;227(2):147-52. doi: 10.1016/j.mbs.2010.07.004. Epub 2010 Aug 3. Math Biosci. 2010. PMID: 20688086
-
DNA sequencing by hybridization to oligonucleotide matrix. Calculation of continuous stacking hybridization efficiency.J Biomol Struct Dyn. 1994 Feb;11(4):797-812. doi: 10.1080/07391102.1994.10508033. J Biomol Struct Dyn. 1994. PMID: 8204215
Cited by
-
Computational methods for transcriptome annotation and quantification using RNA-seq.Nat Methods. 2011 Jun;8(6):469-77. doi: 10.1038/nmeth.1613. Epub 2011 May 27. Nat Methods. 2011. PMID: 21623353 Review.
-
A tri-tuple coordinate system derived for fast and accurate analysis of the colored de Bruijn graph-based pangenomes.BMC Bioinformatics. 2021 May 27;22(1):282. doi: 10.1186/s12859-021-04149-w. BMC Bioinformatics. 2021. PMID: 34044757 Free PMC article.
-
What is the difference between the breakpoint graph and the de Bruijn graph?BMC Genomics. 2014;15 Suppl 6(Suppl 6):S6. doi: 10.1186/1471-2164-15-S6-S6. Epub 2014 Oct 17. BMC Genomics. 2014. PMID: 25572416 Free PMC article.
-
GRASShopPER-An algorithm for de novo assembly based on GPU alignments.PLoS One. 2018 Aug 16;13(8):e0202355. doi: 10.1371/journal.pone.0202355. eCollection 2018. PLoS One. 2018. PMID: 30114279 Free PMC article.
-
A novel method for multiple alignment of sequences with repeated and shuffled elements.Genome Res. 2004 Nov;14(11):2336-46. doi: 10.1101/gr.2657504. Genome Res. 2004. PMID: 15520295 Free PMC article.
Publication types
MeSH terms
Substances
LinkOut - more resources
Full Text Sources
Other Literature Sources