Clustering exact matches of pairwise sequence alignments by weighted linear regression

被引:2
|
作者
Gonzalez, Alvaro J. [1 ]
Liao, Li [1 ]
机构
[1] Univ Delaware, Comp & Informat Sci Dept, Lab Bioinformat, Newark, DE 19716 USA
基金
美国国家科学基金会;
关键词
D O I
10.1186/1471-2105-9-102
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align these contigs to a reference genome when it is available. The interest is not to analyze a detailed alignment between a contig and the reference genome at the base level, but rather to have a rough estimate of where the contig aligns to the reference genome, specifically, by identifying the starting and ending positions of such a region. This information is very useful in ordering the contigs, facilitating post-assembly analysis such as gap closure and resolving repeats. There exist programs, such as BLAST and MUMmer, that can quickly align and identify high similarity segments between two sequences, which, when seen in a dot plot, tend to agglomerate along a diagonal but can also be disrupted by gaps or shifted away from the main diagonal due to mismatches between the contig and the reference. It is a tedious and practically impossible task to visually inspect the dot plot to identify the regions covered by a large number of contigs from sequence assembly projects. A forced global alignment between a contig and the reference is not only time consuming but often meaningless. Results: We have developed an algorithm that uses the coordinates of all the exact matches or high similarity local alignments, clusters them with respect to the main diagonal in the dot plot using a weighted linear regression technique, and identifies the starting and ending coordinates of the region of interest. Conclusion: This algorithm complements existing pairwise sequence alignment packages by replacing the time-consuming seed extension phase with a weighted linear regression for the alignment seeds. It was experimentally shown that the gain in execution time can be outstanding without compromising the accuracy. This method should be of great utility to sequence assembly and genome comparison projects.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Clustering exact matches of pairwise sequence alignments by weighted linear regression
    Alvaro J González
    Li Liao
    BMC Bioinformatics, 9
  • [2] Multiple genome alignment by clustering pairwise matches
    Choi, JH
    Choi, K
    Cho, HG
    Kim, S
    COMPARATIVE GENOMICS, 2005, 3388 : 30 - 41
  • [3] LALNVIEW: A graphical viewer for pairwise sequence alignments
    Duret, L
    Gasteiger, E
    Perriere, G
    COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1996, 12 (06): : 507 - 510
  • [4] THE EXPECTED NUMBER OF MATCHES IN OPTIMAL GLOBAL SEQUENCE ALIGNMENTS
    RINSMAMELCHERT, I
    NEW ZEALAND JOURNAL OF BOTANY, 1993, 31 (03) : 219 - 230
  • [5] Exact sequence matches in genomic studies
    Sheinman, M.
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENIY-PRIKLADNAYA NELINEYNAYA DINAMIKA, 2023, 31 (06): : 739 - 756
  • [6] ADVANTAGES OF USING MULTIPLE SEQUENCE ALIGNMENTS OVER PAIRWISE ALIGNMENTS WHEN SEQUENCE SIMILARITY IS LOW
    BABBITT, PC
    DUNAWAYMARIANO, D
    KENYON, GL
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1992, 203 : 60 - BIOL
  • [7] ADVANTAGES OF USING MULTIPLE SEQUENCE ALIGNMENTS OVER PAIRWISE ALIGNMENTS WHEN SEQUENCE SIMILARITY IS LOW
    BABBITT, PC
    DUNAWAYMARIANO, D
    KENYON, GL
    BIOCHEMISTRY, 1992, 31 (07) : 2198 - 2198
  • [8] Pairwise alignment of nucleotide sequences using maximal exact matches
    Arash Bayat
    Bruno Gaëta
    Aleksandar Ignjatovic
    Sri Parameswaran
    BMC Bioinformatics, 20
  • [9] Pairwise alignment of nucleotide sequences using maximal exact matches
    Bayat, Arash
    Gaeta, Bruno
    Ignjatovic, Aleksandar
    Parameswaran, Sri
    BMC BIOINFORMATICS, 2019, 20 (1)
  • [10] Domain identification by clustering sequence alignments
    Guan, XJ
    Du, L
    BIOINFORMATICS, 1998, 14 (09) : 783 - 788