372 hasil
Menampilkan 1–20 · 0,93 detik · RSS
Algorithms for Molecular Biology
Scopus
ISSN 1748-7188 · BMC · 372 artikel di indeks
-
Artikel Jurnal
Computing double-pushout graph transformation rules and atom-to-atom maps from KEGG RCLASS data
Abstract Background Atom-to-atom maps play an important role in many applications. However, they are often difficult to obtain. The KEGG reaction database does not provide atom-to-atom maps for its reactions and instead offers a description of local changes for pairs of reactant and product…
-
Artikel Jurnal
Orientability of undirected phylogenetic networks to a desired class: practical algorithms and application to tree-child orientation
Abstract The $$\mathcal {C}$$ C -Orientation problem asks whether it is possible to orient an undirected graph to a directed phylogenetic network of a desired network class $$\mathcal {C}$$ C . This problem arises, for example, when visualising evolutionary data, as popular methods such as…
-
Artikel Jurnal
A k-mer-based estimator of the substitution rate between repetitive sequences
Abstract Background K-mer-based analysis of genomic data is ubiquitous, but the presence of repetitive k-mers continues to pose problems for the accuracy of many methods. For example, the Mash tool (Ondov et al 2016) can accurately estimate the substitution rate between two low-repetitive sequences…
-
Artikel Jurnal
Haplotype-aware long-read error correction
Abstract Error correction of long reads is an important initial step in genome assembly workflows. For organisms with ploidy greater than one, it is important to preserve haplotype-specific variation during read correction. This challenge has driven the development of several haplotype-aware…
-
Artikel Jurnal
Lossless pangenome indexing using tag arrays
Abstract Pangenome graphs represent the genomic variation by encoding multiple haplotypes within a unified graph structure. However, efficient and lossless indexing of such structures remains challenging due to the scale and complexity of pangenomic data. We present a practical and scalable…
-
Artikel Jurnal
Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer
Abstract Background Several recent cancer phylogeny inference methods have used the k-Dollo evolutionary model for single-nucleotide variants, which requires a phylogeny T on binary sequencing data matrix B such that each variant is gained once and lost at most k times. The 1-Dollo variant has been…
-
Artikel Jurnal
Pattern matching with Elastic-Degenerate strings and Elastic-Founder graphs
Abstract Elastic Degenerate (ED) strings and Elastic Founder (EF) graphs, here collectively named variable strings, are two representations of acyclic components of pangenomes which extend the well-known notion of indeterminate string. Recent studies have focused extensively on algorithmic tasks…
-
Artikel Jurnal
Inferring and summarizing tumor phylogenies from bulk DNA data
Abstract Background Cancer phylogenies are key to understanding tumor evolution. However, due to the uncertainty in phylogenetic estimation, one typically infers many, equally-plausible phylogenies from bulk DNA sequencing data of tumors, hindering downstream analysis that relies on correct…
-
Artikel Jurnal
Probing transcription factor subsets in gene regulatory networks
Abstract Transcription factors (TFs) are essential players in the regulation of gene expression and thus have been the subject of interest in the context of diseases and the manipulation of specific cell functions or pathways. The complex interplay of TFs and genes can be modeled as a network, in…
-
Artikel Jurnal
An efficient algorithm for exploring RNA branching conformations under the nearest-neighbor thermodynamic model
Abstract Background In the Nearest-Neighbor Thermodynamic Model, a standard approach for RNA secondary structure prediction, the energy of the multiloops is modeled using a linear entropic penalty governed by three branching parameters. Although these parameters are typically fixed, recent work has…
-
Artikel Jurnal
Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features
Abstract Background Metabolic networks are complex systems that describe the biochemical reactions within an organism through pairwise interactions between chemical compounds. While this representation is widely used to study biological function, it fails to capture the full structure of metabolic…
-
Artikel Jurnal
Extension of partial atom-to-atom maps: uniqueness and algorithms
Abstract Chemical reaction databases typically report the molecular structures of reactant and product compounds, as well as their stoichiometry, but lack information, in particular, on the correspondence of reactant and product atoms. These atom-to-atom maps (AAM), however, are crucial for…
-
Artikel Jurnal
Improving spliced alignment by modeling splice sites with deep learning
Abstract Motivation Spliced alignment refers to the alignment of messenger RNA (mRNA) or protein sequences to eukaryotic genomes. It plays a critical role in gene annotation and the study of gene functions. Accurate spliced alignment demands sophisticated modeling of splice sites, but current…
-
Artikel Jurnal
Finding maximum common contractions between phylogenetic networks
Abstract In this paper, we lay the groundwork on the comparison of phylogenetic networks based on edge contractions and expansions as edit operations, as originally proposed by Robinson and Foulds to compare trees. We prove that these operations connect the space of all phylogenetic networks on the…
-
Artikel Jurnal
Exclusive functional signatures for gene annotation with vast OpenOrd layout
Abstract A biological study can produce a limited number of marker genes, not large enough to be used in gene set enrichment analysis. Here we suggest VOL-Gene, a graph-based algorithm that partitions all genes into non-overlapping classes of functionally related genes, thus assigning a single…
-
Artikel Jurnal
Orthology and near-cographs in the context of phylogenetic networks
Abstract Orthologous genes, which arise through speciation, play a key role in comparative genomics and functional inference. In particular, graph-based methods allow for the inference of orthology estimates without prior knowledge of the underlying gene or species trees. This results in orthology…
-
Artikel Jurnal
RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs
Abstract Inverse folding is a classic instance of negative RNA design which consists in finding a sequence that uniquely folds into a target secondary structure with respect to energy minimization. A breakthrough result of Bonnet et al. shows that, even in simple base pairs-based (BP) models, the…
-
Artikel Jurnal
Estimating similarity and distance using FracMinHash
Abstract Motivation The increasing number and volume of genomic and metagenomic data necessitates scalable and robust computational models for precise analysis. Sketching techniques utilizing $$k$$ k -mers from a biological sample have proven to be useful for large-scale analyses. In recent years…
-
Artikel Jurnal
The open-closed mod-minimizer algorithm
Abstract Sampling algorithms that deterministically select a subset of $$k$$ k -mers are an important building block in bioinformatics applications. For example, they are used to index large textual collections, like DNA, and to compare sequences quickly. In such applications, a sampling algorithm…
-
Artikel Jurnal
Finding high posterior density phylogenies by systematically extending a directed acyclic graph
Abstract Bayesian phylogenetics typically estimates a posterior distribution, or aspects thereof, using Markov chain Monte Carlo methods. These methods integrate over tree space by applying local rearrangements to move a tree through its space as a random walk. Previous work explored the…