基于索引结构的代谢网络比对算法研究-计算机应用技术专业论文.docxVIP

Abstract Along with the human genome projects beginning and the modern biological technologys rapid development, the biology message datas growth presents potential of an explosion, which provided data foundation for opening the mysteries of life; The enhancement of computing capabilities and the development of the Internet provides large-scale data’s storage, processing, retrieval and interpretation with a theoretical basis. But the purpose of bioinformatics is how to use the information science and computation technologys method, through the data analysis and processing, to reveal the inner link during mass data and the biology meaning, explain the structure and the functional information they contain, then extract useful biology knowledge. An important tool for analyzing biological networks is the ability to perform homology searches, which is completed through the alignment of networks. In recent years, network comparison techniques promise to take an increasing role in the field of biological research, this problem has been widely and deeply studied and many efficient algorithms are available. In recent years,with the rapid development of biological research methods, the high-throughout quantity of data increase rapidly, there is a growing need for effective and efficient graph querying methods. Due to the noisy and incomplete characteristics of these high throughout biological data and the restricted topology structures, exact graph matching algorithm have limited use and approximate graph matching methods are required. In the context, this paper present a metabolic network alignment algorithm based on index-structures, which introduce index structure into graph alignment. This paper employ a flexible model that allow for the difference of graph structure and characteristic of biological networks when we compute the similarity of query graph and database graphs. We firstly abstract the biological networks as the undirected graph and we modeled the alignment b