scholarly journals MAGIC Database and Interfaces: An Integrated Package for Gene Discovery and Expression

2004 ◽  
Vol 5 (3) ◽  
pp. 268-275 ◽  
Author(s):  
Marie-Michèle Cordonnier-Pratt ◽  
Chun Liang ◽  
Haiming Wang ◽  
Dmitri S. Kolychev ◽  
Feng Sun ◽  
...  
Keyword(s):  
Dna Sequences ◽  
Relational Databases ◽  
Gene Discovery ◽  
Biological Data ◽  
Single Nucleotide Polymorphism Discovery ◽  
Web Browser ◽  
Polymorphism Discovery ◽  
Est Clustering ◽  
Database Administration ◽  
Core Facilities

The rapidly increasing rate at which biological data is being produced requires a corresponding growth in relational databases and associated tools that can help laboratories contend with that data. With this need in mind, we describe here a Modular Approach to a Genomic, Integrated and Comprehensive (MAGIC) Database. This Oracle 9i database derives from an initial focus in our laboratory on gene discovery via production and analysis of expressed sequence tags (ESTs), and subsequently on gene expression as assessed by both EST clustering and microarrays. The MAGIC Gene Discovery portion of the database focuses on information derived from DNA sequences and on its biological relevance. In addition to MAGIC SEQ-LIMS, which is designed to support activities in the laboratory, it contains several additional subschemas. The latter include MAGIC Admin for database administration, MAGIC Sequence for sequence processing as well as sequence and clone attributes, MAGIC Cluster for the results of EST clustering, MAGIC Polymorphism in support of microsatellite and single-nucleotide-polymorphism discovery, and MAGIC Annotation for electronic annotation by BLAST and BLAT. The MAGIC Microarray portion is a MIAME-compliant database with two components at present. These are MAGIC Array-LIMS, which makes possible remote entry of all information into the database, and MAGIC Array Analysis, which provides data mining and visualization. Because all aspects of interaction with the MAGIC Database are via a web browser, it is ideally suited not only for individual research laboratories but also for core facilities that serve clients at any distance.

scholarly journals Applying graph database technology for analyzing perturbed co-expression networks in cancer

Database ◽  
2020 ◽  
Vol 2020 ◽  
Author(s):  
Claire M Simpson ◽  
Florian Gnad
Keyword(s):  
Relational Databases ◽  
Molecular Mechanisms ◽  
Biological Data ◽  
Database Management System ◽  
Graph Database ◽  
Graph Databases ◽  
Graph Representations ◽  
Rnaseq Data ◽  
Database Technology ◽  
Speed Accuracy

Abstract Graph representations provide an elegant solution to capture and analyze complex molecular mechanisms in the cell. Co-expression networks are undirected graph representations of transcriptional co-behavior indicating (co-)regulations, functional modules or even physical interactions between the corresponding gene products. The growing avalanche of available RNA sequencing (RNAseq) data fuels the construction of such networks, which are usually stored in relational databases like most other biological data. Inferring linkage by recursive multiple-join statements, however, is computationally expensive and complex to design in relational databases. In contrast, graph databases store and represent complex interconnected data as nodes, edges and properties, making it fast and intuitive to query and analyze relationships. While graph-based database technologies are on their way from a fringe domain to going mainstream, there are only a few studies reporting their application to biological data. We used the graph database management system Neo4j to store and analyze co-expression networks derived from RNAseq data from The Cancer Genome Atlas. Comparing co-expression in tumors versus healthy tissues in six cancer types revealed significant perturbation tracing back to erroneous or rewired gene regulation. Applying centrality, community detection and pathfinding graph algorithms uncovered the destruction or creation of central nodes, modules and relationships in co-expression networks of tumors. Given the speed, accuracy and straightforwardness of managing these densely connected networks, we conclude that graph databases are ready for entering the arena of biological data.

scholarly journals Single Nucleotide Polymorphism Discovery and Genetic Differentiation Analysis of Geese Bred in Poland, Using Genotyping-by-Sequencing (GBS)

Genes ◽  
2021 ◽  
Vol 12 (7) ◽  
pp. 1074
Author(s):  
Joanna Grzegorczyk ◽  
Artur Gurgul ◽  
Maria Oczkowicz ◽  
Tomasz Szmatoła ◽  
Agnieszka Fornal ◽  
...  
Keyword(s):  
Genotyping By Sequencing ◽  
Read Depth ◽  
Model Organisms ◽  
Single Nucleotide Polymorphism Discovery ◽  
Nucleotide Polymorphisms ◽  
Single Nucleotide ◽  
Polymorphism Discovery ◽  
Genome Wide ◽  
Plumage Development ◽  
Edar Gene

Poland is the largest European producer of goose, while goose breeding has become an essential and still increasing branch of the poultry industry. The most frequently bred goose is the White Kołuda® breed, constituting 95% of the country’s population, whereas geese of regional varieties are bred in smaller, conservation flocks. However, a goose’s genetic diversity is inaccurately explored, mainly because the advantages of the most commonly used tools are strongly limited in non-model organisms. One of the most accurate used markers for population genetics is single nucleotide polymorphisms (SNP). A highly efficient strategy for genome-wide SNP detection is genotyping-by-sequencing (GBS), which has been already widely applied in many organisms. This study attempts to use GBS in 12 conservative goose breeds and the White Kołuda® breed maintained in Poland. The GBS method allowed for the detection of 3833 common raw SNPs. Nevertheless, after filtering for read depth and alleles characters, we obtained the final markers panel used for a differentiation analysis that comprised 791 SNPs. These variants were located within 11 different genes, and one of the most diversified variants was associated with the EDAR gene, which is especially interesting as it participates in the plumage development, which plays a crucial role in goose breeding.

Single‐nucleotide polymorphism discovery and diversity in the model legume M edicago truncatula

2012 ◽  
Vol 13 (1) ◽  
pp. 84-95 ◽  
Author(s):  
Karine Loridon ◽  
Concetta Burgarella ◽  
Nathalie Chantret ◽  
Frédéric Martins ◽  
Jérôme Gouzy ◽  
...  
Keyword(s):  
Single Nucleotide Polymorphism ◽  
Single Nucleotide Polymorphism Discovery ◽  
Nucleotide Polymorphism ◽  
Single Nucleotide ◽  
Model Legume ◽  
Polymorphism Discovery

scholarly journals An Affinity Propagation-Based DNA Motif Discovery Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Chunxiao Sun ◽  
Hongwei Huo ◽  
Qiang Yu ◽  
Haitao Guo ◽  
Zhigang Sun
Keyword(s):  
Dna Sequences ◽  
Motif Discovery ◽  
Simulated Data ◽  
Biological Data ◽  
Affinity Propagation ◽  
Local Optimum ◽  
Data Sets ◽  
Dna Motif ◽  
Challenging Tasks ◽  
Dna Motif Discovery

The planted(l,d)motif search (PMS) is one of the fundamental problems in bioinformatics, which plays an important role in locating transcription factor binding sites (TFBSs) in DNA sequences. Nowadays, identifying weak motifs and reducing the effect of local optimum are still important but challenging tasks for motif discovery. To solve the tasks, we propose a new algorithm, APMotif, which first applies the Affinity Propagation (AP) clustering in DNA sequences to produce informative and good candidate motifs and then employs Expectation Maximization (EM) refinement to obtain the optimal motifs from the candidate motifs. Experimental results both on simulated data sets and real biological data sets show that APMotif usually outperforms four other widely used algorithms in terms of high prediction accuracy.

Sign in / Sign up

Export Citation Format

Share Document