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 条
  • [41] Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments
    Daily, Jeff
    BMC BIOINFORMATICS, 2016, 16
  • [42] A Distributed CPU-GPU Framework for Pairwise Alignments on Large-Scale Sequence Datasets
    Li, Da
    Sajjapongse, Kittisak
    Huan Truong
    Conant, Gavin
    Becchi, Michela
    PROCEEDINGS OF THE 2013 IEEE 24TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 13), 2013, : 329 - 338
  • [43] Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments
    Jeff Daily
    BMC Bioinformatics, 17
  • [44] Quantum clustering-based weighted linear programming support vector regression for multivariable nonlinear problem
    Yu, Yanfang
    Qian, Feng
    Liu, Huimin
    SOFT COMPUTING, 2010, 14 (09) : 921 - 929
  • [45] Quantum clustering-based weighted linear programming support vector regression for multivariable nonlinear problem
    Yanfang Yu
    Feng Qian
    Huimin Liu
    Soft Computing, 2010, 14 : 921 - 929
  • [46] EXACT LINEAR RESTRICTIONS ON PARAMETERS IN A LINEAR-REGRESSION MODEL
    BITTNER, AC
    AMERICAN STATISTICIAN, 1974, 28 (01): : 36 - 36
  • [47] PENALIZED LINEAR REGRESSION WITH HIGH-DIMENSIONAL PAIRWISE SCREENING
    Gong, Siliang
    Zhang, Kai
    Liu, Yufeng
    STATISTICA SINICA, 2021, 31 (01) : 391 - 420
  • [48] EXACT LINEAR RESTRICTIONS ON PARAMETERS IN CLASSICAL LINEAR REGRESSION MODEL
    MANTELL, EH
    AMERICAN STATISTICIAN, 1973, 27 (02): : 86 - 87
  • [49] An exact fitting estimator for linear regression - Solution
    Linton, O
    ECONOMETRIC THEORY, 2001, 17 (05) : 1026 - 1029
  • [50] Generalized regression model for sequence matching and clustering
    Hansheng Lei
    Venu Govindaraju
    Knowledge and Information Systems, 2007, 12 : 77 - 94