Problem
Research questions and friction points this paper is trying to address.
Pangenome
Elastic Degenerate String
Optimization
Pangenome Optimization via Elastic Degenerate Strings
🤖 AI Summary
本文通过适应创始人重建方法，优化了基于弹性退化字符串(EDS)的泛基因组构建，以线性时间最小化EDS集合的基数或字符串总大小。
📝 Abstract
An Elastic Degenerate String (EDS, or ED-string) is a sequence of string sets. A pangenome, consisting of variations observed in a population along the genome sequences, can be naturally encoded as an EDS. Pattern matching and comparison problems on pangenome representations such as EDSes have been widely studied in the literature, but optimizing the pangenome properties during its construction has been largely omitted. We fill this gap by showing how methods originally developed for the related problem of founder reconstruction can be adapted to minimize, in linear time, the total cardinality of the EDS sets or the total size of the EDS strings, given suitable multiple alignments representing the input data. We provide an implementation for the minimum-cardinality criterion in a tool mincard, and conduct the first experiments on scalable pangenome optimization via EDSes. The code and experiments are available at https://github.com/algbio/eds.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Elastic Degenerate Strings
Pangenome Optimization
Founder Reconstruction
🔎 Similar Papers
No similar papers found.
