A local chaining algorithm and its applications in comparative genomics

被引：0
|
作者：
Abouelhoda, MI
Ohlebusch, E
机构：
[1] Univ Bielefeld, Fac Technol, D-33501 Bielefeld, Germany
[2] Univ Ulm, Fac Comp Sci, D-89069 Ulm, Germany
来源：
ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS | 2003年 / 2812卷
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Given fragments from multiple genomes, we will show how to find an optimal local chain of colinear non-overlapping fragments in sub-quadratic time, using methods from computational geometry. A variant of the algorithm finds all significant local chains of colinear non-overlapping fragments. The local chaining algorithm can be used in a variety of problems in comparative genomics: The identification of regions of similarity (candidate regions of conserved synteny), the detection of genome rearrangements such as transpositions and inversions, and exon prediction.
引用
收藏
页码：1 / 16
页数：16
相关论文
共 50 条
  • [1] A local chaining algorithm and its applications in comparative genomics
    Abouelhoda, Mohamed Ibrahim
    Ohlebusch, Enno
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2812 : 1 - 16
  • [2] An SSR comparative genomics database and its applications
    Pai, Tun-Wen
    Hsiao, Meng-Chang
    Chen, Chien-Ming
    Tzou, Wen-Shyong
    Chen, Ron-Shan
    CISIS 2008: THE SECOND INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, PROCEEDINGS, 2008, : 661 - +
  • [3] Comparative genomics: methods and applications
    Haubold, B
    Wiehe, T
    NATURWISSENSCHAFTEN, 2004, 91 (09) : 405 - 421
  • [4] Comparative genomics: methods and applications
    Bernhard Haubold
    Thomas Wiehe
    Naturwissenschaften, 2004, 91 : 405 - 421
  • [5] Applications of comparative genomics to crop improvement
    Sorrells, Mark E.
    PLANT BREEDING: ARNEL R HALLAUER INTERNATIONAL SYMPOSIUM, 2006, : 171 - 181
  • [6] Tridirectional computed chaining: an efficient hashing algorithm for limited space applications
    Loeb, M
    Tharp, AL
    Proceedings of the 29th Annual International Computer Software and Applications Conference, 2005, : 381 - 387
  • [7] Promises and limits of genomics and its applications
    Gros, Francois
    COMPTES RENDUS BIOLOGIES, 2015, 338 (8-9) : 543 - 546
  • [8] Memetic Algorithm with Local Search Chaining for Continuous Optimization Problems: A Scalability Test
    Molina, Daniel
    Lozano, Manuel
    Herrera, Francisco
    2009 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, 2009, : 1068 - +
  • [9] Memetic Algorithm with Local Search Chaining for Large Scale Continuous Optimization Problems
    Molina, Daniel
    Lozano, Manuel
    Herrera, Francisco
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 830 - +
  • [10] Gray code chaining: A high performance hashing algorithm for limited storage applications
    IBM Corporation, Research Triangle Park, NC 27709, United States
    不详
    Int. J. High Perform. Syst. Archit., 2008, 3 (143-149):
12345