bc[i] = (char) -i;
bc[i] = (char) -(i+1);
  public int matchedChildListDistance( BaseNode a, BranchNode b ) {    char[] ac = new char[a.getChildCount()];    char[] bc = new char[b.getChildCount()];    for( int i=0;i<a.getChildCount();i++)      ac[i]=(char) i;    for( int i=0;i<b.getChildCount();i++) {      BaseNode m = b.getBaseMatch();      if( m!= null && m.getParent() == a )        bc[i] = (char) m.getChildPos();      else        bc[i] = (char) -i;    }    return stringDist(ac,bc,1.0);//    return stringDist(a,b,a.getChildCount()+b.getChildCount(),matchedNodeChildComp);  }