Aligning 415 519 proteins in less than two hours on PC
원문 초록
Rapid development of modern sequencing platforms enabled an unprecedented growth of protein families databases. The abundance of sets composed of hundreds of thousands sequences is a great challenge for multiple sequence alignment algorithms. In the article we introduce FAMSA, a new progressive algorithm designed for fast and accurate alignment of thousands of protein sequences. Its features include the utilisation of longest common subsequence measure for determining pairwise similarities, a novel method of gap costs evaluation, and a new iterative refinement scheme. Importantly, its implementation is highly optimised and parallelised to make the most of modern computer platforms. Thanks to the above, quality indicators, namely sum-of-pairs and total-column scores, show FAMSA to be superior to competing algorithms like Clustal Omega or MAFFT for datasets exceeding a few thousand of sequences. The quality does not compromise time and memory requirements which are an order of magnitude lower than that of existing solutions. For example, a family of 415 519 sequences was analysed in less than two hours and required only 8GB of RAM. FAMSA is freely available at http://sun.aei.polsl.pl/REFRESH/famsa.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MSAGPT: Neural Prompting Protein Structure Prediction via MSA Generative Pre-Training
ESM-NBR: fast and accurate nucleic acid-binding residue prediction via protein language model feature representation and multi-task learning
PEvoLM: Protein Sequence Evolutionary Information Language Model
PoET: A generative model of protein families as sequences-of-sequences
Enhancing the Protein Tertiary Structure Prediction by Multiple Sequence Alignment Generation
Quantile-Based Deep Reinforcement Learning using Two-Timescale Policy Gradient Algorithms
토론
이 논문과 연결된 포럼 글이 아직 없습니다.