Literature DB >> 35910209

Editorial: Methods and Applications in Molecular Phylogenetics.

Juan Wang1.   

Abstract

Entities:  

Keywords:  application; disease; molecular phylogenetics; protein; whole genome sequences

Year:  2022        PMID: 35910209      PMCID: PMC9332192          DOI: 10.3389/fgene.2022.923409

Source DB:  PubMed          Journal:  Front Genet        ISSN: 1664-8021            Impact factor:   4.772


× No keyword cloud information.
The purpose of molecular phylogenetics is to infer the evolutionary history of organisms and gene sequences. In the early stages of research, molecular phylogenetics mainly considers the changes vertically, such as insertion, substitution, and deletion in loci (Siepel and Haussler, 2004). With the development of sequencing technologies, the whole genomes are available for more and more organisms and are used to analyze their phylogenetics (Henz et al., 2005; Birin et al., 2008). The evolutionary history of organisms at this stage is described as a phylogenetic tree (Bruno et al., 2000). Then, genes of genomes are rearranged under horizontal events, such as inversions, duplications, and transpositions, which change the content and order of genes. Many studies introduce computing methods of molecular phylogenetics for whole genomes (Greenman et al., 2012). Phylogenetic networks are used to describe the evolutionary history (Wang and Guo, 2019). Molecular phylogenetics has been applied in many areas, such as the analysis of proteins (Lv et al., 2020). Traditional methods for molecular phylogenetics need to do the alignment for sequences. It is very time-consuming to process the alignment of whole genome sequences. Therefore, it is a hard issue to do phylogenetic analysis from whole genome sequences of organisms. Wu et al. introduce a metric called information-entropy position-weighted k-mer relative measure (IEPWRMkmer), which combines the position-weighted measure and the information entropy of frequency for k-mers. Accordingly, they denote the whole genomes as feature sequences and then use Manhattan distance to compute the distance between two whole genomes. Finally, they use the Neighbor-Joining method to construct the phylogenetic tree from distance matrices. The IEPWRMkmer is efficient and effective for extracting key information for evolutionary analysis, and it is free to align for whole genomes. Many studies have been done in applications of molecular phylogenetics. A protein complex contains proteins that interact with each other in function due to the evolutionary relationship. Wang et al. used semantic information of GO terms and the topological information of PPI networks to propose a method called TSSN for constructing a weighted PPI network. They proposed a new algorithm (NNP) for recognizing protein complexes from the weighted PPI network. Experiments showed that the algorithm could identify more protein complexes more accurately. PredMHC, proposed by Chen et al., is used to predict major histocompatibility complex (MHC). The PredMHC extracts information on amino acid composition from proteins, which is different due to the evolution of coding genes. It uses the voting of the SGD, the SMO, and random forest to predict and achieve the best performance on both training and testing datasets than other methods. Molecular phylogenetics is also applied in predicting disease-related proteins. Anti-inflammatory peptides (AIPs) are important to treat some inflammatory and autoimmune diseases. Zhao et al. introduced a model (called iAIPs) to identify AIPs. iAIPs extract features from AIPs based on the information of sequences changed in evolution and then use the random forest to train. Experimental results show that iAIPs can identify AIPs accurately. Cancer is a serious threat to human health and is one of the main causes of disease death. MultiGATAE, proposed by Zhang et al., can identify the cancer subtypes. It first constructs a similarity graph from multi-omics data (i.e., mRNA, miRNA, and DNA methylation) and then uses a deep learning method to learn embedding representation. It uses the K-means clustering method to identify cancer subtypes from embedding representation.
  7 in total

1.  Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction.

Authors:  W J Bruno; N D Socci; A L Halpern
Journal:  Mol Biol Evol       Date:  2000-01       Impact factor: 16.240

2.  Phylogenetic estimation of context-dependent substitution rates by maximum likelihood.

Authors:  Adam Siepel; David Haussler
Journal:  Mol Biol Evol       Date:  2003-12-05       Impact factor: 16.240

3.  Whole-genome prokaryotic phylogeny.

Authors:  Stefan R Henz; Daniel H Huson; Alexander F Auch; Kay Nieselt-Struwe; Stephan C Schuster
Journal:  Bioinformatics       Date:  2004-05-27       Impact factor: 6.937

4.  Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion.

Authors:  Hadas Birin; Zohar Gal-Or; Isaac Elias; Tamir Tuller
Journal:  Bioinformatics       Date:  2008-01-18       Impact factor: 6.937

5.  A review of metrics measuring dissimilarity for rooted phylogenetic networks.

Authors:  Juan Wang; Maozu Guo
Journal:  Brief Bioinform       Date:  2019-11-27       Impact factor: 11.622

6.  Estimation of rearrangement phylogeny for cancer genomes.

Authors:  Chris D Greenman; Erin D Pleasance; Scott Newman; Fengtang Yang; Beiyuan Fu; Serena Nik-Zainal; David Jones; King Wai Lau; Nigel Carter; Paul A W Edwards; P Andrew Futreal; Michael R Stratton; Peter J Campbell
Journal:  Genome Res       Date:  2011-10-12       Impact factor: 9.043

7.  Identification of Sub-Golgi protein localization by use of deep representation learning features.

Authors:  Zhibin Lv; Pingping Wang; Quan Zou; Qinghua Jiang
Journal:  Bioinformatics       Date:  2020-12-26       Impact factor: 6.937

  7 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.