Parallel and Polynomially Bound Heuristics on The Phylofarm Processor Array: A Parisimonious Tree of Life

Phylofarm 处理器阵列上的并行和多项式约束启发式：Parisimonious 生命树

• 批准号: 9618773
• 负责人: Warren Ewens
• 金额: --
• 依托单位: University of Pennsylvania
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1997
• 资助国家: 美国
• 起止时间: 1997-05-15 至 1998-04-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9618773&HistoricalAwards=false
• 关键词: Parallel; Polynomially; Bound; Heuristics; Phylofarm

This project will use an array of 18 200MHz Pentium Pro processors with an aggregate memory of 1216 MB to reconstruct phylogenetic trees from molecular data sets that are too large for analysis by present methods, and to conduct large-scale comparative performance analyses of competing phylogenetic reconstruction algorithms. Large-scale phylogenetic reconstructions using parallel heuristic methods designed by the grantees are expected to lead to new results in seed plant evolution, and in the most- parsimonious reconstruction of the tree of life. Large-scale comparative performance analyses will explore a five-dimensional parameter space for data sets of 50 to 1000 sequences. These analyses are expected to lead to new observations of the relative strengths and weaknesses of competing methods and to new classes of adversarial examples.

该项目将使用一个阵列的18个200MHz奔腾Pro处理器的聚合内存为1216 MB的分子数据集，太大的分析目前的方法来重建系统发育树，并进行大规模的比较性能分析的竞争系统发育重建算法。 大规模的系统发育重建使用并行启发式方法设计的受赠人预计会导致种子植物进化的新成果，并在最简约的重建生命之树。 大规模的比较性能分析将探索50到1000个序列的数据集的五维参数空间。 这些分析预计将导致新的意见的相对优势和竞争的方法和新类别的对抗性的例子的弱点。