编译生物信息学递归
Compiling Bioinformatics Recurrences
AI总结:
研究针对生物信息学算法递归方程实现复杂的问题,提出FILTR这一领域特定语言和编译器框架,将核心规则与策略分离,编译成优化C++代码,性能与手工实现匹配且能快速探索新启发式方法,在生物基准测试中表现出色。
摘要:
许多生物信息学算法,如序列比对和结构预测,可表示为动态规划矩阵上的递归方程。大规模生物数据的高效实现常需改变矩阵单元计算顺序并修剪无效区域,但这会使实现复杂化。我们引入FILTR,一种用于生物信息学递归的领域特定语言(DSL)和编译器框架。FILTR将核心递归规则与修剪和调度策略分离,修剪近似限制DP矩阵单元计算位置,调度确定单元探索迭代顺序。FILTR将这些高级描述编译成优化的C++代码,性能与手工调整实现匹配,同时能快速探索新启发式方法。FILTR在生物基准测试中比手工优化的序列比对库快0.95倍至30倍。
英文摘要:
Many bioinformatics algorithms, such as sequence alignment and structure prediction, can be expressed as recurrence equations over a dynamic programming matrix. Efficient implementations of these algorithms for large-scale biological data often require changing the order in which matrix cells are calculated and pruning ineffectual regions of the matrix from consideration altogether, but these techniques typically complicate implementation. We introduce FILTR, a domain-specific language (DSL) and compiler framework for bioinformatics recurrences. FILTR keeps the core recurrence rules separate from the pruning and scheduling strategies, where pruning acts as an approximation to limit where in the DP matrix cells are computed, and scheduling determines the iteration order for how cells are explored. FILTR compiles these high-level descriptions into optimized C++ code that matches the performance of hand-tuned implementations while enabling rapid exploration of new heuristics. FILTR is competitive with hand-optimized sequence-alignment libraries, ranging from 0.95x to 30x faster across biological benchmarks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。