Sign In

Communications of the ACM

Communications of the ACM

The Biological Digital Library


View as: Print Mobile App ACM Digital Library Full Text (PDF) Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook

If the human genome is the book of life, then the data necessary to make sense of it is the library of life. Rather than a traditional library of books, it is a library of microbial, plant, and animal genomes, of 3D protein models, of experimental data, and literature. This information is digital by necessity; the time when all known gene sequences could be published on paper is over. The dozens of gigabytes of sequence and structure will likely never touch paper againit is truly a digital library. How should we deal with this enormous, heterogeneous mass of data? What tools will librarians need to curate it? Who will interpret the data, and how will they access it?

The accompanying figure shows some of the data types the Human Genome Project and its associated research programs are producing. On the traditional digital library side is MEDLINE, a comprehensive index of biomedical research abstracts. With nine million abstracts, carefully curated keywords and links to sequence and structure databases, it represents an immensely valuable research resource. We understand how to search in large textual databases, but within the biological digital library the information sources we can use for searching text are much richer.

GenBank, the primary repository for DNA sequences, represents a very different challenge to information retrieval. GenBank consists of over eight million DNA sequences of varying quality, from thousands of species, containing important genes and repetitive junk. Within the DNA are coded genes that, when translated, yield proteins, the cogs of the cellular machine. The bag-of-words model that is so successful in text retrieval fails for DNA and protein because symbol order is paramount, and matching must be robust in the presence of mutations. This necessitates a different set of techniques from those developed for text.

Another data type is structure; the 13,000 3D structures for proteins painstakingly determined in laboratories around the world are archived in the Protein Data Bank (PDB). Each structure contains hundreds of atom coordinates, and finding similar structures involves computationally expensive geometrical alignment. The assembly-line processes that have been so successful in producing sequences are only now being successfully applied to structure determination.

In addition to relationships between data of the same typecosine similarity and citations for text, alignment by dynamic programming for sequences, and geometric alignment for structuresthere are several kinds of explicit relationships between different data types. For example, links between MEDLINE abstracts and GenBank or PDB entries specify sequences discussed in a particular paper, or link a structure to a discussion of its interactions with other molecules. Other relationships include shared sequence motifs that indicate common function between protein sequences, or shared Medical Subject Heading (MESH) terms that indicate common subject matter in abstracts. This graph of relationships can be browsed at the National Center for Biotechnology Information's Entrez system at www.ncbi.nlm.nih.gov/Entrez. However, to go further we need new algorithms to explore this graph autonomously, and to discover new relationships not evident by eye.


As time goes on, more work in medicine will be done in the digital library rather than at the lab bench.


To understand how this graph can be used, consider three problems. The first problem involves finding relevant abstracts given a query. Once one relevant abstract has been identified, others can be identified using the entire graph of relationships rather than just cosine similarity. For example, two abstracts might be related via a shared sequence: in the figure, abstracts A and B are both linked to sequence Y, which implies they both discuss the same gene. A more distant relationship is one between abstracts A and C linked to sequences X and Z, respectively. X and Z are highly similar, which implies they discuss genes that are evolutionarily related, that is, that almost certainly have the same function in the cell.

A second problem, which is central in understanding the human genome, is annotating genes with their probable function. This information retrieval problem begins with a gene and looks for close abstracts in the graph of relationships. Distance is defined in terms of a variety of relationships, including ones that traverse multiple links. For example, sequence Y can be annotated using material from abstracts A, B, and C; C because of the relationship through sequence Z.

Third, determining whether two genes are evolutionarily related usually involves just aligning the sequences. The similarity of two sequences is often too low to classify them as related with certainty, but using other relationships between the twosay, shared terms in related MEDLINE abstractsit will be possible to gather additional evidence to support their relationship. Expressing these information retrieval problems as graph algorithms allows more powerful computations to detect distant relationships and uncover novel associations. We are evaluating ways to express relationships of different types within a consistent probabilistic framework. The graph thus becomes a probabilistic model, and many existing inference techniques are applicable.

Understanding the processes of life is important. As time goes on, more work in medicine will be done in the digital library rather than at the lab bench. Structuring and providing access to the biological digital library is thus crucial to the future of medicine and science. But in addition to its practical importance, it also represents an exciting challenge: to integrate information of very diverse kinds, and leverage the richness of relationships between sequence, structure, and literature.

Back to Top

Author

Craig Nevill-Manning (craig@nevill-manning.com) is an assistant professor in the Computer Science Department at Rutgers University, New Brunswick, NJ.

Back to Top

Footnotes

This work is supported by NSF CAREER grant IIS-9986085.

Back to Top

Figures

UF1Figure. Relationships between objects in the biological digital library.

Back to top


©2001 ACM  0002-0782/01/0500  $5.00

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. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.

The Digital Library is published by the Association for Computing Machinery. Copyright © 2001 ACM, Inc.


 

No entries found