Alignments without low-scoring regions

Zheng Zhang, Piotr Berman, Webb Miller

    Research output: Contribution to conferencePaper

    3 Citations (Scopus)

    Abstract

    Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching beyond the point that a useful extension of the alignment is likely to be found. Without loss of generality, we can restrict attention to the suffixes of the sequences that follow the strong match, which leads to the following formal problem. Given two sequences and a fixed X>0, align initial portions of the sequences subject to the constraint that no section of the alignment scores below -X. Our results indicate that computing an optimal alignment under this constraint is very expensive. However, less rigorous conditions on the alignment can be guaranteed by quite efficient algorithms. One of these variants has been implemented in a new release of the Blast suite of database search programs.

    Original languageEnglish (US)
    Pages294-301
    Number of pages8
    StatePublished - Jan 1 1998
    EventProceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology - New York, NY, USA
    Duration: Mar 22 1998Mar 25 1998

    Other

    OtherProceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology
    CityNew York, NY, USA
    Period3/22/983/25/98

    Fingerprint

    Databases
    benzoylprop-ethyl

    All Science Journal Classification (ASJC) codes

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)

    Cite this

    Zhang, Z., Berman, P., & Miller, W. (1998). Alignments without low-scoring regions. 294-301. Paper presented at Proceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology, New York, NY, USA, .
    Zhang, Zheng ; Berman, Piotr ; Miller, Webb. / Alignments without low-scoring regions. Paper presented at Proceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology, New York, NY, USA, .8 p.
    @conference{92edf09ee85948dfab93aaf0ef15c9d3,
    title = "Alignments without low-scoring regions",
    abstract = "Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching beyond the point that a useful extension of the alignment is likely to be found. Without loss of generality, we can restrict attention to the suffixes of the sequences that follow the strong match, which leads to the following formal problem. Given two sequences and a fixed X>0, align initial portions of the sequences subject to the constraint that no section of the alignment scores below -X. Our results indicate that computing an optimal alignment under this constraint is very expensive. However, less rigorous conditions on the alignment can be guaranteed by quite efficient algorithms. One of these variants has been implemented in a new release of the Blast suite of database search programs.",
    author = "Zheng Zhang and Piotr Berman and Webb Miller",
    year = "1998",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "294--301",
    note = "Proceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology ; Conference date: 22-03-1998 Through 25-03-1998",

    }

    Zhang, Z, Berman, P & Miller, W 1998, 'Alignments without low-scoring regions', Paper presented at Proceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology, New York, NY, USA, 3/22/98 - 3/25/98 pp. 294-301.

    Alignments without low-scoring regions. / Zhang, Zheng; Berman, Piotr; Miller, Webb.

    1998. 294-301 Paper presented at Proceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology, New York, NY, USA, .

    Research output: Contribution to conferencePaper

    TY - CONF

    T1 - Alignments without low-scoring regions

    AU - Zhang, Zheng

    AU - Berman, Piotr

    AU - Miller, Webb

    PY - 1998/1/1

    Y1 - 1998/1/1

    N2 - Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching beyond the point that a useful extension of the alignment is likely to be found. Without loss of generality, we can restrict attention to the suffixes of the sequences that follow the strong match, which leads to the following formal problem. Given two sequences and a fixed X>0, align initial portions of the sequences subject to the constraint that no section of the alignment scores below -X. Our results indicate that computing an optimal alignment under this constraint is very expensive. However, less rigorous conditions on the alignment can be guaranteed by quite efficient algorithms. One of these variants has been implemented in a new release of the Blast suite of database search programs.

    AB - Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching beyond the point that a useful extension of the alignment is likely to be found. Without loss of generality, we can restrict attention to the suffixes of the sequences that follow the strong match, which leads to the following formal problem. Given two sequences and a fixed X>0, align initial portions of the sequences subject to the constraint that no section of the alignment scores below -X. Our results indicate that computing an optimal alignment under this constraint is very expensive. However, less rigorous conditions on the alignment can be guaranteed by quite efficient algorithms. One of these variants has been implemented in a new release of the Blast suite of database search programs.

    UR - http://www.scopus.com/inward/record.url?scp=0031651584&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0031651584&partnerID=8YFLogxK

    M3 - Paper

    AN - SCOPUS:0031651584

    SP - 294

    EP - 301

    ER -

    Zhang Z, Berman P, Miller W. Alignments without low-scoring regions. 1998. Paper presented at Proceedings of the 1998 2nd Annual International Conference on Computational Molecular Biology, New York, NY, USA, .