A Novel Locus and Candidate Gene for Familial Developmental Dyslexia on Chromosome 4q.

Objective: Developmental dyslexia is a highly heritable specific reading and writing disability. To identify a possible new locus and candidate gene for this disability, we investigated a four-generation pedigree where transmission of dyslexia is consistent with an autosomal dominant inheritance pattern. Methods: We performed genome wide array-based SNP genotyping and parametric linkage analysis and sequencing analysis of protein-coding exons, exon-intron boundaries and conserved extragenic regions within the haplotype cosegregating with dyslexia in DNA from one affected and one unaffected family member. Cosegregation was confirmed by sequencing all available family members. Additionally, we analyzed 96 dyslexic individuals who had previously shown positive LOD scores on chromosome 4q28 as well as an even larger sample (n = 2591). Results: We found a single prominent linkage interval on chromosome 4q, where sequence analysis revealed a nucleotide variant in the 3' UTR of brain expressed SPRY1 in the dyslexic family member that cosegregated with dyslexia. This sequence alteration might affect the binding efficiency of the IGF2BP1 RNA-binding protein and thus influence the expression level of the SPRY1 gene product. An analysis of 96 individuals from a cohort of dyslexic individuals revealed a second heterozygous variant in this gene, which was absent in the unaffected sister of the proband. An investigation of the region in a much larger sample further found a nominal p-value of 0.0016 for verbal short-term memory (digit span) in 2,591 individuals for a neighboring SNV. After correcting for the local number of analyzed SNVs, and after taking into account linkage disequilibrium, we found this corresponds to a p-value of 0.0678 for this phenotype. Conclusions: We describe a new locus for familial dyslexia and discuss the possibility that SPRY1 might play a role in the etiology of a monogenic form of dyslexia.

Classes of tree-based networks.

Recently, so-called tree-based phylogenetic networks have attracted considerable attention. These networks can be constructed from a phylogenetic tree, called the base tree, by adding additional edges. The primary aim of this study is to provide sufficient criteria for tree-basedness by reducing phylogenetic networks to related graph structures. Even though it is generally known that determining whether a network is tree-based is an NP-complete problem, one of these criteria, namely edge-basedness, can be verified in linear time. Surprisingly, the class of edge-based networks is closely related to a well-known family of graphs, namely, the class of generalized series-parallel graphs, and we explore this relationship in full detail. Additionally, we introduce further classes of tree-based networks and analyze their relationships.

On the minimum value of the Colless index and the bifurcating trees that achieve it.

Measures of tree balance play an important role in the analysis of phylogenetic trees. One of the oldest and most popular indices in this regard is the Colless index for rooted bifurcating trees, introduced by Colless (Syst Zool 31:100-104, 1982). While many of its statistical properties under different probabilistic models for phylogenetic trees have already been established, little is known about its minimum value and the trees that achieve it. In this manuscript, we fill this gap in the literature. To begin with, we derive both recursive and closed expressions for the minimum Colless index of a tree with n leaves. Surprisingly, these expressions show a connection between the minimum Colless index and the so-called Blancmange curve, a fractal curve. We then fully characterize the tree shapes that achieve this minimum value and we introduce both an algorithm to generate them and a recurrence to count them. After focusing on two extremal classes of trees with minimum Colless index (the maximally balanced trees and the greedy from the bottom trees), we conclude by showing that all trees with minimum Colless index also have minimum Sackin index, another popular balance index.

Quantifying the accuracy of ancestral state prediction in a phylogenetic tree under maximum parsimony.

In phylogenetic studies, biologists often wish to estimate the ancestral discrete character state at an interior vertex v of an evolutionary tree T from the states that are observed at the leaves of the tree. A simple and fast estimation method-maximum parsimony-takes the ancestral state at v to be any state that minimises the number of state changes in T required to explain its evolution on T. In this paper, we investigate the reconstruction accuracy of this estimation method further, under a simple symmetric model of state change, and obtain a number of new results, both for 2-state characters, and r-state characters ([Formula: see text]). Our results rely on establishing new identities and inequalities, based on a coupling argument that involves a simpler 'coin toss' approach to ancestral state reconstruction.

On the Accuracy of Ancestral Sequence Reconstruction for Ultrametric Trees with Parsimony.

We examine a mathematical question concerning the reconstruction accuracy of the Fitch algorithm for reconstructing the ancestral sequence of the most recent common ancestor given a phylogenetic tree and sequence data for all taxa under consideration. In particular, for the symmetric four-state substitution model which is also known as Jukes-Cantor model, we answer affirmatively a conjecture of Li, Steel and Zhang which states that for any ultrametric phylogenetic tree and a symmetric model, the Fitch parsimony method using all terminal taxa is more accurate, or at least as accurate, for ancestral state reconstruction than using any particular terminal taxon or any particular pair of taxa. This conjecture had so far only been answered for two-state data by Fischer and Thatte. Here, we focus on answering the biologically more relevant case with four states, which corresponds to ancestral sequence reconstruction from DNA or RNA data.

Ancestral Sequence Reconstruction with Maximum Parsimony.

One of the main aims in phylogenetics is the estimation of ancestral sequences based on present-day data like, for instance, DNA alignments. One way to estimate the data of the last common ancestor of a given set of species is to first reconstruct a phylogenetic tree with some tree inference method and then to use some method of ancestral state inference based on that tree. One of the best-known methods both for tree inference and for ancestral sequence inference is Maximum Parsimony (MP). In this manuscript, we focus on this method and on ancestral state inference for fully bifurcating trees. In particular, we investigate a conjecture published by Charleston and Steel in 1995 concerning the number of species which need to have a particular state, say a, at a particular site in order for MP to unambiguously return a as an estimate for the state of the last common ancestor. We prove the conjecture for all even numbers of character states, which is the most relevant case in biology. We also show that the conjecture does not hold in general for odd numbers of character states, but also present some positive results for this case.

The most parsimonious tree for random data.

Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree 'shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each possible binary phylogenetic tree has exactly the same distribution for its parsimony score. Despite this pleasing and slightly surprising symmetry, some binary phylogenetic trees are more likely than others to be a most parsimonious (MP) tree for a sequence of k such characters, as we show. For k=2, and unrooted binary trees on six taxa, any tree with a caterpillar shape has a higher chance of being an MP tree than any tree with a symmetric shape. On the other hand, if we take any two binary trees, on any number of taxa, we prove that this bias between the two trees vanishes as the number of characters k grows. However, again there is a twist: MP trees on six taxa for k=2 random binary characters are more likely to have certain shapes than a uniform distribution on binary phylogenetic trees predicts. Moreover, this shape bias appears, from simulations, to be more pronounced for larger values of k.