skip to main content
10.1145/967900.968108acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Evolutionary segmentation of yeast genome

Published:14 March 2004Publication History

ABSTRACT

Segmentation algorithms differ from clustering algorithms with regard to how to deal with the physical location of genes throughout the sequence. Therefore, segments have to keep the original positions of consecutive genes, which is not a constraint for clustering algorithms. It has been proven that exist functional relations among neighbour-genes, so the localization of the boundaries between these functionally similar groups of genes has turned out an important challenge. In this paper, we present an evolutionary algorithm to segment the yeast genome.

References

  1. Bradnam KR, Seoighe C, Sharp PM, Wolfe KH. 1999. G+C content variation along and among Saccharomyces cerevisiae chromosomes. Mol Biol Evol16: 666--675Google ScholarGoogle Scholar
  2. Kruglyak S, Tang H. 2000. Regulation of adjacent yeast genes. Trends Genet16: 109--111.Google ScholarGoogle Scholar
  3. Li W, Bernaola-Galva P, Haghighi F, Grosse I. 2002. Applications of recursive segmentation to the analysis of DNA sequences. Computers & Chemistry (genome and informatics special issue), 26(5): 491--510.Google ScholarGoogle Scholar
  4. Li W. 2001. New stopping criteria for segmenting DNA sequences. Physical Review Letters, 86(25): 5815--5818.Google ScholarGoogle ScholarCross RefCross Ref
  5. Li W. 2001. DNA segmentation as a model selection process. RECOMB01: Proceedings of the Fifth Annual International Conference on Computational Biology, pp. 204--210. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Evolutionary segmentation of yeast genome

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '04: Proceedings of the 2004 ACM symposium on Applied computing
      March 2004
      1733 pages
      ISBN:1581138121
      DOI:10.1145/967900

      Copyright © 2004 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 14 March 2004

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate1,650of6,669submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader