4.3 Article

The amphioxus Hox cluster:: Characterization, comparative genomics, and evolution

出版社

WILEY
DOI: 10.1002/jez.b.21213

关键词

-

资金

  1. Biotechnology and Biological Sciences Research Council [BBS/B/12067/2, BBS/B/12067] Funding Source: Medline
  2. Biotechnology and Biological Sciences Research Council [BBS/B/12067/2, BBS/B/12067] Funding Source: researchfish

向作者/读者索取更多资源

The amphioxus Hox cluster is often viewed as archetypal for the chordate lineage. Here, we present a descriptive account of the 448 kb region spanning the Hox cluster of the amphioxus Branchiostoma floridae from Hox14 to Hox1. We provide complete coding sequences of all 14 previously described amphioxus sequences and give a detailed analysis of the conserved noncoding regulatory sequence elements. We find that the posterior part of the Hox cluster is so highly derived that even the complete genomic sequence is insufficient to decide whether the posterior Hox genes arose by independent duplications or whether they are true orthologs of the corresponding gnathostome paralog groups. In contrast, the anterior region is much better conserved. The amphioxus Hox cluster strongly excludes repetitive elements with the exception of two repeat islands in the posterior region. Repeat exclusion is also observed in gnathostomes, but not protostome Hox clusters. We thus hypothesize that the much shorter vertebrate Hox clusters are the result of extensive resolution of the redundancy of regulatory DNA after the genome duplications rather than the consequence of a selection pressure to remove nonfunctional sequence from the Hox cluster.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Biochemical Research Methods

Best Match Graphs With Binary Trees

David Schaller, Manuela Geiss, Marc Hellmuth, Peter F. F. Stadler

Summary: We propose a near-cubic algorithm to determine if Best match graphs (BMG) can be explained by a fully resolved gene tree and to construct such a tree. We prove that all binary trees are refinements of the unique binary-refinable tree (BRT) which is a significant refinement of the least resolved tree of a BMG. Additionally, we demonstrate the NP-completeness of editing an arbitrary vertex-colored graph to a binary-explainable BMG and provide an integer linear program formulation for this task.

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS (2023)

Article Mathematics

Hamiltonicity in power graphs of a class of abelian groups

Anahy Santiago Arguello, Juan Jose Montellano-Ballesteros, Peter F. Stadler

Summary: This paper investigates the power graphs of a class of abelian groups and explores whether the power graph is Hamiltonian in this case.

JOURNAL OF ALGEBRAIC COMBINATORICS (2023)

Article Biochemical Research Methods

High-quality total RNA extraction from early-stage lamprey embryos

Fumiaki Sugahara, Juan Pascual-Anaya

Summary: High-purity total RNA extraction from animal embryos is essential for transcriptome analyses. Lampreys, as a key organism for EvoDevo studies, face challenges in extracting uncontaminated RNA from early-stage embryos. By modifying the RNA extraction protocol with precentrifugation and adding salts before isopropanol precipitation, RNA yield is significantly increased, contaminants are removed, and RNA integrity is improved. This technique proves particularly effective for early-stage embryos from single-cell to prehatching stages.

BIOTECHNIQUES (2023)

Article Biochemical Research Methods

Detecting gene breakpoints in noisy genome sequences using position-annotated colored de-Bruijn graphs

Lisa Fiedler, Matthias Bernt, Martin Middendorf, Peter F. Stadler

Summary: This study presents a novel method for detecting gene breakpoints in the nucleotide sequences of complete mitochondrial genomes, considering high substitution rates. The method uses a parallel program design and has been extensively tested for accuracy.

BMC BIOINFORMATICS (2023)

Article Mathematics, Applied

Planar median graphs and cubesquare-graphs

Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth

Summary: Median graphs are connected graphs where there is a unique vertex belonging to the shortest paths between any three vertices. This paper presents new characterizations of planar median graphs by using forbidden subgraphs, isometric cycles, and subgraphs contained inside and outside of 4-cycles. These characterizations lead to a new definition of planar median graphs called cubesquare-graphs, and also provide an O(n log n)-time recognition algorithm for computing the decomposition of a planar median graph into cubes and square-graphs.

DISCRETE APPLIED MATHEMATICS (2023)

Article Mathematics, Applied

Quasi-best match graphs

Annachiara Korchmaros, David Schaller, Marc Hellmuth, Peter F. Stadler

Summary: Quasi-best match graphs (qBMGs) are directed, properly vertex-colored graphs that generalize best match graphs and represent the evolutionary closest relatedness of genes in multiple species. They can be explained by rooted trees where each leaf corresponds to a vertex. Compared to best match graphs, qBMGs only represent best matches within a restricted phylogenetic distance. We provide characterizations of qBMGs, including polynomial-time recognition algorithms, and identify best match graphs as color-sink-free qBMGs. Additionally, two-colored qBMGs are characterized as directed graphs satisfying three simple local conditions.

DISCRETE APPLIED MATHEMATICS (2023)

Article Mathematics

Injective Split Systems

M. Hellmuth, K. T. Huber, V. Moulton, G. E. Scholz, P. F. Stadler

Summary: This paper studies the properties of split systems, with a focus on injective split systems that can be used to represent symbolic tree maps. The authors prove the existence of an injective split system on any set X and provide a characterization for when a split system is injective. They also introduce related concepts such as injective dimension and provide upper and lower bounds for these dimensions. An important motivation for studying injective split systems is their application in representing three-way symbolic maps.

GRAPHS AND COMBINATORICS (2023)

Article Biochemistry & Molecular Biology

Led-Seq: ligation-enhanced double-end sequence-based structure analysis of RNA

Tim Kolberg, Sarah von Loehneysen, Iuliia Ozerova, Karolin Wellner, Roland K. Hartmann, Peter F. Stadler, Mario Moerl

Summary: Structural analysis of RNA is important in understanding its function. Led-Seq is a new approach based on lead-induced cleavage, which allows investigation of both resulting cleavage products. It provides accurate information about cleavage sites and is an improved method for studying RNA structures in vivo.

NUCLEIC ACIDS RESEARCH (2023)

Article Chemistry, Multidisciplinary

The six stages of the convergence of the periodic system to its final structure

Andres M. Bran, Peter F. Stadler, Juergen Jost, Guillermo Restrepo

Summary: The periodic system encodes order and similarity among chemical elements. The system has converged towards its current stable structure through six stages by analyzing the space between 1800 and 2021. Given the limited chemical possibilities and low diversity of the chemical space, the periodic system is expected to remain largely unchanged.

COMMUNICATIONS CHEMISTRY (2023)

Article Biochemical Research Methods

Mono-valent salt corrections for RNA secondary structures in the ViennaRNA package

Hua-Ting Yao, Ronny Lorenz, Ivo L. Hofacker, Peter F. Stadler

Summary: This article presents the influence of salt ion concentration on RNA structure prediction algorithms and proposes an improved model for better predicting the structure and stability of RNA. By comparing with experimental data, it is found that the predicted free energy and melting temperature are in close agreement with the experiments. This new feature has been added to the ViennaRNA package, allowing for systematic study of the effects of salt concentration on RNA folding.

ALGORITHMS FOR MOLECULAR BIOLOGY (2023)

Article Biology

The genome of the deep-sea anemone Actinernus sp. contains a mega-array of ANTP-class homeobox genes

Sean Tsz Sum Law, Yifei Yu, Wenyan Nong, Wai Lok So, Yiqian Li, Thomas Swale, David E. K. Ferrier, Jianwen Qiu, Peiyuan Qian, Jerome Ho Lam Hui

Summary: This study reports the first chromosome-level deep-sea cnidarian genome from an Actinernus sp. anemone, revealing molecular adaptations to extreme environments such as a mega-array of homeobox genes and cnidarian-specific microRNA complements. Additionally, the loss of circadian rhythm genes suggests an adaptation to the dark deep-sea environment.

PROCEEDINGS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES (2023)

Article Biology

Clustering systems of phylogenetic networks

Marc Hellmuth, David Schaller, Peter F. Stadler

Summary: Rooted acyclic graphs play a crucial role in modeling different types of evolutionary processes, and there are correspondences between different classes of networks and their clustering systems, revealing the mutual dependencies among various network types.

THEORY IN BIOSCIENCES (2023)

Article Mathematical & Computational Biology

RNAcode_Web - Convenient identification of evolutionary conserved protein coding regions

John Anders, Peter F. Stadler

Summary: Differentiating regions with coding potential from non-coding regions is an important task in computational biology. RNAcode, a method that utilizes sequence conservation patterns, shows superior classification accuracy for short coding sequences compared to methods that rely on a single input sequence. However, obtaining suitable multiple sequence alignments can be tedious and challenging. To address this, a new web service called RNAcode_Web is introduced, which automates the process of collecting, selecting, and preparing homologous sequences from the NCBI database and constructing multiple sequence alignments needed for RNAcode input. This service simplifies the investigation of previously unannotated coding regions for non-expert users.

JOURNAL OF INTEGRATIVE BIOINFORMATICS (2023)

Article Genetics & Heredity

Tailored machine learning models for functional RNA detection in genome-wide screens

Christopher Klapproth, Siegfried Zoetzsche, Felix Kuehnl, Joerg Fallmann, Peter F. Stadler, Sven Findeiss

Summary: This article introduces a software framework for in silico prediction of non-coding and protein-coding genetic loci, which allows for the alignment-based training, evaluation, and application of machine learning models with user-defined parameters. Instead of using the one-size-fits-all approach of pervasive in silico annotation pipelines, this framework focuses on the structured generation and evaluation of models based on arbitrary features and input data, aiming for stable and explainable results. Furthermore, the software package is applied to a full-genome screen of Drosophila melanogaster and evaluated against the well-known but less flexible program RNAz.

NAR GENOMICS AND BIOINFORMATICS (2023)

Article Chemistry, Multidisciplinary

Comparison of Atom Maps

Marcos E. Gonzalez Laffitte, Nora Beier, Nico Domschke, Peter F. Stadler

Summary: The computation of reliable and chemically correct atom maps from educt/product pairs is a challenging task in cheminformatics. Various competing models have been developed and compared through extensive benchmarking studies. This study formalizes the equivalence of atom maps and demonstrates the use of Fujita's Imaginary Transition State for this purpose. Numerical experiments confirm the practical feasibility. The article also briefly discusses generalizations to subgraph matches, graph transformation rules, and multi-step reaction mechanisms.

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY (2023)

暂无数据