2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
23 // http://evolution.genetics.washington.edu/phylip/newick_doc.html
24 // TODO: Implement Basic NHX tag parsing and preservation
25 // TODO: http://evolution.genetics.wustl.edu/eddy/forester/NHX.html
26 // TODO: Extended SequenceNodeI to hold parsed NHX strings
29 import java.util.Locale;
31 import jalview.datamodel.BinaryNode;
32 import jalview.datamodel.SequenceNode;
33 import jalview.util.MessageManager;
35 import java.io.BufferedReader;
37 import java.io.FileReader;
38 import java.io.IOException;
39 import java.util.StringTokenizer;
41 import com.stevesoft.pat.Regex;
44 * Parse a new hanpshire style tree Caveats: NHX files are NOT supported and the
45 * tree distances and topology are unreliable when they are parsed. TODO: on
46 * this: NHX codes are appended in comments beginning with &&NHX. The codes are
47 * given below (from http://www.phylosoft.org/forester/NHX.html): Element Type
48 * Description Corresponding phyloXML element (parent element in parentheses) no
49 * tag string name of this node/clade (MUST BE FIRST, IF ASSIGNED)
50 * <name>(<clade>) : decimal branch length to parent node (MUST BE SECOND, IF
51 * ASSIGNED) <branch_length>(<clade>) :GN= string gene name <name>(<sequence>)
52 * :AC= string sequence accession <accession>(<sequence>) :ND= string node
53 * identifier - if this is being used, it has to be unique within each phylogeny
54 * <node_id>(<clade>) :B= decimal confidence value for parent branch
55 * <confidence>(<clade>) :D= 'T', 'F', or '?' 'T' if this node represents a
56 * duplication event - 'F' if this node represents a speciation event, '?' if
57 * this node represents an unknown event (D= tag should be replaced by Ev= tag)
58 * n/a :Ev=duplications>speciations>gene losses>event type>duplication type int
59 * int int string string event (replaces the =D tag), number of duplication,
60 * speciation, and gene loss events, type of event (transfer, fusion, root,
61 * unknown, other, speciation_duplication_loss, unassigned) <events>(<clade>)
62 * :E= string EC number at this node <annotation>(<sequence>) :Fu= string
63 * function at this node <annotation>(<sequence>)
64 * :DS=protein-length>from>to>support>name>from>... int int int double string
65 * int ... domain structure at this node <domain_architecture>(<sequence>) :S=
66 * string species name of the species/phylum at this node <taxonomy>(<clade>)
67 * :T= integer taxonomy ID of the species/phylum at this node <id>(<taxonomy>)
68 * :W= integer width of parent branch <width>(<clade>) :C=rrr.ggg.bbb
69 * integer.integer.integer color of parent branch <color>(<clade>) :Co= 'Y' or
70 * 'N' collapse this node when drawing the tree (default is not to collapse) n/a
71 * :XB= string custom data associated with a branch <property>(<clade>) :XN=
72 * string custom data associated with a node <property>(<clade>) :O= integer
73 * orthologous to this external node n/a :SN= integer subtree neighbors n/a :SO=
74 * integer super orthologous (no duplications on paths) to this external node
80 public class NewickFile extends FileParse
84 private boolean HasBootstrap = false;
86 private boolean HasDistances = false;
88 private boolean RootHasDistance = false;
91 boolean ReplaceUnderscores = false;
93 boolean printRootInfo = true;
95 private Regex[] NodeSafeName = new Regex[] {
96 new Regex().perlCode("m/[\\[,:'()]/"), // test for
99 new Regex().perlCode("s/'/''/"), // escaping quote
101 new Regex().perlCode("s/\\/w/_/") // unqoted whitespace
105 char QuoteChar = '\'';
108 * Creates a new NewickFile object.
113 * @throws IOException
116 public NewickFile(String inStr) throws IOException
118 super(inStr, DataSourceType.PASTE);
122 * Creates a new NewickFile object.
129 * @throws IOException
132 public NewickFile(String inFile, DataSourceType protocol)
135 super(inFile, protocol);
138 public NewickFile(FileParse source) throws IOException
144 * Creates a new NewickFile object.
149 public NewickFile(BinaryNode newtree)
155 * Creates a new NewickFile object.
162 public NewickFile(SequenceNode newtree, boolean bootstrap)
164 HasBootstrap = bootstrap;
169 * Creates a new NewickFile object.
178 public NewickFile(BinaryNode newtree, boolean bootstrap,
182 HasBootstrap = bootstrap;
183 HasDistances = distances;
187 * Creates a new NewickFile object.
195 * @param rootdistance
198 public NewickFile(BinaryNode newtree, boolean bootstrap,
199 boolean distances, boolean rootdistance)
202 HasBootstrap = bootstrap;
203 HasDistances = distances;
204 RootHasDistance = rootdistance;
221 * @return DOCUMENT ME!
223 private String ErrorStringrange(String Error, String Er, int r, int p,
226 return ((Error == null) ? "" : Error) + Er + " at position " + p + " ( "
227 + s.substring(((p - r) < 0) ? 0 : (p - r),
228 ((p + r) > s.length()) ? s.length() : (p + r))
233 // These are set automatically by the reader
234 public boolean HasBootstrap()
242 * @return DOCUMENT ME!
244 public boolean HasDistances()
249 public boolean HasRootDistance()
251 return RootHasDistance;
255 * parse the filesource as a newick file (new hampshire and/or extended)
257 * @throws IOException
258 * with a line number and character position for badly formatted NH
261 public void parse() throws IOException
265 { // fill nf with complete tree file
267 StringBuffer file = new StringBuffer();
269 while ((nf = nextLine()) != null)
274 nf = file.toString();
277 root = new SequenceNode();
279 BinaryNode realroot = null;
284 // int flen = nf.length();
287 String nodename = null;
288 String commentString2 = null; // comments after simple node props
290 double DefDistance = (float) 0.001; // @param Default distance for a node -
292 int DefBootstrap = -1; // @param Default bootstrap for a node
294 double distance = DefDistance;
295 int bootstrap = DefBootstrap;
297 boolean ascending = false; // flag indicating that we are leaving the
300 Regex majorsyms = new Regex("[(\\['),;]");
304 boolean parsednodename = false;
305 while (majorsyms.searchFrom(nf, cp) && (Error == null))
307 int fcp = majorsyms.matchedFrom();
309 switch (schar = nf.charAt(fcp))
313 // ascending should not be set
317 Error = ErrorStringrange(Error, "Unexpected '('", 7, fcp, nf);
323 if (c.right() == null)
325 c.setRight(new SequenceNode(null, c, null, DefDistance,
326 DefBootstrap, false));
327 c = (BinaryNode) c.right();
331 if (c.left() != null)
333 // Dummy node for polytomy - keeps c.left free for new node
334 BinaryNode tmpn = new SequenceNode(null, c, null, 0, 0, true);
335 tmpn.SetChildren(c.left(), c.right());
339 c.setLeft(new SequenceNode(null, c, null, DefDistance,
340 DefBootstrap, false));
341 c = (BinaryNode) c.left();
344 if (realroot == null)
350 distance = DefDistance;
351 bootstrap = DefBootstrap;
356 // Deal with quoted fields
359 Regex qnodename = new Regex("'([^']|'')+'");
361 if (qnodename.searchFrom(nf, fcp))
363 int nl = qnodename.stringMatched().length();
364 nodename = new String(
365 qnodename.stringMatched().substring(1, nl - 1));
366 // unpack any escaped colons
367 Regex xpandquotes = Regex.perlCode("s/''/'/");
368 String widernodename = xpandquotes.replaceAll(nodename);
369 nodename = widernodename;
370 // jump to after end of quoted nodename
371 nextcp = fcp + nl + 1;
372 parsednodename = true;
376 Error = ErrorStringrange(Error,
377 "Unterminated quotes for nodename", 7, fcp, nf);
387 Error = ErrorStringrange(Error,
388 "Wayward semicolon (depth=" + d + ")", 7, fcp, nf);
390 // cp advanced at the end of default
394 // node string contains Comment or structured/extended NH format info
396 * if ((fcp-cp>1 && nf.substring(cp,fcp).trim().length()>1)) { // will
397 * process in remains System.err.println("skipped text:
398 * '"+nf.substring(cp,fcp)+"'"); }
400 // verify termination.
401 Regex comment = new Regex("]");
402 if (comment.searchFrom(nf, fcp))
404 // Skip the comment field
405 nextcp = comment.matchedFrom() + 1;
406 warningMessage = "Tree file contained comments which may confuse input algorithm.";
409 // cp advanced at the end of default to nextcp, ncp is unchanged so
410 // any node info can be read.
414 Error = ErrorStringrange(Error, "Unterminated comment", 3, fcp,
418 // Parse simpler field strings
419 String fstring = nf.substring(ncp, fcp);
420 // remove any comments before we parse the node info
421 // TODO: test newick file with quoted square brackets in node name (is
423 while (fstring.indexOf(']') > -1)
425 int cstart = fstring.indexOf('[');
426 int cend = fstring.indexOf(']');
427 commentString2 = fstring.substring(cstart + 1, cend);
428 fstring = fstring.substring(0, cstart)
429 + fstring.substring(cend + 1);
432 Regex uqnodename = new Regex("\\b([^' :;\\](),]+)");
433 Regex nbootstrap = new Regex("\\s*([0-9+]+)\\s*:");
434 Regex ndist = new Regex(":([-0-9Ee.+]+)");
436 if (!parsednodename && uqnodename.search(fstring)
437 && ((uqnodename.matchedFrom(1) == 0) || (fstring
438 .charAt(uqnodename.matchedFrom(1) - 1) != ':'))) // JBPNote
441 if (nodename == null)
443 if (ReplaceUnderscores)
445 nodename = uqnodename.stringMatched(1).replace('_', ' ');
449 nodename = uqnodename.stringMatched(1);
454 Error = ErrorStringrange(Error,
455 "File has broken algorithm - overwritten nodename", 10,
459 // get comment bootstraps
461 if (nbootstrap.search(fstring))
463 if (nbootstrap.stringMatched(1)
464 .equals(uqnodename.stringMatched(1)))
466 nodename = null; // no nodename here.
468 if (nodename == null || nodename.length() == 0
469 || nbootstrap.matchedFrom(1) > (uqnodename.matchedFrom(1)
470 + uqnodename.stringMatched().length()))
474 bootstrap = (Integer.valueOf(nbootstrap.stringMatched(1)))
477 } catch (Exception e)
479 Error = ErrorStringrange(Error, "Can't parse bootstrap value",
480 4, ncp + nbootstrap.matchedFrom(), nf);
485 boolean nodehasdistance = false;
487 if (ndist.search(fstring))
491 distance = (Double.valueOf(ndist.stringMatched(1))).floatValue();
493 nodehasdistance = true;
494 } catch (Exception e)
496 Error = ErrorStringrange(Error,
497 "Can't parse node distance value", 7,
498 ncp + ndist.matchedFrom(), nf);
504 // Write node info here
506 // Trees without distances still need a render distance
507 c.dist = (HasDistances) ? distance : DefDistance;
508 // be consistent for internal bootstrap defaults too
509 c.setBootstrap((HasBootstrap) ? bootstrap : DefBootstrap);
512 RootHasDistance = nodehasdistance; // JBPNote This is really
513 // UGLY!!! Ensure root node gets
514 // its given distance
516 parseNHXNodeProps(c, commentString2);
517 commentString2 = null;
521 // Find a place to put the leaf
522 BinaryNode newnode = new SequenceNode(null, c, nodename,
523 (HasDistances) ? distance : DefDistance,
524 (HasBootstrap) ? bootstrap : DefBootstrap, false);
525 parseNHXNodeProps(c, commentString2);
526 commentString2 = null;
528 if (c.right() == null)
534 if (c.left() == null)
540 // Insert a dummy node for polytomy
541 // dummy nodes have distances
542 BinaryNode newdummy = new SequenceNode(null, c, null,
543 (HasDistances ? 0 : DefDistance), 0, true);
544 newdummy.SetChildren(c.left(), newnode);
552 // move back up the tree from preceding closure
555 if ((d > -1) && (c == null))
557 Error = ErrorStringrange(Error,
558 "File broke algorithm: Lost place in tree (is there an extra ')' ?)",
563 if (nf.charAt(fcp) == ')')
570 if (nf.charAt(fcp) == ',')
578 // Just advance focus, if we need to
579 if ((c.left() != null) && (!c.left().isLeaf()))
581 c = (BinaryNode) c.left();
587 // Reset new node properties to obvious fakes
589 distance = DefDistance;
590 bootstrap = DefBootstrap;
591 commentString2 = null;
592 parsednodename = false;
607 throw (new IOException(
608 MessageManager.formatMessage("exception.newfile", new String[]
609 { Error.toString() })));
613 throw (new IOException(
614 MessageManager.formatMessage("exception.newfile", new String[]
615 { MessageManager.getString("label.no_tree_read_in") })));
617 // THe next line is failing for topali trees - not sure why yet. if
618 // (root.right()!=null && root.isDummy())
619 root = (SequenceNode) root.right().detach(); // remove the imaginary root.
621 if (!RootHasDistance)
623 root.dist = (HasDistances) ? 0 : DefDistance;
628 * parse NHX codes in comment strings and update NewickFile state flags for
629 * distances and bootstraps, and add any additional properties onto the node.
632 * @param commentString
633 * @param commentString2
635 private void parseNHXNodeProps(BinaryNode c, String commentString)
637 // TODO: store raw comment on the sequenceNode so it can be recovered when
639 if (commentString != null && commentString.startsWith("&&NHX"))
641 StringTokenizer st = new StringTokenizer(commentString.substring(5),
643 while (st.hasMoreTokens())
645 String tok = st.nextToken();
646 int colpos = tok.indexOf("=");
650 String code = tok.substring(0, colpos);
651 String value = tok.substring(colpos + 1);
654 // parse out code/value pairs
655 if (code.toLowerCase(Locale.ROOT).equals("b"))
658 Float iv = Float.valueOf(value);
659 v = iv.intValue(); // jalview only does integer bootstraps
665 } catch (Exception e)
668 "Couldn't parse code '" + code + "' = '" + value + "'");
669 e.printStackTrace(System.err);
680 * @return DOCUMENT ME!
682 public BinaryNode getTree()
688 * Generate a newick format tree according to internal flags for bootstraps,
689 * distances and root distances.
691 * @return new hampshire tree in a single line
693 public String print()
697 StringBuffer tf = new StringBuffer();
700 return (tf.append(";").toString());
707 * Generate a newick format tree according to internal flags for distances and
708 * root distances and user specificied writing of bootstraps.
710 * @param withbootstraps
711 * controls if bootstrap values are explicitly written.
713 * @return new hampshire tree in a single line
715 public String print(boolean withbootstraps)
719 boolean boots = this.HasBootstrap;
720 this.HasBootstrap = withbootstraps;
723 this.HasBootstrap = boots;
731 * Generate newick format tree according to internal flags for writing root
734 * @param withbootstraps
735 * explicitly write bootstrap values
737 * explicitly write distances
739 * @return new hampshire tree in a single line
741 public String print(boolean withbootstraps, boolean withdists)
745 boolean dists = this.HasDistances;
746 this.HasDistances = withdists;
748 String rv = print(withbootstraps);
749 this.HasDistances = dists;
756 * Generate newick format tree according to user specified flags
758 * @param withbootstraps
759 * explicitly write bootstrap values
761 * explicitly write distances
762 * @param printRootInfo
763 * explicitly write root distance
765 * @return new hampshire tree in a single line
767 public String print(boolean withbootstraps, boolean withdists,
768 boolean printRootInfo)
772 boolean rootinfo = printRootInfo;
773 this.printRootInfo = printRootInfo;
775 String rv = print(withbootstraps, withdists);
776 this.printRootInfo = rootinfo;
785 * @return DOCUMENT ME!
798 * @return DOCUMENT ME!
800 char setQuoteChar(char c)
802 char old = QuoteChar;
814 * @return DOCUMENT ME!
816 private String nodeName(String name)
818 if (NodeSafeName[0].search(name))
820 return QuoteChar + NodeSafeName[1].replaceAll(name) + QuoteChar;
824 return NodeSafeName[2].replaceAll(name);
834 * @return DOCUMENT ME!
836 private String printNodeField(BinaryNode c)
838 return ((c.getName() == null) ? "" : nodeName(c.getName()))
839 + ((HasBootstrap) ? ((c.getBootstrap() > -1)
840 ? ((c.getName() != null ? " " : "") + c.getBootstrap())
842 + ((HasDistances) ? (":" + c.dist) : "");
851 * @return DOCUMENT ME!
853 private String printRootField(BinaryNode root)
855 return (printRootInfo)
856 ? (((root.getName() == null) ? "" : nodeName(root.getName()))
858 ? ((root.getBootstrap() > -1)
859 ? ((root.getName() != null ? " " : "")
860 + +root.getBootstrap())
863 + ((RootHasDistance) ? (":" + root.dist) : ""))
867 // Non recursive call deals with root node properties
868 public void print(StringBuffer tf, BinaryNode root)
872 if (root.isLeaf() && printRootInfo)
874 tf.append(printRootField(root));
880 _print(tf, root.right());
881 _print(tf, root.left());
886 _print(tf, root.right());
888 if (root.left() != null)
893 _print(tf, root.left());
894 tf.append(")" + printRootField(root));
900 // Recursive call for non-root nodes
901 public void _print(StringBuffer tf, BinaryNode c)
907 tf.append(printNodeField(c));
913 _print(tf, c.left());
914 if (c.left() != null)
918 _print(tf, c.right());
923 _print(tf, c.right());
925 if (c.left() != null)
930 _print(tf, c.left());
931 tf.append(")" + printNodeField(c));
942 public static void main(String[] args)
946 if (args == null || args.length != 1)
949 "Takes one argument - file name of a newick tree file.");
953 File fn = new File(args[0]);
955 StringBuffer newickfile = new StringBuffer();
956 BufferedReader treefile = new BufferedReader(new FileReader(fn));
959 while ((l = treefile.readLine()) != null)
961 newickfile.append(l);
965 System.out.println("Read file :\n");
967 NewickFile trf = new NewickFile(args[0], DataSourceType.FILE);
969 System.out.println("Original file :\n");
971 Regex nonl = new Regex("\n+", "");
972 System.out.println(nonl.replaceAll(newickfile.toString()) + "\n");
974 System.out.println("Parsed file.\n");
975 System.out.println("Default output type for original input.\n");
976 System.out.println(trf.print());
977 System.out.println("Without bootstraps.\n");
978 System.out.println(trf.print(false));
979 System.out.println("Without distances.\n");
980 System.out.println(trf.print(true, false));
981 System.out.println("Without bootstraps but with distanecs.\n");
982 System.out.println(trf.print(false, true));
983 System.out.println("Without bootstraps or distanecs.\n");
984 System.out.println(trf.print(false, false));
985 System.out.println("With bootstraps and with distances.\n");
986 System.out.println(trf.print(true, true));
987 } catch (java.io.IOException e)
989 System.err.println("Exception\n" + e);