Browse
Submit Data
Databases
API
Help

Dataset Information

6 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

DARTS: An Algorithm for Domain-Associated Retrotransposon Search in Genome Assemblies.

ABSTRACT: Retrotransposons comprise a substantial fraction of eukaryotic genomes, reaching the highest proportions in plants. Therefore, identification and annotation of retrotransposons is an important task in studying the regulation and evolution of plant genomes. The majority of computational tools for mining transposable elements (TEs) are designed for subsequent genome repeat masking, often leaving aside the element lineage classification and its protein domain composition. Additionally, studies focused on the diversity and evolution of a particular group of retrotransposons often require substantial customization efforts from researchers to adapt existing software to their needs. Here, we developed a computational pipeline to mine sequences of protein-coding retrotransposons based on the sequences of their conserved protein domains-DARTS (Domain-Associated Retrotransposon Search). Using the most abundant group of TEs in plants-long terminal repeat (LTR) retrotransposons (LTR-RTs)-we show that DARTS has radically higher sensitivity for LTR-RT identification compared to the widely accepted tool LTRharvest. DARTS can be easily customized for specific user needs. As a result, DARTS returns a set of structurally annotated nucleotide and amino acid sequences which can be readily used in subsequent comparative and phylogenetic analyses. DARTS may facilitate researchers interested in the discovery and detailed analysis of the diversity and evolution of retrotransposons, LTR-RTs, and other protein-coding TEs.

SUBMITTER: Biryukov M

PROVIDER: S-EPMC8775202 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

An alignment-free domain architecture similarity search (ADASS) algorithm for inferring homology between multi-domain proteins.

Project description:Annotations of the genes and their products are largely guided by inferring homology. Sequence similarity is the primary measure used for annotation purpose however, the domain content and order were given less importance albeit the fact that domain insertion, deletion, positional changes can bring in functional varieties. Of late, several methods developed quantify domain architecture similarity depending on alignments of their sequences and are focused on only homologous proteins. We present an alignment-free domain architecture-similarity search (ADASS) algorithm that identifies proteins that share very poor sequence similarity yet having similar domain architectures. We introduce a "singlet matching-triplet comparison" method in ADASS, wherein triplet of domains is compared with other triplets in a pair-wise comparison of two domain architectures. Different events in the triplet comparison are scored as per a scoring scheme and an average pairwise distance score (Domain Architecture Distance score - DAD Score) is calculated between protein domains architectures. We use domain architectures of a selected domain termed as centric domain and cluster them based on DAD score. The algorithm has high Positive Prediction Value (PPV) with respect to the clustering of the sequences of selected domain architectures. A comparison of domain architecture based dendrograms using ADASS method and an existing method revealed that ADASS can classify proteins depending on the extent of domain architecture level similarity. ADASS is more relevant in cases of proteins with tiny domains having little contribution to the overall sequence similarity but contributing significantly to the overall function.

| S-EPMC3705623 | biostudies-literature

Multi-membrane search algorithm.

Project description:This research proposes a new multi-membrane search algorithm (MSA) based on cell biological behavior. Cell secretion protein behavior and cell division and fusion strategy are the main inspirations for the algorithm. In order to verify the performance of the algorithm, we used 19 benchmark functions to compare the MSA test results with MVO, GWO, MFO and ALO. The number of iterations of each algorithm on each benchmark function is 100, the population number is 10, and the running is repeated 50 times, and the average and standard deviation of the results are recorded. Tests show that the MSA is competitive in unimodal benchmark functions and multi-modal benchmark functions, and the results in composite benchmark functions are all superior to MVO, MFO, ALO, and GWO algorithms. This paper also uses MSA to solve two classic engineering problems: welded beam design and pressure vessel design. The result of welded beam design is 1.7252, and the result of pressure vessel design is 5887.7052, which is better than other comparison algorithms. Statistical experiments show that MSA is a high-performance algorithm that is competitive in unimodal and multimodal functions, and its performance in compound functions is significantly better than MVO, MFO, ALO, and GWO algorithms.

| S-EPMC8648127 | biostudies-literature

MetaBAT 2: an adaptive binning algorithm for robust and efficient genome reconstruction from metagenome assemblies.

Project description:We previously reported on MetaBAT, an automated metagenome binning software tool to reconstruct single genomes from microbial communities for subsequent analyses of uncultivated microbial species. MetaBAT has become one of the most popular binning tools largely due to its computational efficiency and ease of use, especially in binning experiments with a large number of samples and a large assembly. MetaBAT requires users to choose parameters to fine-tune its sensitivity and specificity. If those parameters are not chosen properly, binning accuracy can suffer, especially on assemblies of poor quality. Here, we developed MetaBAT 2 to overcome this problem. MetaBAT 2 uses a new adaptive binning algorithm to eliminate manual parameter tuning. We also performed extensive software engineering optimization to increase both computational and memory efficiency. Comparing MetaBAT 2 to alternative software tools on over 100 real world metagenome assemblies shows superior accuracy and computing speed. Binning a typical metagenome assembly takes only a few minutes on a single commodity workstation. We therefore recommend the community adopts MetaBAT 2 for their metagenome binning experiments. MetaBAT 2 is open source software and available at https://bitbucket.org/berkeleylab/metabat.

| S-EPMC6662567 | biostudies-literature

Meiotic Cells Counteract Programmed Retrotransposon Activation via RNA-Binding Translational Repressor Assemblies.

Project description:Retrotransposon proliferation poses a threat to germline integrity. While retrotransposons must be activated in developing germ cells in order to survive and propagate, how they are selectively activated in the context of meiosis is unclear. We demonstrate that the transcriptional activation of Ty3/Gypsy retrotransposons and host defense are controlled by master meiotic regulators. We show that budding yeast Ty3/Gypsy co-opts binding sites of the essential meiotic transcription factor Ndt80 upstream of the integration site, thereby tightly linking its transcriptional activation to meiotic progression. We also elucidate how yeast cells thwart Ty3/Gypsy proliferation by blocking translation of the retrotransposon mRNA using amyloid-like assemblies of the RNA-binding protein Rim4. In mammals, several inactive Ty3/Gypsy elements are undergoing domestication. We show that mammals utilize equivalent master meiotic regulators (Stra8, Mybl1, Dazl) to regulate Ty3/Gypsy-derived genes in developing gametes. Our findings inform how genes that are evolving from retrotransposons can build upon existing regulatory networks during domestication.

| S-EPMC7116619 | biostudies-literature

Computational and experimental analyses of retrotransposon-associated minisatellite DNAs in the soybean genome.

Project description:BACKGROUND: Retrotransposons are mobile DNA elements that spread through genomes via the action of element-encoded reverse transcriptases. They are ubiquitous constituents of most eukaryotic genomes, especially those of higher plants. The pericentromeric regions of soybean (Glycine max) chromosomes contain >3,200 intact copies of the Gmr9/GmOgre retrotransposon. Between the 3' end of the coding region and the long terminal repeat, this retrotransposon family contains a polymorphic minisatellite region composed of five distinct, interleaved minisatellite families. To better understand the possible role and origin of retrotransposon-associated minisatellites, a computational project to map and physically characterize all members of these families in the G. max genome, irrespective of their association with Gmr9, was undertaken. METHODS: A computational pipeline was developed to map and analyze the organization and distribution of five Gmr9-associated minisatellites throughout the soybean genome. Polymerase chain reaction amplifications were used to experimentally assess the computational outputs. RESULTS: A total of 63,841 copies of Gmr9-associated minisatellites were recovered from the assembled G. max genome. Ninety percent were associated with Gmr9, an additional 9% with other annotated retrotransposons, and 1% with uncharacterized repetitive DNAs. Monomers were tandemly interleaved and repeated up to 149 times per locus. CONCLUSIONS: The computational pipeline enabled a fast, accurate, and detailed characterization of known minisatellites in a large, downloaded DNA database, and PCR amplification supported the general organization of these arrays.

| S-EPMC3305785 | biostudies-other

Niche harmony search algorithm for detecting complex disease associated high-order SNP combinations.

Project description:Genome-wide association study is especially challenging in detecting high-order disease-causing models due to model diversity, possible low or even no marginal effect of the model, and extraordinary search and computations. In this paper, we propose a niche harmony search algorithm where joint entropy is utilized as a heuristic factor to guide the search for low or no marginal effect model, and two computationally lightweight scores are selected to evaluate and adapt to diverse of disease models. In order to obtain all possible suspected pathogenic models, niche technique merges with HS, which serves as a taboo region to avoid HS trapping into local search. From the resultant set of candidate SNP-combinations, we use G-test statistic for testing true positives. Experiments were performed on twenty typical simulation datasets in which 12 models are with marginal effect and eight ones are with no marginal effect. Our results indicate that the proposed algorithm has very high detection power for searching suspected disease models in the first stage and it is superior to some typical existing approaches in both detection power and CPU runtime for all these datasets. Application to age-related macular degeneration (AMD) demonstrates our method is promising in detecting high-order disease-causing models.

| S-EPMC5599559 | biostudies-literature

Systematic search for putative new domain families in Mycoplasma gallisepticum genome.

Project description:BackgroundProtein domains are the fundamental units of protein structure, function and evolution. The delineation of different domains in proteins is important for classification, understanding of structure, function and evolution. The delineation of protein domains within a polypeptide chain, namely at the genome scale, can be achieved in several ways but may remain problematic in many instances. Difficulties in identifying the domain content of a given sequence arise when the query sequence has no homologues with experimentally determined structure and searching against sequence domain databases also results in insignificant matches. Identification of domains under low sequence identity conditions and lack of structural homologues acquire a crucial importance especially at the genomic scale.FindingsWe have developed a new method for the identification of domains in unassigned regions through indirect connections and scaled up its application to the analysis of 434 unassigned regions in 726 protein sequences of Mycoplasma gallisepticum genome. We could establish 71 new domain relationships and probable 63 putative new domain families through intermediate sequences in the unassigned regions, which importantly represent an overall 10% increase in PfamA domain annotation over the direct assignment in this genome.ConclusionsThe systematic analysis of the unassigned regions in the Mycoplasma gallisepticum genome has provided some insight into the possible new domain relationships and putative new domain families. Further investigation of these predicted new domains may prove beneficial in improving the existing domain prediction algorithms.

| S-EPMC2865477 | biostudies-literature

Genome-Wide Search for SNP Interactions in GWAS Data: Algorithm, Feasibility, Replication Using Schizophrenia Datasets.

Project description:In this study, we looked for potential gene-gene interaction in susceptibility to schizophrenia by an exhaustive searching for SNP-SNP interactions in 3 GWAS datasets (phs000021:phg000013, phs000021:phg000014, phs000167) using our recently published algorithm. The search space for SNP-SNP interaction was confined to 8 biologically plausible ways of interaction under dominant-dominant or recessive-recessive modes. First, we performed our search of all pair-wise combination of 729,454 SNPs after filtering by SNP genotype quality. All possible pairwise interactions of any 2 SNPs (5 × 1011) were exhausted to search for significant interaction which was defined by p-value of chi-square tests. Nine out the top 10 interactions, protein coding genes were partnered with non-coding RNA (ncRNA) which suggested a new alternative insight into interaction biology other than the frequently sought-after protein-protein interaction. Therefore, we extended to look for replication among the top 10,000 interaction SNP pairs and high proportion of concurrent genes forming the interaction pairs were found. The results indicated that an enrichment of signals over noise was present in the top 10,000 interactions. Then, replications of SNP-SNP interaction were confirmed for 14 SNPs-pairs in both replication datasets. Biological insight was highlighted by a potential binding between FHIT (protein coding gene) and LINC00969 (lncRNA) which showed a replicable interaction between their SNPs. Both of them were reported to have expression in brain. Our study represented an early attempt of exhaustive interaction analysis of GWAS data which also yield replicated interaction and new insight into understanding of genetic interaction in schizophrenia.

| S-EPMC7505102 | biostudies-literature

FHSA-SED: Two-Locus Model Detection for Genome-Wide Association Study with Harmony Search Algorithm.

Project description:MOTIVATION:Two-locus model is a typical significant disease model to be identified in genome-wide association study (GWAS). Due to intensive computational burden and diversity of disease models, existing methods have drawbacks on low detection power, high computation cost, and preference for some types of disease models. METHOD:In this study, two scoring functions (Bayesian network based K2-score and Gini-score) are used for characterizing two SNP locus as a candidate model, the two criteria are adopted simultaneously for improving identification power and tackling the preference problem to disease models. Harmony search algorithm (HSA) is improved for quickly finding the most likely candidate models among all two-locus models, in which a local search algorithm with two-dimensional tabu table is presented to avoid repeatedly evaluating some disease models that have strong marginal effect. Finally G-test statistic is used to further test the candidate models. RESULTS:We investigate our method named FHSA-SED on 82 simulated datasets and a real AMD dataset, and compare it with two typical methods (MACOED and CSE) which have been developed recently based on swarm intelligent search algorithm. The results of simulation experiments indicate that our method outperforms the two compared algorithms in terms of detection power, computation time, evaluation times, sensitivity (TPR), specificity (SPC), positive predictive value (PPV) and accuracy (ACC). Our method has identified two SNPs (rs3775652 and rs10511467) that may be also associated with disease in AMD dataset.

| S-EPMC4807955 | biostudies-literature

Retrotransposon overdose and genome integrity.

Project description:Yeast and mammalian genomes are replete with nearly identical copies of long dispersed repeats in the form of retrotransposons. Mechanisms clearly exist to maintain genome structure in the face of potential rearrangement between the dispersed repeats, but the nature of this machinery is poorly understood. Here we describe a series of distinct "retrotransposon overdose" (RO) lineages in which the number of Ty1 elements in the Saccharomyces cerevisiae genome has been increased by as much as 10 fold. Although these RO strains are remarkably normal in growth rate, they demonstrate an intrinsic supersensitivity to DNA-damaging agents. We describe the identification of mutants in the DNA replication pathway that enhance this RO-specific DNA damage supersensitivity by promoting ectopic recombination between Ty1 elements. Abrogation of normal DNA replication leads to rampant genome instability primarily in the form of chromosomal aberrations and confirms the central role of DNA replication accuracy in the stabilization of repetitive DNA.

| S-EPMC2728997 | biostudies-literature

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