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.
3. A branch-and-cut approach to physical mapping of chromosomes by unique end-probes. Christof T; Jünger M; Kececioglu J; Mutzel P; Reinelt G J Comput Biol; 1997; 4(4):433-47. PubMed ID: 9385538 [TBL] [Abstract][Full Text] [Related]
4. The double digest problem: finding all solutions. Sur-Kolay S; Banerjee S; Mukhopadhyaya S; Murthy CA Int J Bioinform Res Appl; 2009; 5(5):570-92. PubMed ID: 19778871 [TBL] [Abstract][Full Text] [Related]
5. A fast exact sequential algorithm for the partial digest problem. Abbas MM; Bahig HM BMC Bioinformatics; 2016 Dec; 17(Suppl 19):510. PubMed ID: 28155644 [TBL] [Abstract][Full Text] [Related]
6. Algorithms for computing and integrating physical maps using unique probes. Jain M; Myers EW J Comput Biol; 1997; 4(4):449-66. PubMed ID: 9385539 [TBL] [Abstract][Full Text] [Related]
7. Fast Algorithms for the Simplified Partial Digest Problem. Wang BF J Comput Biol; 2023 Jan; 30(1):41-51. PubMed ID: 35575710 [TBL] [Abstract][Full Text] [Related]
8. Mapping of orthologous genes in the context of biological pathways: An application of integer programming. Mao F; Su Z; Olman V; Dam P; Liu Z; Xu Y Proc Natl Acad Sci U S A; 2006 Jan; 103(1):129-34. PubMed ID: 16373500 [TBL] [Abstract][Full Text] [Related]
9. DDmap: a MATLAB package for the double digest problem using multiple genetic operators. Wang L; Suo J; Pan Y; Li L BMC Bioinformatics; 2019 Jun; 20(1):348. PubMed ID: 31215408 [TBL] [Abstract][Full Text] [Related]
10. A fast random cost algorithm for physical mapping. Wang Y; Prade RA; Griffith J; Timberlake WE; Arnold J Proc Natl Acad Sci U S A; 1994 Nov; 91(23):11094-8. PubMed ID: 7972016 [TBL] [Abstract][Full Text] [Related]
11. Accurate construction of consensus genetic maps via integer linear programming. Wu Y; Close TJ; Lonardi S IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(2):381-94. PubMed ID: 20479505 [TBL] [Abstract][Full Text] [Related]
13. Fast and high precision algorithms for optimization in large-scale genomic problems. Mester DI; Ronin YI; Nevo E; Korol AB Comput Biol Chem; 2004 Oct; 28(4):281-90. PubMed ID: 15548455 [TBL] [Abstract][Full Text] [Related]
14. GRAM and genfragII: solving and testing the single-digest, partially ordered restriction map problem. Soderlund C; Burks C Comput Appl Biosci; 1994 Jun; 10(3):349-58. PubMed ID: 7922694 [TBL] [Abstract][Full Text] [Related]
16. A fast heuristic algorithm for a probe mapping problem. Mumey B Proc Int Conf Intell Syst Mol Biol; 1997; 5():191-7. PubMed ID: 9322035 [TBL] [Abstract][Full Text] [Related]
17. The chimeric mapping problem: algorithmic strategies and performance evaluation on synthetic genomic data. Greenberg D; Istrail S Comput Chem; 1994 Sep; 18(3):207-20. PubMed ID: 7952891 [TBL] [Abstract][Full Text] [Related]
18. LGH: A Fast and Accurate Algorithm for Single Individual Haplotyping Based on a Two-Locus Linkage Graph. Xie M; Wang J; Chen X IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1255-66. PubMed ID: 26671798 [TBL] [Abstract][Full Text] [Related]
19. An approximation algorithm for the minimum breakpoint linearization problem. Chen X; Cui Y IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):401-9. PubMed ID: 19644168 [TBL] [Abstract][Full Text] [Related]
20. The median problems on linear multichromosomal genomes: graph representation and fast exact solutions. Xu AW J Comput Biol; 2010 Sep; 17(9):1195-211. PubMed ID: 20874404 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]