Flexible and robust networks

We consider networks with two types of nodes. The v-nodes, called centers, are hyper- connected and interact one to another via many u-nodes, called satellites. This central- ized architecture, widespread in gene networks, possesses two fundamental properties. Namely, this organization creates feedback loops that are capable to generate practically any prescribed patterning dynamics, chaotic or periodic, or having a number of equilib- rium states. Moreover, this organization is robust with respect to random perturbations of the system.Comment: Journal of Bioinformatics and Computational Biology, in pres

Bioinformatics process management: information flow via a computational journal

This paper presents the Bioinformatics Computational Journal (BCJ), a framework for conducting and managing computational experiments in bioinformatics and computational biology. These experiments often involve series of computations, data searches, filters, and annotations which can benefit from a structured environment. Systems to manage computational experiments exist, ranging from libraries with standard data models to elaborate schemes to chain together input and output between applications. Yet, although such frameworks are available, their use is not widespread–ad hoc scripts are often required to bind applications together. The BCJ explores another solution to this problem through a computer based environment suitable for on-site use, which builds on the traditional laboratory notebook paradigm. It provides an intuitive, extensible paradigm designed for expressive composition of applications. Extensive features facilitate sharing data, computational methods, and entire experiments. By focusing on the bioinformatics and computational biology domain, the scope of the computational framework was narrowed, permitting us to implement a capable set of features for this domain. This report discusses the features determined critical by our system and other projects, along with design issues. We illustrate the use of our implementation of the BCJ on two domain-specific examples

Selected papers from the 15th and 16th international conference on Computational Intelligence Methods for Bioinformatics and Biostatistics

Funding Information: CIBB 2019 was held at the Department of Human and Social Sciences of the University of Bergamo, Italy, from the 4th to the 6th of September 2019 []. The organization of this edition of CIBB was supported by the Department of Informatics, Systems and Communication of the University of Milano-Bicocca, Italy, and by the Institute of Biomedical Technologies of the National Research Council, Italy. Besides the papers focused on computational intelligence methods applied to open problems of bioinformatics and biostatistics, the works submitted to CIBB 2019 dealt with algebraic and computational methods to study RNA behaviour, intelligence methods for molecular characterization and dynamics in translational medicine, modeling and simulation methods for computational biology and systems medicine, and machine learning in healthcare informatics and medical biology. A supplement published in BMC Medical Informatics and Decision Making journal [] collected three revised and extended papers focused on the latter topic.publishersversionpublishe

2K09 and thereafter : the coming era of integrative bioinformatics, systems biology and intelligent computing for functional genomics and personalized medicine research

Significant interest exists in establishing synergistic research in bioinformatics, systems biology and intelligent computing. Supported by the United States National Science Foundation (NSF), International Society of Intelligent Biological Medicine (http://www.ISIBM.org), International Journal of Computational Biology and Drug Design (IJCBDD) and International Journal of Functional Informatics and Personalized Medicine, the ISIBM International Joint Conferences on Bioinformatics, Systems Biology and Intelligent Computing (ISIBM IJCBS 2009) attracted more than 300 papers and 400 researchers and medical doctors world-wide. It was the only inter/multidisciplinary conference aimed to promote synergistic research and education in bioinformatics, systems biology and intelligent computing. The conference committee was very grateful for the valuable advice and suggestions from honorary chairs, steering committee members and scientific leaders including Dr. Michael S. Waterman (USC, Member of United States National Academy of Sciences), Dr. Chih-Ming Ho (UCLA, Member of United States National Academy of Engineering and Academician of Academia Sinica), Dr. Wing H. Wong (Stanford, Member of United States National Academy of Sciences), Dr. Ruzena Bajcsy (UC Berkeley, Member of United States National Academy of Engineering and Member of United States Institute of Medicine of the National Academies), Dr. Mary Qu Yang (United States National Institutes of Health and Oak Ridge, DOE), Dr. Andrzej Niemierko (Harvard), Dr. A. Keith Dunker (Indiana), Dr. Brian D. Athey (Michigan), Dr. Weida Tong (FDA, United States Department of Health and Human Services), Dr. Cathy H. Wu (Georgetown), Dr. Dong Xu (Missouri), Drs. Arif Ghafoor and Okan K Ersoy (Purdue), Dr. Mark Borodovsky (Georgia Tech, President of ISIBM), Dr. Hamid R. Arabnia (UGA, Vice-President of ISIBM), and other scientific leaders. The committee presented the 2009 ISIBM Outstanding Achievement Awards to Dr. Joydeep Ghosh (UT Austin), Dr. Aidong Zhang (Buffalo) and Dr. Zhi-Hua Zhou (Nanjing) for their significant contributions to the field of intelligent biological medicine

Integrating Molecular Biology and Bioinformatics Education

Pucker B, Schilbert H, Schumacher SF. Integrating Molecular Biology and Bioinformatics Education. Journal of Integrative Bioinformatics. 2019;16(3): 20190005.Combined awareness about the power and limitations of bioinformatics and molecular biology enables advanced research based on high-throughput data. Despite an increasing demand of scientists with a combined background in both fields, the education of dry and wet lab subjects are often still separated. This work describes an example of integrated education with a focus on genomics and transcriptomics. Participants learned computational and molecular biology methods in the same practical course. Peer-review was applied as a teaching method to foster cooperative learning of students with heterogeneous backgrounds. The positive evaluation results indicate that this approach was accepted by the participants and would likely be suitable for wider scale application

Web-based bioinformatic resources for protein and nucleic acids sequence alignment

DNA sequencing is the deciphering of hereditary information. It is an indispensable prerequisite for many biotechnical applications and technologies and the continual acquisition of genomic information is very important. This opens the door not only for further research and better understanding of the architectural plan of life, but also for future clinical diagnosis based on the genetic data of individuals. Bioinformatics can be broadly defined as the creation and development of advanced information and computational techniques for problems in biology. More narrowly, bioinformatics is the set of computing techniques used to manage and extract useful information from the DNA/RNA/protein sequence data being generated (at high volumes) by automated techniques (e.g., DNA sequencers, DNA microarrays) and stored in large public databases (e.g., GenBank, Protein DataBank). Certain method for analyzing genetic/protein data has been found to be extremely computationally intensive, providing motivation for the use of powerful computers. The advent of the Internet and the World Wide Web (WWW) has substantially increased the availability of information and computational resources available to experimental biologists. This review will describe the current on-line resources available, including protein and nucleic acids sequence alignment. Key words: Sequence alignment, DNA, Protein, ClustalW, FASTA. African Journal of Biotechnology Vol. 2 (12), pp. 714-718, December 200

Large scale evaluation of differences between network-based and pairwise sequence-alignment-based methods of dendrogram reconstruction

[EN] Dendrograms are a way to represent relationships between organisms. Nowadays, these are inferred based on the comparison of genes or protein sequences by taking into account their differences and similarities. The genetic material of choice for the sequence alignments (all the genes or sets of genes) results in distinct inferred dendrograms. In this work, we evaluate differences between dendrograms reconstructed with different methodologies and for different sets of organisms chosen at random from a much larger set. A statistical analysis is performed to estimate fluctuations between the results obtained from the different methodologies that allows us to validate a systematic approach, based on the comparison of the organisms' metabolic networks for inferring dendrograms. This has the advantage that it allows the comparison of organisms very far away in the evolutionary tree even if they have no known ortholog gene in common. Our results show that dendrograms built using information from metabolic networks are similar to the standard sequence-based dendrograms and can be a complement to them.All authors received funding from the European Union Seventh Framework Program (FP7/2007-2013) under grant agreement number 308518 (CyanoFactory) (https://ec.europa.eu/research/fp7/index_en.cfm).The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.Gamermann, D.; Montagud, A.; Conejero, JA.; Fernández De Córdoba, P.; Urchueguía Schölzel, JF. (2019). Large scale evaluation of differences between network-based and pairwise sequence-alignment-based methods of dendrogram reconstruction. PLoS ONE. 14(9):1-13. https://doi.org/10.1371/journal.pone.0221631S113149Robinson, D. F., & Foulds, L. R. (1981). Comparison of phylogenetic trees. Mathematical Biosciences, 53(1-2), 131-147. doi:10.1016/0025-5564(81)90043-2Day, W. H. E. (1985). Optimal algorithms for comparing trees with labeled leaves. Journal of Classification, 2(1), 7-28. doi:10.1007/bf01908061Pattengale, N. D., Gottlieb, E. J., & Moret, B. M. E. (2007). Efficiently Computing the Robinson-Foulds Metric. Journal of Computational Biology, 14(6), 724-735. doi:10.1089/cmb.2007.r012Woese, C. R., & Fox, G. E. (1977). Phylogenetic structure of the prokaryotic domain: The primary kingdoms. Proceedings of the National Academy of Sciences, 74(11), 5088-5090. doi:10.1073/pnas.74.11.5088Ciccarelli, F. D., Doerks, T., von Mering, C., Creevey, C. J., Snel, B., & Bork, P. (2006). Toward Automatic Reconstruction of a Highly Resolved Tree of Life. Science, 311(5765), 1283-1287. doi:10.1126/science.1123061Kurt Lienau, E., DeSalle, R., Allard, M., Brown, E. W., Swofford, D., Rosenfeld, J. A., … Planet, P. J. (2010). The mega-matrix tree of life: using genome-scale horizontal gene transfer and sequence evolution data as information about the vertical history of life. Cladistics, 27(4), 417-427. doi:10.1111/j.1096-0031.2010.00337.xWu, M., & Eisen, J. A. (2008). A simple, fast, and accurate method of phylogenomic inference. Genome Biology, 9(10), R151. doi:10.1186/gb-2008-9-10-r151Wu, D., Hugenholtz, P., Mavromatis, K., Pukall, R., Dalin, E., Ivanova, N. N., … Eisen, J. A. (2009). A phylogeny-driven genomic encyclopaedia of Bacteria and Archaea. Nature, 462(7276), 1056-1060. doi:10.1038/nature08656Mai, H., Lam, T.-W., & Ting, H.-F. (2017). A simple and economical method for improving whole genome alignment. BMC Genomics, 18(S4). doi:10.1186/s12864-017-3734-2Feng, B., Lin, Y., Zhou, L., Guo, Y., Friedman, R., Xia, R., … Tang, J. (2017). Reconstructing Yeasts Phylogenies and Ancestors from Whole Genome Data. Scientific Reports, 7(1). doi:10.1038/s41598-017-15484-5Rokas, A., Williams, B. L., King, N., & Carroll, S. B. (2003). Genome-scale approaches to resolving incongruence in molecular phylogenies. Nature, 425(6960), 798-804. doi:10.1038/nature02053JEFFROY, O., BRINKMANN, H., DELSUC, F., & PHILIPPE, H. (2006). Phylogenomics: the beginning of incongruence? Trends in Genetics, 22(4), 225-231. doi:10.1016/j.tig.2006.02.003Gamermann, D., Montagud, A., Conejero, J. A., Urchueguía, J. F., & de Córdoba, P. F. (2014). New Approach for Phylogenetic Tree Recovery Based on Genome-Scale Metabolic Networks. Journal of Computational Biology, 21(7), 508-519. doi:10.1089/cmb.2013.0150Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000). The large-scale organization of metabolic networks. Nature, 407(6804), 651-654. doi:10.1038/35036627Clemente, J. C., Satou, K., & Valiente, G. (2007). Phylogenetic reconstruction from non-genomic data. Bioinformatics, 23(2), e110-e115. doi:10.1093/bioinformatics/btl307Deyasi, K., Banerjee, A., & Deb, B. (2015). Phylogeny of metabolic networks: A spectral graph theoretical approach. Journal of Biosciences, 40(4), 799-808. doi:10.1007/s12038-015-9562-0Kanehisa, M. (2000). KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Research, 28(1), 27-30. doi:10.1093/nar/28.1.27Reyes, R., Gamermann, D., Montagud, A., Fuente, D., Triana, J., Urchueguía, J. F., & de Córdoba, P. F. (2012). Automation on the Generation of Genome-Scale Metabolic Models. Journal of Computational Biology, 19(12), 1295-1306. doi:10.1089/cmb.2012.0183Gross, J. L., Yellen, J., & Zhang, P. (Eds.). (2013). Handbook of Graph Theory. doi:10.1201/b16132Needleman, S. B., & Wunsch, C. D. (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3), 443-453. doi:10.1016/0022-2836(70)90057-4Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7), 107-117. doi:10.1016/s0169-7552(98)00110-xAllesina, S., & Pascual, M. (2009). Googling Food Webs: Can an Eigenvector Measure Species’ Importance for Coextinctions? PLoS Computational Biology, 5(9), e1000494. doi:10.1371/journal.pcbi.1000494Winter, C., Kristiansen, G., Kersting, S., Roy, J., Aust, D., Knösel, T., … Grützmann, R. (2012). Google Goes Cancer: Improving Outcome Prediction for Cancer Patients by Network-Based Ranking of Marker Genes. PLoS Computational Biology, 8(5), e1002511. doi:10.1371/journal.pcbi.1002511Sukumaran, J., & Holder, M. T. (2010). DendroPy: a Python library for phylogenetic computing. Bioinformatics, 26(12), 1569-1571. doi:10.1093/bioinformatics/btq228Henikoff, S., & Henikoff, J. G. (1992). Amino acid substitution matrices from protein blocks. Proceedings of the National Academy of Sciences, 89(22), 10915-10919. doi:10.1073/pnas.89.22.10915Dayhoff MO, Schwartz RM. Chapter 22: A model of evolutionary change in proteins. In: in Atlas of Protein Sequence and Structure; 1978.Suzuki, R., & Shimodaira, H. (2006). Pvclust: an R package for assessing the uncertainty in hierarchical clustering. Bioinformatics, 22(12), 1540-1542. doi:10.1093/bioinformatics/btl117Plata, G., Henry, C. S., & Vitkup, D. (2014). Long-term phenotypic evolution of bacteria. Nature, 517(7534), 369-372. doi:10.1038/nature1382

Is protein folding problem really a NP-complete one ? First investigations

To determine the 3D conformation of proteins is a necessity to understand their functions or interactions with other molecules. It is commonly admitted that, when proteins fold from their primary linear structures to their final 3D conformations, they tend to choose the ones that minimize their free energy. To find the 3D conformation of a protein knowing its amino acid sequence, bioinformaticians use various models of different resolutions and artificial intelligence tools, as the protein folding prediction problem is a NP complete one. More precisely, to determine the backbone structure of the protein using the low resolution models (2D HP square and 3D HP cubic), by finding the conformation that minimize free energy, is intractable exactly. Both the proof of NP-completeness and the 2D prediction consider that acceptable conformations have to satisfy a self-avoiding walk (SAW) requirement, as two different amino acids cannot occupy a same position in the lattice. It is shown in this document that the SAW requirement considered when proving NP-completeness is different from the SAW requirement used in various prediction programs, and that they are different from the real biological requirement. Indeed, the proof of NP completeness and the predictions in silico consider conformations that are not possible in practice. Consequences of this fact are investigated in this research work.Comment: Submitted to Journal of Bioinformatics and Computational Biology, under revie