DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment

被引:0
|
作者
Stoye, J [1 ]
Moulton, V [1 ]
Dress, AWM [1 ]
机构
[1] Univ Bielefeld, FSPM, Res Ctr Interdisciplinary Studies Struct Format, D-33501 Bielefeld, Germany
来源
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Motivation: DCA is a new computer program for multiple sequence alignment which utilizes a 'divide-and-conquer' type of heuristic approach. Availability: The algorithm is freely available from http://bibiserv.TeckFak.Uni-Bielefeld.DE/dca/ Contact: E-mail: stoye@Mathematik.Uni-Bielefeld.DE.
引用
收藏
页码:625 / 626
页数:2
相关论文
共 50 条
  • [31] An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition
    Shubham
    Prakash, Surya
    Ganapathi, Pramod
    INFORMATION PROCESSING LETTERS, 2022, 173
  • [32] Gaussian Process Learning: A Divide-and-Conquer Approach
    Li, Wenye
    ADVANCES IN NEURAL NETWORKS - ISNN 2014, 2014, 8866 : 262 - 269
  • [33] A divide-and-conquer approach for content replication in WMNs
    Al-Arnaout, Zakwan
    Fu, Qiarig
    Frean, Marcus
    COMPUTER NETWORKS, 2013, 57 (18) : 3914 - 3928
  • [34] A Divide-and-Conquer Approach to the Summarization of Long Documents
    Gidiotis, Alexios
    Tsoumakas, Grigorios
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 (28) : 3029 - 3040
  • [35] A divide-and-conquer approach to compressed sensing MRI
    Sun, Liyan
    Fan, Zhiwen
    Ding, Xinghao
    Cai, Congbo
    Huang, Yue
    Paisley, John
    MAGNETIC RESONANCE IMAGING, 2019, 63 : 37 - 48
  • [36] Space-efficient geometric divide-and-conquer algorithms
    Bose, Prosenjit
    Maheshwari, Anil
    Morin, Pat
    Morrison, Jason
    Smid, Michiel
    Vahrenhold, Jan
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2007, 37 (03): : 209 - 227
  • [37] Satin: Efficient parallel divide-and-conquer in Java']Java
    van Nieuwpoort, RV
    Kielmann, T
    Bal, HE
    EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 690 - 699
  • [38] EFFICIENT PARALLEL DIVIDE-AND-CONQUER FOR A CLASS OF INTERCONNECTION TOPOLOGIES
    WU, IC
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 229 - 240
  • [39] An Efficient Divide-and-Conquer Cascade for Nonlinear Object Detection
    Lampert, Christoph H.
    2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, : 1022 - 1029
  • [40] Treatment of multiple brain metastases with a divide-and-conquer spatial fractionation radiosurgery approach
    Kelly, Douglas A.
    MEDICAL HYPOTHESES, 2014, 83 (04) : 425 - 428