These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
80 related articles for article (PubMed ID: 12499289)
1. A divide-and-conquer approach to fragment assembly. Otu HH; Sayood K Bioinformatics; 2003 Jan; 19(1):22-9. PubMed ID: 12499289 [TBL] [Abstract][Full Text] [Related]
2. Efficiently detecting polymorphisms during the fragment assembly process. Fasulo D; Halpern A; Dew I; Mobarry C Bioinformatics; 2002; 18 Suppl 1():S294-302. PubMed ID: 12169559 [TBL] [Abstract][Full Text] [Related]
3. An Eulerian path approach to DNA fragment assembly. Pevzner PA; Tang H; Waterman MS Proc Natl Acad Sci U S A; 2001 Aug; 98(17):9748-53. PubMed ID: 11504945 [TBL] [Abstract][Full Text] [Related]
4. Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach. Hughes JA; Houghten S; Ashlock D Biosystems; 2016 Dec; 150():35-45. PubMed ID: 27521768 [TBL] [Abstract][Full Text] [Related]
5. A simulated annealing algorithm for finding consensus sequences. Keith JM; Adams P; Bryant D; Kroese DP; Mitchelson KR; Cochran DA; Lala GH Bioinformatics; 2002 Nov; 18(11):1494-9. PubMed ID: 12424121 [TBL] [Abstract][Full Text] [Related]
6. A graph based algorithm for generating EST consensus sequences. Malde K; Coward E; Jonassen I Bioinformatics; 2005 Apr; 21(8):1371-5. PubMed ID: 15572463 [TBL] [Abstract][Full Text] [Related]
7. Generating consensus sequences from partial order multiple sequence alignment graphs. Lee C Bioinformatics; 2003 May; 19(8):999-1008. PubMed ID: 12761063 [TBL] [Abstract][Full Text] [Related]
8. An accurate algorithm for the detection of DNA fragments from dilution pool sequencing experiments. Bansal V Bioinformatics; 2018 Jan; 34(1):155-162. PubMed ID: 29036419 [TBL] [Abstract][Full Text] [Related]