Computational Methods for Biological Networks

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Computational and Applied Mathematics".

Deadline for manuscript submissions: closed (28 July 2023) | Viewed by 205

Special Issue Editor


E-Mail Website
Guest Editor
Department of Computer Science, University of California, Irvine, CA 92697-3435, USA
Interests: biomedical informatics and computational biology; computer vision; scientific and numerical computing
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Biological networks are used to define relationships (edges) between biological entities (nodes). They are used to represent a huge variety of biological systems from the microscopic (biomolecular, genetic, and regulatory interactions) to the macroscopic (taxonomic trees, evolutionary relationships, predator-prey relationships). They can be used to define dynamic relationships with time-varying networks representing molecular interactions, regulation, evolutionary changes, or even species migration, or space-varying networks such as tissue-specific relationships, contacts or near-contacts in folded structures, or predator–prey relationships in some particular region. Dynamic or space-varying networks are often simplified to be static and represent all possible relationships. Biological networks can have any number of nodes from a handful (e.g., functional pathways) to tens of thousands (gene/protein networks) or more; they can be directed or undirected; and nodes may be sparsely connected with binary edges or densely connected with every pair, having a real-valued weight on the edge between them.

The huge diversity of biological networks gives rise to an equally huge diversity in the types of computational analyses that can be performed: one may model the dynamics of regulation in a handful of nodes in a small network using differential equations to look for steady states or cyclic behavior; one may wish to compare networks of the same type across species, across tissues, or across time; or one may wish to transfer information between networks of similar but not identical types (e.g., genetic vs. protein interactions). In this issue, we welcome novel computational advances in any area of biological network analysis.

Dr. Wayne B Hayes
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • biological networks
  • biomolecular interactions
  • network comparison
  • network alignment
  • evolutionary dynamics

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop