Browse
Submit Data
Databases
API
Help

Dataset Information

30 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

MDAT- Aligning multiple domain arrangements.

ABSTRACT: BACKGROUND: Proteins are composed of domains, protein segments that fold independently from the rest of the protein and have a specific function. During evolution the arrangement of domains can change: domains are gained, lost or their order is rearranged. To facilitate the analysis of these changes we propose the use of multiple domain alignments. RESULTS: We developed an alignment program, called MDAT, which aligns multiple domain arrangements. MDAT extends earlier programs which perform pairwise alignments of domain arrangements. MDAT uses a domain similarity matrix to score domain pairs and aligns the domain arrangements using a consistency supported progressive alignment method. CONCLUSION: MDAT will be useful for analysing changes in domain arrangements within and between protein families and will thus provide valuable insights into the evolution of proteins and their domains. MDAT is coded in C++, and the source code is freely available for download at http://www.bornberglab.org/pages/mdat .

SUBMITTER: Kemena C

PROVIDER: S-EPMC4384290 | biostudies-literature | 2015

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

MDAT- Aligning multiple domain arrangements.

Kemena Carsten C Bitard-Feildel Tristan T Bornberg-Bauer Erich E

BMC bioinformatics 20150128

<h4>Background</h4>Proteins are composed of domains, protein segments that fold independently from the rest of the protein and have a specific function. During evolution the arrangement of domains can change: domains are gained, lost or their order is rearranged. To facilitate the analysis of these changes we propose the use of multiple domain alignments.<h4>Results</h4>We developed an alignment program, called MDAT, which aligns multiple domain arrangements. MDAT extends earlier programs which ...[more]

PMID: 25626688

Similar Datasets

CORAL: aligning conserved core regions across domain families.

Project description:Homologous protein families share highly conserved sequence and structure regions that are frequent targets for comparative analysis of related proteins and families. Many protein families, such as the curated domain families in the Conserved Domain Database (CDD), exhibit similar structural cores. To improve accuracy in aligning such protein families, we propose a profile-profile method CORAL that aligns individual core regions as gap-free units.CORAL computes optimal local alignment of two profiles with heuristics to preserve continuity within core regions. We benchmarked its performance on curated domains in CDD, which have pre-defined core regions, against COMPASS, HHalign and PSI-BLAST, using structure superpositions and comprehensive curator-optimized alignments as standards of truth. CORAL improves alignment accuracy on core regions over general profile methods, returning a balanced score of 0.57 for over 80% of all domain families in CDD, compared with the highest balanced score of 0.45 from other methods. Further, CORAL provides E-values to aid in detecting homologous protein families and, by respecting block boundaries, produces alignments with improved 'readability' that facilitate manual refinement.CORAL will be included in future versions of the NCBI Cn3D/CDTree software, which can be downloaded at http://www.ncbi.nlm.nih.gov/Structure/cdtree/cdtree.shtml.Supplementary data are available at Bioinformatics online.

| S-EPMC2712342 | biostudies-literature

Substrate Binding Specifically Modulates Domain Arrangements in Adenylate Kinase.

Project description:The enzyme adenylate kinase (ADK) features two substrate binding domains that undergo large-scale motions during catalysis. In the apo state, the enzyme preferentially adopts a globally open state with accessible binding sites. Binding of two substrate molecules (AMP + ATP or ADP + ADP) results in a closed domain conformation, allowing efficient phosphoryl-transfer catalysis. We employed molecular dynamics simulations to systematically investigate how the individual domain motions are modulated by the binding of substrates. Two-dimensional free-energy landscapes were calculated along the opening of the two flexible lid domains for apo and holo ADK as well as for all single natural substrates bound to one of the two binding sites of ADK. The simulations reveal a strong dependence of the conformational ensembles on type and binding position of the bound substrates and a nonsymmetric behavior of the lid domains. Altogether, the ensembles suggest that, upon initial substrate binding to the corresponding lid site, the opposing lid is maintained open and accessible for subsequent substrate binding. In contrast, ATP binding to the AMP-lid induces global domain closing, preventing further substrate binding to the ATP-lid site. This might constitute a mechanism by which the enzyme avoids the formation of a stable but enzymatically unproductive state.

| S-EPMC4643206 | biostudies-literature

Aligning multiple genomic sequences with the threaded blockset aligner.

Project description:We define a "threaded blockset," which is a novel generalization of the classic notion of a multiple alignment. A new computer program called TBA (for "threaded blockset aligner") builds a threaded blockset under the assumption that all matching segments occur in the same order and orientation in the given sequences; inversions and duplications are not addressed. TBA is designed to be appropriate for aligning many, but by no means all, megabase-sized regions of multiple mammalian genomes. The output of TBA can be projected onto any genome chosen as a reference, thus guaranteeing that different projections present consistent predictions of which genomic positions are orthologous. This capability is illustrated using a new visualization tool to view TBA-generated alignments of vertebrate Hox clusters from both the mammalian and fish perspectives. Experimental evaluation of alignment quality, using a program that simulates evolutionary change in genomic sequences, indicates that TBA is more accurate than earlier programs. To perform the dynamic-programming alignment step, TBA runs a stand-alone program called MULTIZ, which can be used to align highly rearranged or incompletely sequenced genomes. We describe our use of MULTIZ to produce the whole-genome multiple alignments at the Santa Cruz Genome Browser.

| S-EPMC383317 | biostudies-literature

Searching databases of conserved sequence regions by aligning protein multiple-alignments.

Project description:A general searching method for comparing multiple sequence alignments was developed to detect sequence relationships between conserved protein regions. Multiple alignments are treated as sequences of amino acid distributions and aligned by comparing pairs of such distributions. Four different comparison measures were tested and the Pearson correlation coefficient chosen. The method is sensitive, detecting weak sequence relationships between protein families. Relationships are detected beyond the range of conventional sequence database searches, illustrating the potential usefulness of the method. The previously undetected relation between flavoprotein subunits of two oxidoreductase families points to the potential active site in one of the families. The similarity between the bacterial RecA, DnaA and Rad51 protein families reveals a region in DnaA and Rad51 proteins likely to bind and unstack single-stranded DNA. Helix--turn--helix DNA binding domains from diverse proteins are readily detected and shown to be similar to each other. Glycosylasparaginase and gamma-glutamyltransferase enzymes are found to be similar in their proteolytic cleavage sites. The method has been fully implemented on the World Wide Web at URL: http://blocks.fhcrc.org/blocks-bin/LAMAvsearch.

| S-EPMC146152 | biostudies-other

Unstable and Multiple Child Care Arrangements and Young Children's Behavior.

Project description:Growing evidence suggests that child care instability is associated with child behavior problems, but existing studies confound different types of instability; use small, convenience samples; and/or control insufficiently for selection into child care arrangements. This study uses survey and calendar data from the Fragile Families and Child Well-Being Study to estimate the associations between three different types of child care instability-long-term instability, multiplicity, and the use of back-up arrangements-and children's internalizing, externalizing, and prosocial behaviors at age 3, controlling for a large number of child and family background characteristics. Long-term instability between birth and age 3, as measured in both the survey and calendar data, is associated with higher levels of externalizing behavior problems. Current multiplicity at age 3 (as measured by survey data) is associated with higher levels of both externalizing and internalizing behavior problems, but stable multiplicity over time (as measured using calendar data) is not. Finally, the use of back-up arrangements at age 3 is associated with higher levels of internalizing behaviors. We find no consistent differences in these results by the timing of instability, child gender, family income, or type of care.

| S-EPMC4307839 | biostudies-literature

Detecting transcriptomic structural variants in heterogeneous contexts via the Multiple Compatible Arrangements Problem.

Project description:Background:Transcriptomic structural variants (TSVs)-large-scale transcriptome sequence change due to structural variation - are common in cancer. TSV detection from high-throughput sequencing data is a computationally challenging problem. Among all the confounding factors, sample heterogeneity, where each sample contains multiple distinct alleles, poses a critical obstacle to accurate TSV prediction. Results:To improve TSV detection in heterogeneous RNA-seq samples, we introduce the Multiple Compatible Arrangements Problem (MCAP), which seeks k genome arrangements that maximize the number of reads that are concordant with at least one arrangement. This models a heterogeneous or diploid sample. We prove that MCAP is NP-complete and provide a 14 -approximation algorithm for k=1 and a 34 -approximation algorithm for the diploid case ( k=2 ) assuming an oracle for k=1 . Combining these, we obtain a 316 -approximation algorithm for MCAP when k=2 (without an oracle). We also present an integer linear programming formulation for general k. We characterize the conflict structures in the graph that require k>1 alleles to satisfy read concordancy and show that such structures are prevalent. Conclusions:We show that the solution to MCAP accurately addresses sample heterogeneity during TSV detection. Our algorithms have improved performance on TCGA cancer samples and cancer cell line samples compared to a TSV calling tool, SQUID. The software is available at https://github.com/Kingsford-Group/diploidsquid.

| S-EPMC7227063 | biostudies-literature

Salmonella genome arrangements

Project description:Impact of genome arrangement on Salmonella gene expression

| PRJEB52538 | ENA

Aligning evidence: concerns regarding multiple sequence alignments in estimating the phylogeny of the Nudibranchia suborder Doridina.

Project description:Molecular estimates of phylogenetic relationships rely heavily on multiple sequence alignment construction. There has been little consensus, however, on how to properly address issues pertaining to the alignment of variable regions. Here, we construct alignments from four commonly sequenced molecular markers (16S, 18S, 28S and cytochrome c oxidase subunit I) for the Nudibranchia using three different methodologies: (i) strict mathematical algorithm; (ii) exclusion of variable or divergent regions and (iii) manually curated, and examine how different alignment construction methods can affect phylogenetic signal and phylogenetic estimates for the suborder Doridina. Phylogenetic informativeness (PI) profiles suggest that the molecular markers tested lack the power to resolve relationships at the base of the Doridina, while being more robust at family-level classifications. This supports the lack of consistent resolution between the 19 families within the Doridina across all three alignments. Most of the 19 families were recovered as monophyletic, and instances of non-monophyletic families were consistently recovered between analyses. We conclude that the alignment of variable regions has some effect on phylogenetic estimates of the Doridina, but these effects can vary depending on the size and scope of the phylogenetic query and PI of molecular markers.

| S-EPMC5666284 | biostudies-literature

MM-align: a quick algorithm for aligning multiple-chain protein complex structures using iterative dynamic programming.

Project description:Structural comparison of multiple-chain protein complexes is essential in many studies of protein-protein interactions. We develop a new algorithm, MM-align, for sequence-independent alignment of protein complex structures. The algorithm is built on a heuristic iteration of a modified Needleman-Wunsch dynamic programming (DP) algorithm, with the alignment score specified by the inter-complex residue distances. The multiple chains in each complex are first joined, in every possible order, and then simultaneously aligned with cross-chain alignments prevented. The alignments of interface residues are enhanced by an interface-specific weighting factor. MM-align is tested on a large-scale benchmark set of 205 x 3897 non-homologous multiple-chain complex pairs. Compared with a naïve extension of the monomer alignment program of TM-align, the alignment accuracy of MM-align is significantly higher as judged by the average TM-score of the physically-aligned residues. MM-align is about two times faster than TM-align because of omitting the cross-alignment zone of the DP matrix. It also shows that the enhanced alignment of the interfaces helps in identifying biologically relevant protein complex pairs.

| S-EPMC2699532 | biostudies-literature

SPARK-MSNA: Efficient algorithm on Apache Spark for aligning multiple similar DNA/RNA sequences with supervised learning.

Project description:Multiple sequence alignment (MSA) is an integral part of molecular biology. But handling massive number of large sequences is still a bottleneck for most of the state-of-the-art software tools. Knowledge driven algorithms utilizing features of input sequences, such as high similarity in case of DNA sequences, can help in improving the efficiency of DNA MSA to assist in phylogenetic tree construction, comparative genomics etc. This article showcases the benefit of utilizing similarity features while performing the alignment. The algorithm uses suffix tree for identifying common substrings and uses a modified Needleman-Wunsch algorithm for pairwise alignments. In order to improve the efficiency of pairwise alignments, a knowledge base is created and a supervised learning with nearest neighbor algorithm is used to guide the alignment. The algorithm provided linear complexity O(m) compared to O(m2). Comparing with state-of-the-art algorithms (e.g., HAlign II), SPARK-MSNA provided 50% improvement in memory utilization in processing human mitochondrial genome (mt. genomes, 100x, 1.1. GB) with a better alignment accuracy in terms of average SP score and comparable execution time. The algorithm is implemented on big data framework Apache Spark in order to improve the scalability. The source code & test data are available at: https://sourceforge.net/projects/spark-msna/ .

| S-EPMC6488671 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data