Dot-star file format - Revision history

Christoph at 04:57, 13 September 2006

2006-09-13T04:57:55Z

Christoph: more format + info.

2006-01-03T19:31:55Z

more format + info.

Christoph: Added more info. + format

2006-01-03T19:22:33Z

Added more info. + format

Show changes

Christoph: /* Example#2 */ Added more info.

2006-01-03T19:05:36Z

‎Example#2: Added more info.

Christoph: Added another example

2006-01-03T17:52:51Z

Added another example

Christoph: Started article

2006-01-03T17:37:31Z

Started article

New page

The '''dot-star file format''' (or "'''.* format'''") is a standard used in [[phylogenetics]] to represent the partition of trees as clades.

; dots ("<tt>.</tt>") : for the [[Taxon|taxa]] that are on one side of the partition
; stars ("<tt>*</tt>") : for the [[Taxon|taxa]] that are on the other side of the partition

Example dot-star file:
<pre>
***************************...****************** 408
***************************...*.**************** 446
.................**....**.****.***.............. 197
***********************..*******.*************** 185
*****************..*******.******.************** 138
.......................**..***.**............... 72
111111111111111111111112211333132111111111111111
</pre>

The columns of stars and dots in the table represent the sequences in the dataset, 1 to n from left to right. Each row represents the separation of the sequences into two groups (clades), the stars and the dots. The branch tahat separates the star clade from the dot clade occurs in the resampled trees the number of times indicated at the right end of each line out of the total number of resamplings. Thus the validity of any predicted branch can be quantified.

=== Another example ===
For each taxonomic assignment in your database data, you then check how many times the query sequence is a member of at least one partition (one of the two sets defined by an edge in the tree) which except for the query sequence only counts sequences belonging to that taxonomic assignment as its members.

For example, if you have 8 database sequences and sequence 1, 2, 3, and 5 belong to group 'waggadoodles', and you have the following output:

<pre>
1: ...*.***.
2: *.......*
3: .*......*
4: ******..*
5: ..**....*
</pre>

where the last sequence is the query sequence, then the probability of the query sequence belonging to the waggadoodles is 60% because it formed a unqiue ([[Phylogenetics#Groups|monophyletic]]) group with at least some waggadoodles in 3 out of 5 cases (case 1, 2 and 3).

[[Category:Academic Research]]
[[Category:Phylogenetics]]

@@ Line 4: / Line 4: @@
 ; stars ("<tt>*</tt>") : for the taxa that are on the other side of the partition
-Example dot-star file:
+== Example dot-star file ==
 <pre>
-***************************...****************** 408
+..*********    651
-***************************...*.**************** 446
+*********..    736
-.................**....**.****.***.............. 197
+**..*******    620
-***********************..*******.*************** 185
+******.**..    103
-*****************..*******.******.************** 138
+******..*..     88
-.......................**..***.**............... 72
+**..**..*..    125
-111111111111111111111112211333132111111111111111
+**..**.....    271
 </pre>
 The columns of stars and dots in the table represent the sequences in the dataset, 1 to n from left to right. Each row represents the separation of the sequences into two groups (clades), the stars and the dots. The branch tahat separates the star clade from the dot clade occurs in the resampled trees the number of times indicated at the right end of each line out of the total number of resamplings. Thus the validity of any predicted branch can be quantified.
-=== Example#1 ===
+== Simple Example ==
 For each taxonomic assignment in your database data, you then check how many times the query sequence is a member of at least one partition (one of the two sets defined by an edge in the tree) which except for the query sequence only counts sequences belonging to that taxonomic assignment as its members.
@@ Line 32: / Line 52: @@
 where the last sequence is the query sequence, then the probability of the query sequence belonging to the waggadoodles is 60% because it formed a unqiue ([[Phylogenetics#Groups|monophyletic]]) group with at least some waggadoodles in 3 out of 5 cases (case 1, 2 and 3).
-=== Example#2===
+== Complex Example ==
 A taxon bibartition is specified by removing a branch, thereby dividing the species into those to the left and those to the right of the branch. Here, taxa to one side of the removed branch are denoted "." and those to the other side are denoted "*". The output includes the bipartition number (ID; sorted from highest to lowest probability), bipartition (e.g., ...**..), number of times the bipartition was observed (#obs), the posterior probability of the bipartition, and, if branch lengths were recorded on the trees in the file, the average (Mean(v)) and variance (Var(v)) of the lengths. Each "." or "*" in the bipartition represents a taxon that is to the left or right of the removed branch. A list of the taxa in the bipartition is given before the list of bipartitions.

← Older revision		Revision as of 19:05, 3 January 2006
Line 33:		Line 33:

	=== Example#2===		=== Example#2===
		+
		+	A taxon bibartition is specified by removing a branch, thereby dividing the species into those to the left and those to the right of the branch. Here, taxa to one side of the removed branch are denoted "." and those to the other side are denoted "". The output includes the bipartition number (ID; sorted from highest to lowest probability), bipartition (e.g., .....), number of times the bipartition was observed (#obs), the posterior probability of the bipartition, and, if branch lengths were recorded on the trees in the file, the average (Mean(v)) and variance (Var(v)) of the lengths. Each "." or "" in the bipartition represents a taxon that is to the left or right of the removed branch. A list of the taxa in the bipartition is given before the list of bipartitions.

	The first partition (ID 1) is the terminal branch leading to taxon 8 since it has a star in the 8th position and a dot in all other positions). Then it gives the number of times the partition was sampled (<tt>#obs</tt>), the probability of the partition (<tt>Probab.</tt>), the standard deviation of the partition frequency (<tt>Stdev(s)</tt>), the mean (<tt>Mean(v)</tt>) and variance (<tt>Var(v)</tt>) of the branch length, the Potential Scale Reduction Factor (<tt>PSRF</tt>), and finally the number of runs in which the partition was sampled (Nruns). In our analysis, there is overwhelming support for a single tree, so all partitions have a posterior probability of 1.0.		The first partition (ID 1) is the terminal branch leading to taxon 8 since it has a star in the 8th position and a dot in all other positions). Then it gives the number of times the partition was sampled (<tt>#obs</tt>), the probability of the partition (<tt>Probab.</tt>), the standard deviation of the partition frequency (<tt>Stdev(s)</tt>), the mean (<tt>Mean(v)</tt>) and variance (<tt>Var(v)</tt>) of the branch length, the Potential Scale Reduction Factor (<tt>PSRF</tt>), and finally the number of runs in which the partition was sampled (Nruns). In our analysis, there is overwhelming support for a single tree, so all partitions have a posterior probability of 1.0.

@@ Line 117: / Line 117: @@
 </pre>
-[[Category:Academic Research]]
+{{Phylogenetics}}
 [[Category:Phylogenetics]]