Scalable Homology Search Tools

可扩展的同源搜索工具

• 批准号: 0213903
• 负责人: Ambuj Singh
• 金额: --
• 依托单位: University of California-Santa Barbara
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-08-15 至 2007-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0213903&HistoricalAwards=false
• 关键词: Scalable; Homology; Search; Tools

Biologists are interested in having the ability to deal with large amounts of sequence data. One of the common questions asked is to detect regions of high similarity, under the assumption that similarity in sequence will reflect not only similar function and structure but also a level of relatedness. When comparing very large sequences, it is necessary to have wide bandwidth for data that is distributed or access the data many times, if the data can be managed locally. An index structure of the data rather than the data itself can be stored in much less space and accessed much more rapidly. The new structure uses a measure that corresponds to the differences or number of changes necessary to change one sequence into another. It is called a Multi-Resolution String Index Structure. It has been implemented in a prototype. The expanded effort will result in scalable searching tools that will bring in a number of students for the proposed effort in the basic data structure research. A number of biological scientists are involved in using the software. The results of the work will be made available on the Internet.

生物学家对处理大量序列数据的能力感兴趣。 常见的问题之一是检测高度相似的区域，假设序列的相似性不仅反映了相似的功能和结构，而且反映了一定程度的相关性。 当比较非常大的序列时，如果可以在本地管理数据，则需要为分布式数据提供较宽的带宽或多次访问该数据。 数据的索引结构而不是数据本身可以存储在更少的空间中并且访问速度更快。 新结构使用一种与将一个序列更改为另一个序列所需的差异或更改数量相对应的度量。 它被称为多分辨率字符串索引结构。 它已在原型中实现。 扩展的工作将产生可扩展的搜索工具，这将吸引大量学生参与基础数据结构研究的拟议工作。 许多生物科学家参与了该软件的使用。 工作结果将在互联网上公布。