完美的系统发育单倍型是完整的对数空间
Perfect Phylogeny Haplotyping is Complete for Logspace
摘要：
单倍型分型是基于给定的基因型预测可能的单倍型的生物信息学问题。它可以使用Gusfield的完美同源单体型（PPH）方法，其中存在多项式和线性时间算法。这些算法使用复杂的数据结构或将基因型数据逐步转换为单体型数据，因此需要线性量的空间。我们感兴趣的PPH的确切的计算复杂性，并表明，它可以解决的空间效率的算法，只需要一个对数量的空间。结合最近证明的PPH的L-硬度，我们建立了L-完备性。我们的算法依赖于一个新的特征PPH的二分图，它可以用来决定和构建完美的基因型的遗传效率。
英文摘要：
Haplotyping is the bioinformatics problem of predicting likely haplotypes based on given genotypes. It can be approached using Gusfield's perfect phylogeny haplotyping (PPH) method for which polynomial and linear time algorithms exist. These algorithm use sophisticated data structures or do a stepwise transformation of the genotype data into haplotype data and, therefore, need a linear amount of space. We are interested in the exact computational complexity of PPH and show that it can be solved space-efficiently by an algorithm that needs only a logarithmic amount of space. Together with the recently proved L-hardness of PPH, we establish L-completeness. Our algorithm relies on a new characterization for PPH in terms of bipartite graphs, which can be used both to decide and construct perfect phylogenies for genotypes efficiently.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
