journal
MENU ▼
Read by QxMD icon Read
search

Algorithms for Molecular Biology: AMB

journal
https://www.readbyqxmd.com/read/28861118/biologically-feasible-gene-trees-reconciliation-maps-and-informative-triples
#1
Marc Hellmuth
BACKGROUND: The history of gene families-which are equivalent to event-labeled gene trees-can be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes. The question then arises as whether inferred event-labeled gene trees are biologically feasible, that is, if there is a possible true history that would explain a given gene tree. In practice, this problem is boiled down to finding a reconciliation map-also known as DTL-scenario-between the event-labeled gene trees and a (possibly unknown) species tree...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28852417/partially-local-three-way-alignments-and-the-sequence-signatures-of-mitochondrial-genome-rearrangements
#2
Marwa Al Arab, Matthias Bernt, Christian Höner Zu Siederdissen, Kifah Tout, Peter F Stadler
BACKGROUND: Genomic DNA frequently undergoes rearrangement of the gene order that can be localized by comparing the two DNA sequences. In mitochondrial genomes different mechanisms are likely at work, at least some of which involve the duplication of sequence around the location of the apparent breakpoints. We hypothesize that these different mechanisms of genome rearrangement leave distinctive sequence footprints. In order to study such effects it is important to locate the breakpoint positions with precision...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28828033/a-hybrid-parameter-estimation-algorithm-for-beta-mixtures-and-applications-to-methylation-state-classification
#3
Christopher Schröder, Sven Rahmann
BACKGROUND: Mixtures of beta distributions are a flexible tool for modeling data with values on the unit interval, such as methylation levels. However, maximum likelihood parameter estimation with beta distributions suffers from problems because of singularities in the log-likelihood function if some observations take the values 0 or 1. METHODS: While ad-hoc corrections have been proposed to mitigate this problem, we propose a different approach to parameter estimation for beta mixtures where such problems do not arise in the first place...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28814968/asp-based-method-for-the-enumeration-of-attractors-in-non-deterministic-synchronous-and-asynchronous-multi-valued-networks
#4
Emna Ben Abdallah, Maxime Folschette, Olivier Roux, Morgan Magnin
BACKGROUND: This paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks (AN). AN is a general and well-suited formalism to study complex interactions between different components (genes, proteins,...). An attractor is a minimal trap domain, that is, a part of the state-transition graph that cannot be escaped. Such structures are terminal components of the dynamics and take the form of steady states (singleton) or complex compositions of cycles (non-singleton)...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28736575/identification-of-bifurcation-transitions-in-biological-regulatory-networks-using-answer-set-programming
#5
Louis Fippo Fitime, Olivier Roux, Carito Guziolowski, Loïc Paulevé
BACKGROUND: Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour. METHODS: In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28702075/a-graph-extension-of-the-positional-burrows-wheeler-transform-and-its-applications
#6
Adam M Novak, Erik Garrison, Benedict Paten
We present a generalization of the positional Burrows-Wheeler transform, or PBWT, to genome graphs, which we call the gPBWT. A genome graph is a collapsed representation of a set of genomes described as a graph. In a genome graph, a haplotype corresponds to a restricted form of walk. The gPBWT is a compressible representation of a set of these graph-encoded haplotypes that allows for efficient subhaplotype match queries. We give efficient algorithms for gPBWT construction and query operations. As a demonstration, we use the gPBWT to quickly count the number of haplotypes consistent with random walks in a genome graph, and with the paths taken by mapped reads; results suggest that haplotype consistency information can be practically incorporated into graph-based read mappers...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28630644/isometric-gene-tree-reconciliation-revisited
#7
Broňa Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo, Tomáš Vinař
BACKGROUND: Isometric gene tree reconciliation is a gene tree/species tree reconciliation problem where both the gene tree and the species tree include branch lengths, and these branch lengths must be respected by the reconciliation. The problem was introduced by Ma et al. in 2008 in the context of reconstructing evolutionary histories of genomes in the infinite sites model. RESULTS: In this paper, we show that the original algorithm by Ma et al. is incorrect, and we propose a modified algorithm that addresses the problems that we discovered...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28603547/a-better-scoring-model-for-de-novo-peptide-sequencing-the-symmetric-difference-between-explained-and-measured-masses
#8
Thomas Tschager, Simon Rösch, Ludovic Gillet, Peter Widmayer
BACKGROUND: Given a peptide as a string of amino acids, the masses of all its prefixes and suffixes can be found by a trivial linear scan through the amino acid masses. The inverse problem is the idealde novopeptide sequencing problem: Given all prefix and suffix masses, determine the string of amino acids. In biological reality, the given masses are measured in a lab experiment, and measurements by necessity are noisy. The (real, noisy) de novo peptide sequencing problem therefore has a noisy input: a few of the prefix and suffix masses of the peptide are missing and a few other masses are given in addition...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28592988/algorithms-for-computing-the-double-cut-and-join-distance-on-both-gene-order-and-intergenic-sizes
#9
Guillaume Fertin, Géraldine Jean, Eric Tannier
BACKGROUND: Combinatorial works on genome rearrangements have so far ignored the influence of intergene sizes, i.e. the number of nucleotides between consecutive genes, although it was recently shown decisive for the accuracy of inference methods (Biller et al. in Genome Biol Evol 8:1427-39, 2016; Biller et al. in Beckmann A, Bienvenu L, Jonoska N, editors. Proceedings of Pursuit of the Universal-12th conference on computability in Europe, CiE 2016, Lecture notes in computer science, vol 9709, Paris, France, June 27-July 1, 2016...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28572834/stream-formula-see-text-algorithms-for-analyzing-coarse-grained-rna-dynamics-based-on-markov-models-of-connectivity-graphs
#10
Sven Jager, Benjamin Schiller, Philipp Babel, Malte Blumenroth, Thorsten Strufe, Kay Hamacher
BACKGROUND: In this work, we present a new coarse grained representation of RNA dynamics. It is based on adjacency matrices and their interactions patterns obtained from molecular dynamics simulations. RNA molecules are well-suited for this representation due to their composition which is mainly modular and assessable by the secondary structure alone. These interactions can be represented as adjacency matrices of k nucleotides. Based on those, we define transitions between states as changes in the adjacency matrices which form Markovian dynamics...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28559921/the-gene-family-free-median-of-three
#11
Daniel Doerr, Metin Balaban, Pedro Feijão, Cedric Chauve
BACKGROUND: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the breakpoint median of three genomes, which asks for the construction of a fourth genome that minimizes the sum of breakpoint distances to the input genomes. METHODS: We present a model for constructing a median of three genomes in this family-free setting, based on maximizing an objective function that generalizes the classical breakpoint distance by integrating sequence similarity in the score of a gene adjacency...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28515774/complexity-and-algorithms-for-copy-number-evolution-problems
#12
Mohammed El-Kebir, Benjamin J Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira
BACKGROUND: Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome's copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. RESULTS: We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile [Formula: see text] to [Formula: see text] by the minimum number of events needed to transform [Formula: see text] into [Formula: see text]...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28435440/core-column-prediction-for-protein-multiple-sequence-alignments
#13
Dan DeBlasio, John Kececioglu
BACKGROUND: In a computed protein multiple sequence alignment, the coreness of a column is the fraction of its substitutions that are in so-called core columns of the gold-standard reference alignment of its proteins. In benchmark suites of protein reference alignments, the core columns of the reference alignment are those that can be confidently labeled as correct, usually due to all residues in the column being sufficiently close in the spatial superposition of the known three-dimensional structures of the proteins...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28373895/aligning-coding-sequences-with-frameshift-extension-penalties
#14
Safa Jammali, Esaie Kuitche, Ayoub Rachati, François Bélanger, Michelle Scott, Aïda Ouangraoua
BACKGROUND: Frameshift translation is an important phenomenon that contributes to the appearance of novel coding DNA sequences (CDS) and functions in gene evolution, by allowing alternative amino acid translations of gene coding regions. Frameshift translations can be identified by aligning two CDS, from a same gene or from homologous genes, while accounting for their codon structure. Two main classes of algorithms have been proposed to solve the problem of aligning CDS, either by amino acid sequence alignment back-translation, or by simultaneously accounting for the nucleotide and amino acid levels...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28373894/gerbil-a-fast-and-memory-efficient%C3%A2-k-mer-counter-with-gpu-support
#15
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
BACKGROUND: A basic task in bioinformatics is the counting of k-mers in genome sequences. Existing k-mer counting tools are most often optimized for small k < 32 and suffer from excessive memory resource consumption or degrading performance for large k. However, given the technology trend towards long reads of next-generation sequencers, support for large k becomes increasingly important. RESULTS: We present the open source k-mer counting software Gerbil that has been designed for the efficient counting of k-mers for k ≥ 32...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28344638/the-feasibility-of-genome-scale-biological-network-inference-using-graphics-processing-units
#16
Raghuram Thiagarajan, Amir Alavi, Jagdeep T Podichetty, Jason N Bazil, Daniel A Beard
Systems research spanning fields from biology to finance involves the identification of models to represent the underpinnings of complex systems. Formal approaches for data-driven identification of network interactions include statistical inference-based approaches and methods to identify dynamical systems models that are capable of fitting multivariate data. Availability of large data sets and so-called 'big data' applications in biology present great opportunities as well as major challenges for systems identification/reverse engineering applications...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28331536/an-efficient-algorithm-for-testing-the-compatibility-of-phylogenies-with-nested-taxa
#17
Yun Deng, David Fernández-Baca
BACKGROUND: Semi-labeled trees generalize ordinary phylogenetic trees, allowing internal nodes to be labeled by higher-order taxa. Taxonomies are examples of semi-labeled trees. Suppose we are given collection [Formula: see text] of semi-labeled trees over various subsets of a set of taxa. The ancestral compatibility problem asks whether there is a semi-labeled tree that respects the clusterings and the ancestor/descendant relationships implied by the trees in [Formula: see text]. The running time and space usage of the best previous algorithm for testing ancestral compatibility depend on the degrees of the nodes in the trees in [Formula: see text]...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28316640/on-the-computational-complexity-of-the-maximum-parsimony-reconciliation-problem-in-the-duplication-loss-coalescence-model
#18
Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung, Ran Libeskind-Hadas
BACKGROUND: Phylogenetic tree reconciliation is a widely-used method for inferring the evolutionary histories of genes and species. In the duplication-loss-coalescence (DLC) model, we seek a reconciliation that explains the incongruence between a gene and species tree using gene duplication, loss, and deep coalescence events. In the maximum parsimony framework, costs are associated with these event types and a reconciliation is sought that minimizes the total cost of the events required to map the gene tree onto the species tree...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28293277/on-avoided-words-absent-words-and-their-application-to-biological-sequence-analysis
#19
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S Iliopoulos, Manal Mohamed, Solon P Pissis, Dimitris Polychronopoulos
BACKGROUND: The deviation of the observed frequency of a word w from its expected frequency in a given sequence x is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguistic analysis. The value of the deviation of w, denoted by [Formula: see text], effectively characterises the extent of a word by its edge contrast in the context in which it occurs. A word w of length [Formula: see text] is a [Formula: see text]-avoided word in x if [Formula: see text], for a given threshold [Formula: see text]...
2017: Algorithms for Molecular Biology: AMB
https://www.readbyqxmd.com/read/28293276/approximating-the-correction-of-weighted-and-unweighted-orthology-and-paralogy-relations
#20
Riccardo Dondi, Manuel Lafond, Nadia El-Mabrouk
BACKGROUND: Given a gene family, the relations between genes (orthology/paralogy), are represented by a relation graph, where edges connect pairs of orthologous genes and "missing" edges represent paralogs. While a gene tree directly induces a relation graph, the converse is not always true. Indeed, a relation graph is not necessarily "satisfiable", i.e. does not necessarily correspond to a gene tree. And even if that holds, it may not be "consistent", i.e. the tree may not represent a true history in agreement with a species tree...
2017: Algorithms for Molecular Biology: AMB
journal
journal
41260
1
2
Fetch more papers »
Fetching more papers... Fetching...
Read by QxMD. Sign in or create an account to discover new knowledge that matter to you.
Remove bar
Read by QxMD icon Read
×

Search Tips

Use Boolean operators: AND/OR

diabetic AND foot
diabetes OR diabetic

Exclude a word using the 'minus' sign

Virchow -triad

Use Parentheses

water AND (cup OR glass)

Add an asterisk (*) at end of a word to include word stems

Neuro* will search for Neurology, Neuroscientist, Neurological, and so on

Use quotes to search for an exact phrase

"primary prevention of cancer"
(heart or cardiac or cardio*) AND arrest -"American Heart Association"