Proteomics Databases and Websites

Information avalanche (overload or expansion) in various scientific fields is a novel issue turned out by a number of factors considered necessary to facilitate their record and registration. Though, the biological science and its diverse fields like proteomics are not immune of this event and even may be as the event’s herald. On the other hand, time as the most valued anxiety of human has encountered a huge mass of information. Therefore, in order to maintain access and ease the understanding of information in several fields some emprises have been prepared. Bioinformatics is an upshot of this anxiety and emprise. Interestingly, proteomics through studying proteins collection in alive things has covered a great portion of bioinformatics. Consequently, a noteworthy outlook on proteomics related databases (DBs) and websites not only can help investigators to face the upcoming archive of databases but also estimate the volume of the needed facilitates. Furthermore, enrichment of the DBs or related websites must be the priority of researchers. Herein, by covering the major proteomics related databases and websites, we have presented a comprehensive classification to simplify and clarify their understanding and applications

Genome-scale computational analysis of DNA curvature and repeats in Arabidopsis and rice uncovers plant-specific genomic properties

<p>Abstract</p> <p>Background</p> <p>Due to its overarching role in genome function, sequence-dependent DNA curvature continues to attract great attention. The DNA double helix is not a rigid cylinder, but presents both curvature and flexibility in different regions, depending on the sequence. More in depth knowledge of the various orders of complexity of genomic DNA structure has allowed the design of sophisticated bioinformatics tools for its analysis and manipulation, which, in turn, have yielded a better understanding of the genome itself. Curved DNA is involved in many biologically important processes, such as transcription initiation and termination, recombination, DNA replication, and nucleosome positioning. CpG islands and tandem repeats also play significant roles in the dynamics and evolution of genomes.</p> <p>Results</p> <p>In this study, we analyzed the relationship between these three structural features within rice (<it>Oryza sativa</it>) and Arabidopsis (<it>Arabidopsis thaliana</it>) genomes. A genome-scale prediction of curvature distribution in rice and Arabidopsis indicated that most of the chromosomes of both genomes have maximal chromosomal DNA curvature adjacent to the centromeric region. By analyzing tandem repeats across the genome, we found that frequencies of repeats are higher in regions adjacent to those with high curvature value. Further analysis of CpG islands shows a clear interdependence between curvature value, repeat frequencies and CpG islands. Each CpG island appears in a local minimal curvature region, and CpG islands usually do not appear in the centromere or regions with high repeat frequency. A statistical evaluation demonstrates the significance and non-randomness of these features.</p> <p>Conclusions</p> <p>This study represents the first systematic genome-scale analysis of DNA curvature, CpG islands and tandem repeats at the DNA sequence level in plant genomes, and finds that not all of the chromosomes in plants follow the same rules common to other eukaryote organisms, suggesting that some of these genomic properties might be considered as specific to plants.</p

QuateXelero : an accelerated exact network motif detection algorithm

Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks’ structure and function. However, this task is very computationally demanding, because it is highly associated with the graph isomorphism which is an NP problem (not known to belong to P or NP-complete subsets yet). Accordingly, this research is endeavoring to decrease the need to call NAUTY isomorphism detection method, which is the most time-consuming step in many existing algorithms. The work provides an extremely fast motif detection algorithm called QuateXelero, which has a Quaternary Tree data structure in the heart. The proposed algorithm is based on the well-known ESU (FANMOD) motif detection algorithm. The results of experiments on some standard model networks approve the overal superiority of the proposed algorithm, namely QuateXelero, compared with two of the fastest existing algorithms, G-Tries and Kavosh. QuateXelero is especially fastest in constructing the central data structure of the algorithm from scratch based on the input network

Predictive genomics: A cancer hallmark network framework for predicting tumor clinical phenotypes using genome sequencing data

We discuss a cancer hallmark network framework for modelling genome-sequencing data to predict cancer clonal evolution and associated clinical phenotypes. Strategies of using this framework in conjunction with genome sequencing data in an attempt to predict personalized drug targets, drug resistance, and metastasis for a cancer patient, as well as cancer risks for a healthy individual are discussed. Accurate prediction of cancer clonal evolution and clinical phenotypes will have substantial impact on timely diagnosis, personalized management and prevention of cancer.Comment: 5 figs, related papers, visit lab homepage: http://www.cancer-systemsbiology.org, Seminar in Cancer Biology, 201

Factors influencing quality of life in patients with myocardial infraction

Background & Aim: Myocardial infarction is a common and dangerous life threatening disease with an impact on quality of life. The present descriptive-analytical study aims to determine quality of life in patients with myocardial infarction referring to Hadjar hospital affiliated to the Shahre-kord University of Medical Sciences. Material & Method: This was a descriptive-analytical study in which 150 patients admitted to cardiac care unit of Hadja hospital within 8 weeks post infarction were selected by non random sampling method. Data were collected through interview, patients’ medical records and patients self report. The tool for collecting data regarding quality of life was SF36 questionnaire. Data were analyzed by descriptive and inferential statistics. Results: Findings showed that the mean value of age was 55.7 ±10.5 and that quality of life in majority of subjects (%53) was fairly favorable. Regarding aspects of quality of life, most patients had fairly favorable general status (physical and psychological health) (%62) and social function (%65). Also, sleep pattern of majority of subjects (%61) was favorable and most of them (62%) had unfavorable physical activity. There was statistically significant correlation between quality of life and variables such as duration of disease (P<0.05), intensity of pain (P<0.05), decline or loss of job function, and the degree of fatigue (P<0.05), but there was no statistically significant relationship between quality of life and other demographics as age, gender, marital status, economic status and occupational status. Conclusion: Because fatigue and pain have some relationship with quality of life in patient with myocardial infarction, health care personnel, spatially nurses should pay attention to dimensions of quality of life when planning care for these patients. Failure to do so may leads to quality of life of patients to be neglected

EGassembler: online bioinformatics service for large-scale processing, clustering and assembling ESTs and genomic DNA fragments

Expressed sequence tag (EST) sequencing has proven to be an economically feasible alternative for gene discovery in species lacking a draft genome sequence. Ongoing large-scale EST sequencing projects feel the need for bioinformatics tools to facilitate uniform EST handling. This brings about a renewed importance for a universal tool for processing and functional annotation of large sets of ESTs. EGassembler () is a web server, which provides an automated as well as a user-customized analysis tool for cleaning, repeat masking, vector trimming, organelle masking, clustering and assembling of ESTs and genomic fragments. The web server is publicly available and provides the community a unique all-in-one online application web service for large-scale ESTs and genomic DNA clustering and assembling. Running on a Sun Fire 15K supercomputer, a significantly large volume of data can be processed in a short period of time. The results can be used to functionally annotate genes, to facilitate splice alignment analysis, to link the transcripts to genetic and physical maps, design microarray chips, to perform transcriptome analysis and to map to KEGG metabolic pathways. The service provides an excellent bioinformatics tool to research groups in wet-lab as well as an all-in-one-tool for sequence handling to bioinformatics researchers

Kavosh: a new algorithm for finding network motifs

<p>Abstract</p> <p>Background</p> <p>Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs.</p> <p>Results</p> <p>We present a new algorithm (Kavosh), for finding k-size network motifs with less memory and CPU time in comparison to other existing algorithms. Our algorithm is based on counting all k-size sub-graphs of a given graph (directed or undirected). We evaluated our algorithm on biological networks of <it>E. coli </it>and <it>S. cereviciae</it>, and also on non-biological networks: a social and an electronic network.</p> <p>Conclusion</p> <p>The efficiency of our algorithm is demonstrated by comparing the obtained results with three well-known motif finding tools. For comparison, the CPU time, memory usage and the similarities of obtained motifs are considered. Besides, Kavosh can be employed for finding motifs of size greater than eight, while most of the other algorithms have restriction on motifs with size greater than eight. The Kavosh source code and help files are freely available at: <url>http://Lbb.ut.ac.ir/Download/LBBsoft/Kavosh/</url>.</p

Nonparametric Simulation of Signal Transduction Networks with Semi-Synchronized Update

Simulating signal transduction in cellular signaling networks provides predictions of network dynamics by quantifying the changes in concentration and activity-level of the individual proteins. Since numerical values of kinetic parameters might be difficult to obtain, it is imperative to develop non-parametric approaches that combine the connectivity of a network with the response of individual proteins to signals which travel through the network. The activity levels of signaling proteins computed through existing non-parametric modeling tools do not show significant correlations with the observed values in experimental results. In this work we developed a non-parametric computational framework to describe the profile of the evolving process and the time course of the proportion of active form of molecules in the signal transduction networks. The model is also capable of incorporating perturbations. The model was validated on four signaling networks showing that it can effectively uncover the activity levels and trends of response during signal transduction process

Global, regional, and national burden of colorectal cancer and its risk factors, 1990–2019: a systematic analysis for the Global Burden of Disease Study 2019

Funding: F Carvalho and E Fernandes acknowledge support from Fundação para a Ciência e a Tecnologia, I.P. (FCT), in the scope of the project UIDP/04378/2020 and UIDB/04378/2020 of the Research Unit on Applied Molecular Biosciences UCIBIO and the project LA/P/0140/2020 of the Associate Laboratory Institute for Health and Bioeconomy i4HB; FCT/MCTES through the project UIDB/50006/2020. J Conde acknowledges the European Research Council Starting Grant (ERC-StG-2019-848325). V M Costa acknowledges the grant SFRH/BHD/110001/2015, received by Portuguese national funds through Fundação para a Ciência e Tecnologia (FCT), IP, under the Norma Transitória DL57/2016/CP1334/CT0006.proofepub_ahead_of_prin