用户名: 密码: 验证码:
Assessment of gene order computing methods for Alzheimer’s disease
详细信息    查看全文
  • 作者:Benqiong Hu (1)
    Gang Jiang (2)
    Chaoyang Pang (2)
    Shipeng Wang (2)
    Qingzhong Liu (3)
    Zhongxue Chen (4)
    Charles R Vanderburg (5)
    Jack T Rogers (6)
    Youping Deng (7)
    Xudong Huang (6)
  • 刊名:BMC Medical Genomics
  • 出版年:2013
  • 出版时间:January 2013
  • 年:2013
  • 卷:6
  • 期:1-supp
  • 全文大小:677KB
  • 参考文献:1. Thies W, Bleiler L: 2011 Alzheimer's disease facts and figures. / Alzheimers Dement 2011, 7:208-44. CrossRef
    2. Alzheimer A: "über eine eigenartige Erkrankung der Hirnrinde" - Die Alzheimersche Krankheit im Brennpunkt von Klinik und Forschung. / Allg Zeitschr Psychiatr Psychiatr-Gerichtl Med 1907, 109:146-48.
    3. Tanzi RE, Bertram L: Twenty years of the Alzheimer's disease amyloid hypothesis: a genetic perspective. / Cell 2005, 120:545-55. CrossRef
    4. Glenner GG, Wong CW: Alzheimer's disease and Down's syndrome: sharing of a unique cerebrovascular amyloid fibril protein. / Biochem Biophys Res Commun 1984, 122:1131-135. CrossRef
    5. Levy E, Carman MD, Fernandez-Madrid IJ, Power MD, Lieberburg I, van Duinen SG, Bots GT, Luyendijk W, Frangione B: Mutation of the Alzheimer's disease amyloid gene in hereditary cerebral hemorrhage, Dutch type. / Science 1990, 248:1124-126. CrossRef
    6. Goate A, Chartier-Harlin MC, Mullan M, Brown J, Crawford F, Fidani L, Giuffra L, Haynes A, Irving N, James L, / et al.: Segregation of a missense mutation in the amyloid precursor protein gene with familial Alzheimer's disease. / Nature 1991, 349:704-06. CrossRef
    7. Pericak-Vance MA, Bebout JL, Gaskell PC Jr, Yamaoka LH, Hung WY, Alberts MJ, Walker AP, Bartlett RJ, Haynes CA, Welsh KA, / et al.: Linkage studies in familial Alzheimer's disease: evidence for chromosome 19 linkage. / Am J Hum Genet 1991, 48:1034-050.
    8. Schmechel DE, Saunders AM, Strittmatter WJ, Crain BJ, Hulette CM, Joo SH, Pericak-Vance MA, Goldgaber D, Roses AD: Increased amyloid beta-peptide deposition in cerebral cortex as a consequence of apolipoprotein E genotype in late-onset Alzheimer's disease. / Proc Natl Acad Sci USA 1993, 90:9649-653. CrossRef
    9. Wragg M, Hutton M, Talbot C: Genetic association between intronic polymorphism in presenilin-1 gene and late-onset Alzheimer's disease. Alzheimer's Disease Collaborative Group. / Lancet 1996, 347:509-12. CrossRef
    10. Rogaeva EA, Fafel KC, Song YQ, Medeiros H, Sato C, Liang Y, Richard E, Rogaev EI, Frommelt P, Sadovnick AD, / et al.: Screening for PS1 mutations in a referral-based series of AD cases: 21 novel mutations. / Neurology 2001, 57:621-25. CrossRef
    11. Zhang C, Wu B, Beglopoulos V, Wines-Samuelson M, Zhang D, Dragatsis I, Sudhof TC, Shen J: Presenilins are essential for regulating neurotransmitter release. / Nature 2009, 460:632-36. CrossRef
    12. Lambert JC, Mann DM, Harris JM, Chartier-Harlin MC, Cumming A, Coates J, Lemmon H, StClair D, Iwatsubo T, Lendon C: The -48 C/T polymorphism in the presenilin 1 promoter is associated with an increased risk of developing Alzheimer's disease and an increased Abeta load in brain. / J Med Genet 2001, 38:353-55. CrossRef
    13. Jakob-Roetne R, Jacobsen H: Alzheimer's disease: from pathology to therapeutic approaches. / Angew Chem Int Ed Engl 2009, 48:3030-059. CrossRef
    14. Caughey B, Lansbury PT: Protofibrils, pores, fibrils, and neurodegeneration: separating the responsible protein aggregates from the innocent bystanders. / Annu Rev Neurosci 2003, 26:267-98. CrossRef
    15. Eisen MB, Spellman PT, Brown PO, Botstein D: Cluster analysis and display of genome-wide expression patterns. / Proc Natl Acad Sci USA 1998, 95:14863-4868. CrossRef
    16. Sokal RR, Michener CD: A statistical method for evaluating systematic relationships. / University of Kansas Science Bulletin 1958, 1409-438.
    17. Alizadeh AA, Eisen MB, Davis RE, Ma C, Lossos IS, Rosenwald A, Boldrick JC, Sabet H, Tran T, Yu X, / et al.: Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. / Nature 2000, 403:503-11. CrossRef
    18. Kawasaki S, Borchert C, Deyholos M, Wang H, Brazille S, Kawai K, Galbraith D, Bohnert HJ: Gene expression profiles during the initial phase of salt stress in rice. / Plant Cell 2001, 13:889-05.
    19. Khodursky AB, Peter BJ, Cozzarelli NR, Botstein D, Brown PO, Yanofsky C: DNA microarray analysis of gene expression in response to physiological and genetic changes that affect tryptophan metabolism in Escherichia coli . / Proc Natl Acad Sci USA 2000, 97:12170-2175. CrossRef
    20. Schaffer R, Landgraf J, Accerbi M, Simon V, Larson M, Wisman E: Microarray analysis of diurnal and circadian-regulated genes in Arabidopsis . / Plant Cell 2001, 13:113-23.
    21. Bar-Joseph Z, Gifford DK, Jaakkola TS: Fast optimal leaf ordering for hierarchical clustering. / Bioinformatics 2001,17(Suppl 1):S22-9. CrossRef
    22. Herrero J, Valencia A, Dopazo J: A hierarchical unsupervised growing neural network for clustering gene expression patterns. / Bioinformatics 2001, 17:126-36. CrossRef
    23. Tamayo P, Slonim D, Mesirov J, Zhu Q, Kitareewan S, Dmitrovsky E, Lander ES, Golub TR: Interpreting patterns of gene expression with self-organizing maps: methods and application to hematopoietic differentiation. / Proc Natl Acad Sci USA 1999, 96:2907-912. CrossRef
    24. Toronen P, Kolehmainen M, Wong G, Castren E: Analysis of gene expression data using self-organizing maps. / FEBS Lett 1999, 451:142-46. CrossRef
    25. Tavazoie S, Hughes JD, Campbell MJ, Cho RJ, Church GM: Systematic determination of genetic network architecture. / Nat Genet 1999, 22:281-85. CrossRef
    26. Ben-Dor A, Shamir R, Yakhini Z: Clustering gene expression patterns. / J Comput Biol 1999, 6:281-97. CrossRef
    27. Merz P, Zell A: Clustering gene expression profiles with memetic algorithms. / 7th International Conference on Parallel Problem Solving from Nature 2002, 811-20.
    28. Edwards AW, Cavalli-Sforza LL: A method for cluster analysis. / Biometrics 1965, 21:362-75. CrossRef
    29. Ward JH Jr: Hierarchical grouping to optimize an objective function. / Journal of the American statistical association 1963, 58:236-44. CrossRef
    30. Bar-Joseph Z, Biedl T, Brejova B, Demaine ED, Gifford DK, Hamel AM, Jaakkola TS, Srebro N, Vinar T: Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data. In / Technical Report CS-2001-4. Dept. of Computer Science, University of Walterloo; 2001.
    31. Goldberg DE: / Genetic algorithms in search, optimization & machine learning. Reading, MA: Addison-Wesley; 1989.
    32. Holland JH: / Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press; 1975.
    33. Nagata Y, Kobayashi S: Edge assembly crossover: a high-power genetic algorithm fort the traveling salesman problem. / 7th International Conference on Genetic Algorithms 1977, 450-57.
    34. Tsai HK, Yang JM, Kao CY: A genetic algorithm for traveling salesman problems. / Genetic and Evolutionary Computation Conference (GECCO 2001) 2001, 687-93.
    35. Tsai HK, Yang JM, Kao CY: Applying genetic algorithms to finding the optimal order in displaying the microarray data. / Genetic and Evolutionary Computation Conference (GECCO 2002) 2002, 610-17.
    36. Tsai HK, Yang JM, Kao CY: Solving traveling salesman problems by combining global and local search mechanisms. / Congress on Evolutionary Computation (CEC 2002) 2002, 1290-295.
    37. Lee S-K, Kim Y-H, Moon B-R: Finding the optimal gene order in displaying microarray data. In / Lecture Notes in Computer Science. Springer Berlin/Heidelberg; 2003:1611-349.
    38. Dorigo M, Maniezzo V, Colorni A: Ant system: optimization by a colony of cooperating agents. / IEEE Trans Syst Man Cybern B Cybern 1996, 26:29-1. CrossRef
    39. Pang C, Jiang G, Wang S, Hu B, Liu Q, Deng Y, Huang X: Gene order computation using Alzheimer's DNA microarray gene expression data and the ant colony optimization algorithm. / International Journal of Data Mining and Bioinformatics, in press.
    40. Pang C, Wang C, Hu B: Experiment study of entropy convergence of ant colony optimization. / arXiv:09051751v4 [csNE] 2009.
    41. Reeves CR, Beasley JE: Modern heuristic techniques for combinatorial problems. / Blackwell Scientific 1993.
    42. Djannaty F, Doostdar S: A hybrid genetic algorithm for the multidimensional knapsack problem. / International Journal of Contemporary Mathematical Sciences 2008, 3:443-56.
    43. Glover F, Kochenberger G: Handbook of metaheuristics. / Kluwer Academic Publisher 2003.
    44. Spearman C: The proof and measurement of association between two things. / American Journal of Psychology 1904, 15:72-01. CrossRef
    45. Kendall M: A new measure of rank correlation. / Biomerika 1938, 30:81-3.
    46. Ueyama T, Fukuda T, Arai F: Configuration using genetic algorithm for cellular robotic system. In / IROS. Raleigh, NC; 1992:1542-549.
    47. Kirk J: Traveling salesman problem-genetic algorithm.
    48. Blalock EM, Geddes JW, Chen KC, Porter NM, Markesbery WR, Landfield PW: Incipient Alzheimer's disease: microarray correlation analyses reveal major transcriptional and tumor suppressor responses. / Proc Natl Acad Sci USA 2004, 101:2173-178. CrossRef
  • 作者单位:Benqiong Hu (1)
    Gang Jiang (2)
    Chaoyang Pang (2)
    Shipeng Wang (2)
    Qingzhong Liu (3)
    Zhongxue Chen (4)
    Charles R Vanderburg (5)
    Jack T Rogers (6)
    Youping Deng (7)
    Xudong Huang (6)

    1. College of Management Science, Chengdu University of Technology, Chengdu, 610059, China
    2. Group of Gene Computation, College of Mathematics and Software Science, Sichuan Normal University, Chengdu, 610066, China
    3. Department of Computer Science, Sam Houston State University, Huntsville, TX, 7734, USA
    4. Department of Epidemiology and Biostatistics, School of Public Health, Indiana University Bloomington, 1025 E. 7th Street, Bloomington, IN, 47405-7109, USA
    5. Harvard NeuroDiscovery Center and Department of Neurology, Massachusetts General Hospital and Harvard Medical School, Charlestown, MA, 02129, USA
    6. Neurochemistry Laboratory, Department of Psychiatry, Massachusetts General Hospital and Harvard Medical School, Charlestown, MA, 02129, USA
    7. Cancer Bioinformatics, Rush University Cancer Center, and Department of Internal Medicine, Rush University Medical Center, Chicago, IL, 60612, USA
  • ISSN:1755-8794
文摘
Background Computational genomics of Alzheimer disease (AD), the most common form of senile dementia, is a nascent field in AD research. The field includes AD gene clustering by computing gene order which generates higher quality gene clustering patterns than most other clustering methods. However, there are few available gene order computing methods such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Further, their performance in gene order computation using AD microarray data is not known. We thus set forth to evaluate the performances of current gene order computing methods with different distance formulas, and to identify additional features associated with gene order computation. Methods Using different distance formulas- Pearson distance and Euclidean distance, the squared Euclidean distance, and other conditions, gene orders were calculated by ACO and GA (including standard GA and improved GA) methods, respectively. The qualities of the gene orders were compared, and new features from the calculated gene orders were identified. Results Compared to the GA methods tested in this study, ACO fits the AD microarray data the best when calculating gene order. In addition, the following features were revealed: different distance formulas generated a different quality of gene order, and the commonly used Pearson distance was not the best distance formula when used with both GA and ACO methods for AD microarray data. Conclusion Compared with Pearson distance and Euclidean distance, the squared Euclidean distance generated the best quality gene order computed by GA and ACO methods.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700