Bioinformatics, Vol 15, 278-285, Copyright © 1999 by Oxford University Press
E Harley, A Bonner and N Goodman
MOTIVATION: STS-content data for genomic mapping contain numerous errors
and anomalies resulting in cross-links among distant regions of the genome.
Identification of contigs within the data is an important and difficult
problem. RESULTS: This paper introduces a graph algorithm which creates a
simplified view of STS-content data. The shape of the resulting structure
graph provides a quality check - coherent data produce a straight line,
while anomalous data produce branches and loops. In the latter case, it is
sometimes possible to disentangle the various paths into subsets of the
data covering contiguous regions of the genome, i.e. contigs. These
straight subgraphs can then be analyzed in standard ways to construct a
physical map. A theoretical basis for the method is presented along with
examples of its application to current STS data from human genome centers.
AVAILABILITY: Freely available on request.
ARTICLES
Revealing hidden interval graph structure in STS-content data
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A4. eharley@cs.toronto.edu
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
I. V. Yap, D. Schneider, J. Kleinberg, D. Matthews, S. Cartinhour, and S. R. McCouch A Graph-Theoretic Approach to Comparing and Integrating Genetic, Physical and Sequence-Based Maps Genetics, December 1, 2003; 165(4): 2235 - 2247. [Abstract] [Full Text] [PDF] |
||||
