Open Access. Powered by Scholars. Published by Universities.®

Life Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Life Sciences

Draft Genome Sequences Of Three Monokaryotic Isolates Of The White-Rot Basidiomycete Fungus Dichomitus Squalens, Sara Casado López, Mao Peng, Paul Daly, Bill Andreopoulos, Jasmyn Pangilinan, Anna Lipzen, Robert Riley, Steven Ahrendt, Vivian Ng, Kerrie Barry, Chris Daum, Igor Grigoriev, Kristiina Hildén, Miia Mäkelä, Ronald De Vries May 2019

Draft Genome Sequences Of Three Monokaryotic Isolates Of The White-Rot Basidiomycete Fungus Dichomitus Squalens, Sara Casado López, Mao Peng, Paul Daly, Bill Andreopoulos, Jasmyn Pangilinan, Anna Lipzen, Robert Riley, Steven Ahrendt, Vivian Ng, Kerrie Barry, Chris Daum, Igor Grigoriev, Kristiina Hildén, Miia Mäkelä, Ronald De Vries

Faculty Publications, Computer Science

Here, we report the draft genome sequences of three isolates of the wood-decaying white-rot basidiomycete fungus Dichomitus squalens. The genomes of these monokaryons were sequenced to provide more information on the intraspecies genomic diversity of this fungus and were compared to the previously sequenced genome of D. squalens LYAD-421 SS1.


Efficient Unfolding Pattern Recognition In Single Molecule Force Spectroscopy Data, Bill Andreopoulos, Dirk Labudde Jun 2011

Efficient Unfolding Pattern Recognition In Single Molecule Force Spectroscopy Data, Bill Andreopoulos, Dirk Labudde

Faculty Publications, Computer Science

BackgroundSingle-molecule force spectroscopy (SMFS) is a technique that measures the force necessary to unfold a protein. SMFS experiments generate Force-Distance (F-D) curves. A statistical analysis of a set of F-D curves reveals different unfolding pathways. Information on protein structure, conformation, functional states, and inter- and intra-molecular interactions can be derived.ResultsIn the present work, we propose a pattern recognition algorithm and apply our algorithm to datasets from SMFS experiments on the membrane protein bacterioRhodopsin (bR). We discuss the unfolding pathways found in bR, which are characterised by main peaks and side peaks. A main peak is the result of the pairwise …


Triangle Network Motifs Predict Complexes By Complementing High-Error Interactomes With Structural Information, Bill Andreopoulos, Christof Winter, Dirk Labudde, Michael Schroeder Jun 2009

Triangle Network Motifs Predict Complexes By Complementing High-Error Interactomes With Structural Information, Bill Andreopoulos, Christof Winter, Dirk Labudde, Michael Schroeder

Faculty Publications, Computer Science

BackgroundA lot of high-throughput studies produce protein-protein interaction networks (PPINs) with many errors and missing information. Even for genome-wide approaches, there is often a low overlap between PPINs produced by different studies. Second-level neighbors separated by two protein-protein interactions (PPIs) were previously used for predicting protein function and finding complexes in high-error PPINs. We retrieve second level neighbors in PPINs, and complement these with structural domain-domain interactions (SDDIs) representing binding evidence on proteins, forming PPI-SDDI-PPI triangles.ResultsWe find low overlap between PPINs, SDDIs and known complexes, all well below 10%. We evaluate the overlap of PPI-SDDI-PPI triangles with known complexes from …


Word Sense Disambiguation In Biomedical Ontologies With Term Co-Occurrence Analysis And Document Clustering, Bill Andreopoulos, Dimitra Alexopoulou, Michael Schroeder Sep 2008

Word Sense Disambiguation In Biomedical Ontologies With Term Co-Occurrence Analysis And Document Clustering, Bill Andreopoulos, Dimitra Alexopoulou, Michael Schroeder

Faculty Publications, Computer Science

With more and more genomes being sequenced, a lot of effort is devoted to their annotation with terms from controlled vocabularies such as the GeneOntology. Manual annotation based on relevant literature is tedious, but automation of this process is difficult. One particularly challenging problem is word sense disambiguation. Terms such as |development| can refer to developmental biology or to the more general sense. Here, we present two approaches to address this problem by using term co-occurrences and document clustering. To evaluate our method we defined a corpus of 331 documents on development and developmental biology. Term co-occurrence analysis achieves an …


Unraveling Protein Networks With Power Graph Analysis, Loïc Royer, Matthias Reimann, Bill Andreopoulos, Michael Schroeder Jul 2008

Unraveling Protein Networks With Power Graph Analysis, Loïc Royer, Matthias Reimann, Bill Andreopoulos, Michael Schroeder

Faculty Publications, Computer Science

Networks play a crucial role in computational biology, yet their analysis and representation is still an open problem. Power Graph Analysis is a lossless transformation of biological networks into a compact, less redundant representation, exploiting the abundance of cliques and bicliques as elementary topological motifs. We demonstrate with five examples the advantages of Power Graph Analysis. Investigating protein-protein interaction networks, we show how the catalytic subunits of the casein kinase II complex are distinguishable from the regulatory subunits, how interaction profiles and sequence phylogeny of SH3 domains correlate, and how false positive interactions among high-throughput interactions are spotted. Additionally, we …


Finding Molecular Complexes Through Multiple Layer Clustering Of Protein Interaction Networks, Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang Jan 2007

Finding Molecular Complexes Through Multiple Layer Clustering Of Protein Interaction Networks, Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang

Faculty Publications, Computer Science

Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without considering the layered structure of PINs. We propose the MULIC clustering algorithm that produces layered clusters. We applied MULIC to five PINs. Clusters correlate with known MIPS protein complexes. For example, a cluster of 79 proteins overlaps with a known complex of 88 proteins. Proteins in top cluster layers tend to be more representative of complexes than proteins in bottom layers. Lab work on finding unknown complexes or determining drug effects can be guided by top layer proteins.


Bi-Level Clustering Of Mixed Categorical And Numerical Biomedical Data, Bill Andreopoulos, Aijun An, Xiaogang Wang Jun 2006

Bi-Level Clustering Of Mixed Categorical And Numerical Biomedical Data, Bill Andreopoulos, Aijun An, Xiaogang Wang

Faculty Publications, Computer Science

Biomedical data sets often have mixed categorical and numerical types, where the former represent semantic information on the objects and the latter represent experimental results. We present the BILCOM algorithm for |Bi-Level Clustering of Mixed categorical and numerical data types|. BILCOM performs a pseudo-Bayesian process, where the prior is categorical clustering. BILCOM partitions biomedical data sets of mixed types, such as hepatitis, thyroid disease and yeast gene expression data with Gene Ontology annotations, more accurately than if using one type alone.