MESSAGE
| DATE | 2016-10-27 |
| FROM | Ruben Safir
|
| SUBJECT | Re: [Learn] Phylogenetics educational links
|
From learn-bounces-at-nylxs.com Thu Oct 27 18:48:10 2016
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: from www.mrbrklyn.com (www.mrbrklyn.com [96.57.23.82])
by mrbrklyn.com (Postfix) with ESMTP id D0D3A161311;
Thu, 27 Oct 2016 18:48:09 -0400 (EDT)
X-Original-To: learn-at-nylxs.com
Delivered-To: learn-at-nylxs.com
Received: from mailbackend.panix.com (mailbackend.panix.com [166.84.1.89])
by mrbrklyn.com (Postfix) with ESMTP id 5FD7C160E77
for ; Thu, 27 Oct 2016 18:48:06 -0400 (EDT)
Received: from panix2.panix.com (panix2.panix.com [166.84.1.2])
by mailbackend.panix.com (Postfix) with ESMTP id 1BD6F176C5;
Thu, 27 Oct 2016 18:48:04 -0400 (EDT)
Received: by panix2.panix.com (Postfix, from userid 20529)
id 8EEB933CA2; Thu, 27 Oct 2016 18:48:04 -0400 (EDT)
Date: Thu, 27 Oct 2016 18:48:04 -0400
From: Ruben Safir
To: Christopher League
Message-ID: <20161027224804.GA22298-at-panix.com>
References: <8a528f28-6298-2fe8-0a01-8899000d0244-at-mrbrklyn.com>
<8760odd05h.fsf-at-contrapunctus.net>
MIME-Version: 1.0
Content-Disposition: inline
In-Reply-To: <8760odd05h.fsf-at-contrapunctus.net>
User-Agent: Mutt/1.6.1 (2016-04-27)
Cc: learn-at-nylxs.com
Subject: Re: [Learn] Phylogenetics educational links
X-BeenThere: learn-at-nylxs.com
X-Mailman-Version: 2.1.17
Precedence: list
List-Id:
List-Unsubscribe: ,
List-Archive:
List-Post:
List-Help:
List-Subscribe: ,
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Errors-To: learn-bounces-at-nylxs.com
Sender: "Learn"
On Thu, Oct 27, 2016 at 04:09:30PM -0400, Christopher League wrote:
>
> Here's a set of introductory slides on inference of phylogenetic trees.
>
>
>
> phylogenetics. It's much more accessible stuff than trying to
> automatically interpret 3D model data to take measurements of maxillary
> bones.
>
Yeah - duh
> CL
>
>
> Ruben Safir writes:
>
> > http://telliott99.blogspot.com/2010/03/fitch-and-sankoff-algorithms-for.html
> >
> > "The Fitch algorithm considers the sites (or characters) one at a time. At each tip in the tree, we create a set containing those nucleotides (states) that are observed or are compatible with the observation. Thus, if we see an A, we create the set {A}. If we see an ambiguity such as R, we create the set {AG}. Now we move down the tree [away from the tips]. In algorithmic terms, we do a postorder tree traversal. At each interior node we create a set that is the intersection of sets at the two descendant nodes. However, if that set is empty, we instead create the set that is the union of the two sets at the descendant nodes. Every time we create such a union, we also count one change of state."
> >
> >
> > https://en.wikipedia.org/wiki/Non-parametric
> > Nonparametric statistics are statistics not based on parameterized families of probability distributions. They include both descriptive and inferential statistics. The typical parameters are the mean, variance, etc. Unlike parametric statistics, nonparametric statistics make no assumptions about the probability distributions of the variables being assessed. The difference between parametric models and non-parametric models is that the former has a fixed number of parameters, while the latter grows the number of parameters with the amount of training data.[1] Note that the non-parametric model does, counterintuitively, contain parameters: the distinction is that parameters are determined by the training data in the case of non-parametric statistics, not the model.
> >
> > https://en.wikipedia.org/wiki/Fitch-Margoliash_algorithm
> > Distance-matrix methods
> >
> > Distance-matrix methods of phylogenetic analysis explicitly rely on a measure of "genetic distance" between the sequences being classified, and therefore they require an MSA (multiple sequence alignment) as an input. Distance is often defined as the fraction of mismatches at aligned positions, with gaps either ignored or counted as mismatches.[1] Distance methods attempt to construct an all-to-all matrix from the sequence query set describing the distance between each sequence pair. From this is constructed a phylogenetic tree that places closely related sequences under the same interior node and whose branch lengths closely reproduce the observed distances between sequences. Distance-matrix methods may produce either rooted or unrooted trees, depending on the algorithm used to calculate them. They are frequently used as the basis for progressive and iterative types of multiple sequence alignment. The main disadvantage of distance-matrix methods is their inability to efficiently use
> > information about local high-variation regions that appear across multiple subtrees.[2]
> >
> >
> > --
> > So many immigrant groups have swept through our town
> > that Brooklyn, like Atlantis, reaches mythological
> > proportions in the mind of the world - RI Safir 1998
> > http://www.mrbrklyn.com
> >
> > DRM is THEFT - We are the STAKEHOLDERS - RI Safir 2002
> > http://www.nylxs.com - Leadership Development in Free Software
> > http://www2.mrbrklyn.com/resources - Unpublished Archive
> > http://www.coinhangout.com - coins!
> > http://www.brooklyn-living.com
> >
> > Being so tracked is for FARM ANIMALS and and extermination camps,
> > but incompatible with living as a free human being. -RI Safir 2013
> > _______________________________________________
> > Learn mailing list
> > Learn-at-nylxs.com
> > http://lists.mrbrklyn.com/mailman/listinfo/learn
> _______________________________________________
> Learn mailing list
> Learn-at-nylxs.com
> http://lists.mrbrklyn.com/mailman/listinfo/learn
_______________________________________________
Learn mailing list
Learn-at-nylxs.com
http://lists.mrbrklyn.com/mailman/listinfo/learn
|
|
