Biomedical subjects

Inge Jonassen

Publications and source records attributed to Inge Jonassen.

5 recordsLinked to original sources

PubMed2003

Fast sequence clustering using a suffix array algorithm.

MOTIVATION: Efficient clustering is important for handling the large amount of available EST sequences. Most contemporary methods are based on some kind of all-against-all comparison, resulting in a quadratic time complexity. A different approach is needed to keep up with the rapid growth of EST data. RESULTS: A new, fast EST clustering algorithm is presented. Sub-quadratic time complexity is achieved by using an algorithm based on suffix arrays. A prototype implementation has been developed and run on a benchmark data set. The produced clusterings are validated by comparing them to clusterings produced by other methods, and the results are quite promising. AVAILABILITY: The source code for the prototype implementation is available under a GPL license from http://www.ii.uib.no/~ketil/bio/.

Algorithms↗

PubMed2002

New feature subset selection procedures for classification of expression profiles.

BACKGROUND: Methods for extracting useful information from the datasets produced by microarray experiments are at present of much interest. Here we present new methods for finding gene sets that are well suited for distinguishing experiment classes, such as healthy versus diseased tissues. Our methods are based on evaluating genes in pairs and evaluating how well a pair in combination distinguishes two experiment classes. We tested the ability of our pair-based methods to select gene sets that generalize the differences between experiment classes and compared the performance relative to two standard methods. To assess the ability to generalize class differences, we studied how well the gene sets we select are suited for learning a classifier. RESULTS: We show that the gene sets selected by our methods outperform the standard methods, in some cases by a large margin, in terms of cross-validation prediction accuracy of the learned classifier. We show that on two public datasets, accurate diagnoses can be made using only 15-30 genes. Our results have implications for how to select marker genes and how many gene measurements are needed for diagnostic purposes. CONCLUSION: When looking for differential expression between experiment classes, it may not be sufficient to look at each gene in a separate universe. Evaluating combinations of genes reveals interesting information that will not be discovered otherwise. Our results show that class prediction can be improved by taking advantage of this extra information.

Colon↗

PubMed2002

A fast top-down method for constructing reliable radiation hybrid frameworks.

MOTIVATION: Radiation Hybrid Mapping (RHM) is a technique used to order a set of markers on a genome and estimating physical distances between them. RHM provides information on marker placement independent from other methods such as sequencing, and can therefore be used for example in genome sequencing to help ordering contigs. A radiation hybrid framework can be constructed by choosing a set of markers so that the chromosome coverage is good and so that the markers can be ordered with high confidence. Automatically constructing RHM frameworks is a computationally challenging problem. RESULTS: We have developed a new method for constructing radiation hybrid frameworks. Given a relatively large set of markers for a chromosome, the algorithm aims to select an ordered subset that makes up a framework, and that contains as many markers as possible. The algorithm has a time complexity that is better than any of the existing methods that we are aware of. Furthermore, we propose a method for comparing if two frameworks are consistent, giving a visual presentation as well as quantitative measures of how well the two frameworks agree. Applying our method on marker sets from 22 human chromosomes and comparing the resulting frameworks with previously published frameworks, we demonstrate that our automatic method efficiently constructs frameworks with good coverage of each chromosome and with high degree of agreement on the marker ordering.

Algorithms↗

PubMed2002

Association of nucleotide patterns with gene function classes: application to human 3' untranslated sequences.

MOTIVATION: Gene expression is dependent on two main types of signals; one involving transcription factors which initiates gene transcription, and another which regulates the translation of a nascent mRNA. These post-transcriptional events play an important yet incompletely understood role in regulating gene expression and cellular behavior. Many of the identified cis acting elements for translational regulation occur within the 3'untranslated region (3' UTR), and some have been observed to occur with surprising regularity within certain protein function classes. RESULTS: In this study, we present a new association rule mining method for discovering nucleotide sequence patterns that appear in more sequences than expected within protein function classes. The method is applied to a database of human 3' UTR sequences, and some significant associations between nucleotide patterns and protein function classes are discovered. Among previously identified patterns, the AU-Rich Element (ARE) is found here to occur within the 3' UTR of cytokines, providing statistical validation of an association often reported in the literature. The method has also identified some GC-rich patterns, found to occur within the 3' UTR of homeodomain transcription factors and nuclear proteins. The method should be applicable to many types of regulatory element discovery.

3' Untranslated Regions↗

PubMed2002

Structure motif discovery and mining the PDB.

MOTIVATION: Many of the most interesting functional and evolutionary relationships among proteins are so ancient that they cannot be reliably detected through sequence analysis and are apparent only through a comparison of the tertiary structures. The conserved features can often be described as structural motifs consisting of a few single residues or Secondary Structure (SS) elements. Confidence in such motifs is greatly boosted when they are found in more than a pair of proteins. RESULTS: We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the protein's backbone that come close together in the structure and whose spatial conformations are similar. The residues in a pattern need not be close in the protein's sequence. The work described in this paper builds on an earlier reported algorithm for motif discovery. This paper describes a significant improvement of the algorithm which makes it very efficient. The improved efficiency allows us to use it for doing unsupervised learning of patterns occurring in small subsets in a large set of structures, a non-redundant subset of the Protein Data Bank (PDB) database of all known protein structures.

Algorithms↗