A double classification tree search algorithm for index SNP selection

BMC Bioinformatics

Volumn 5, Issue , 2004, Pages

  Zhang, Peisen ^a   Sheng, Huitao ^b   Uehara, Ryuhei ^c  

^a NATIONAL CANCER INSTITUTE   (United States)

^b Columbia University ^*  (United States)

^c KOMAZAWA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BRUTE FORCE ALGORITHMS; CLASSIFICATION TREES; HAPLOTYPES; LARGE DATASETS; REDUCE COSTS; SINGLE-NUCLEOTIDE POLYMORPHISM MARKERS; WEB SERVERS;

COMPUTATIONAL COMPLEXITY;

LEARNING ALGORITHMS;

ARTICLE; CODING AND CLASSIFICATION; COMPUTER PROGRAM; GENETIC ALGORITHM; GENETIC ASSOCIATION; HAPLOTYPE; INTERNET; SINGLE NUCLEOTIDE POLYMORPHISM; ALGORITHM; BIOLOGY; CLASSIFICATION; GENETIC SELECTION; GENETICS; PROCEDURES;

ALGORITHMS; COMPUTATIONAL BIOLOGY; HAPLOTYPES; POLYMORPHISM, SINGLE NUCLEOTIDE; SELECTION, GENETIC; SOFTWARE; SOFTWARE DESIGN;

EID: 13244258376     PISSN: 14712105     EISSN: None     Source Type: Journal    
DOI: 10.1186/1471-2105-5-89     Document Type: Article

References (8)

1. Johnson GCL, Esposito L, Barratt BJ, Smith AN, Heward J, Genova GD, Ueda H, Cordell HJ, Eaves IA, Dudbridge F, Twells RCJ, Payne F, Hughes W, Nutland S, Stevens H, Carr P, Tuomilehto-Wolf E, Tuomilehto J, Gough SCL, Clayton DG, Todd JA: Haplotype tagging for the identification of common disease genes. Nature Genet 2001, 29:233-237.
2. Bafna V, Halldorsson BV, Schwartz R, Clark AG, Istrail S: Haplotypes and informative SNP selection algorithms:don't block out information. RECOMB Berlin, Germany 2003.
3. Clayton DG: Choosing a set of haplotype tagging SNPs from a larger set of diallelic loci. [http://www.nature.com/ng/journal/v29/n2/extref/ng1001-233-S10.pdf].
4. Sebastiani P, Lazarus R, Weiss ST, Kunkel LM, Kohane IS, Ramoni MF: Minimal haplotype tagging. Proc Natl Acad Sci USA 2003, 100:9900-9905.
5. Zhang J, Rowe WL, Struewing JP, Buetow KH: HapScope: A Software System for Automated and Visual Analysis of Functionally Annotated Haplotypes. Nucleic Acids Research 2002, 30: 213-5221.
6. Zhang P, Schon EA, Fischer SG, Cayanis E, Weiss J, Kistler S, Bourne PE: An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA. CABIOS 1994, 10: 09-317.
7. Garey MR, Johnson DS: Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman 1979.
8. UW-FHCRC Variation Discovery Resource (SeattleSNPs) [http://pga.gs.washington.edu]