1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
|
package tax;
import java.io.PrintStream;
import fileIO.ByteFile;
import fileIO.ByteFile1;
import fileIO.ByteFile2;
import fileIO.ByteStreamWriter;
import fileIO.FileFormat;
import fileIO.ReadWrite;
import shared.Parse;
import shared.Parser;
import shared.PreParser;
import shared.ReadStats;
import shared.Shared;
import shared.Timer;
import shared.Tools;
import stream.ConcurrentGenericReadInputStream;
import stream.FastaReadInputStream;
import structures.ByteBuilder;
import structures.IntList;
/**
* @author Brian Bushnell
* @date May 9, 2016
*
*/
public class FindAncestor {
public static void main(String[] args){
Timer t=new Timer();
FindAncestor x=new FindAncestor(args);
x.process(t);
//Close the print stream if it was redirected
Shared.closeStream(x.outstream);
}
public FindAncestor(String[] args){
{//Preparse block for help, config files, and outstream
PreParser pp=new PreParser(args, getClass(), false);
args=pp.args;
outstream=pp.outstream;
}
ReadWrite.USE_PIGZ=ReadWrite.USE_UNPIGZ=true;
ReadWrite.MAX_ZIP_THREADS=Shared.threads();
Parser parser=new Parser();
for(int i=0; i<args.length; i++){
String arg=args[i];
String[] split=arg.split("=");
String a=split[0].toLowerCase();
String b=split.length>1 ? split[1] : null;
if(parser.parse(arg, a, b)){
//do nothing
}else if(a.equals("table") || a.equals("gi") || a.equals("gitable")){
giTableFile=b;
}else if(a.equals("tree") || a.equals("taxtree")){
taxTreeFile=b;
}else if(a.equals("invalid")){
outInvalid=b;
}else if(a.equals("lines")){
maxLines=Long.parseLong(b);
if(maxLines<0){maxLines=Long.MAX_VALUE;}
}else if(a.equals("verbose")){
verbose=Parse.parseBoolean(b);
ByteFile1.verbose=verbose;
ByteFile2.verbose=verbose;
stream.FastaReadInputStream.verbose=verbose;
ConcurrentGenericReadInputStream.verbose=verbose;
stream.FastqReadInputStream.verbose=verbose;
ReadWrite.verbose=verbose;
}else{
outstream.println("Unknown parameter "+args[i]);
assert(false) : "Unknown parameter "+args[i];
// throw new RuntimeException("Unknown parameter "+args[i]);
}
}
if("auto".equalsIgnoreCase(taxTreeFile)){taxTreeFile=TaxTree.defaultTreeFile();}
if("auto".equalsIgnoreCase(giTableFile)){giTableFile=TaxTree.defaultTableFile();}
{//Process parser fields
overwrite=ReadStats.overwrite=parser.overwrite;
append=ReadStats.append=parser.append;
in1=parser.in1;
out1=parser.out1;
}
assert(FastaReadInputStream.settingsOK());
if(in1==null){throw new RuntimeException("Error - at least one input file is required.");}
if(!ByteFile.FORCE_MODE_BF2){
ByteFile.FORCE_MODE_BF2=false;
ByteFile.FORCE_MODE_BF1=true;
}
if(out1!=null && out1.equalsIgnoreCase("null")){out1=null;}
if(!Tools.testOutputFiles(overwrite, append, false, out1)){
outstream.println((out1==null)+", "+out1);
throw new RuntimeException("\n\noverwrite="+overwrite+"; Can't write to output files "+out1+"\n");
}
ffout1=FileFormat.testOutput(out1, FileFormat.TXT, null, true, overwrite, append, false);
ffoutInvalid=FileFormat.testOutput(outInvalid, FileFormat.TXT, null, true, overwrite, append, false);
ffin1=FileFormat.testInput(in1, FileFormat.TXT, null, true, true);
if(giTableFile!=null){
outstream.println("Loading gi table.");
GiToTaxid.initialize(giTableFile);
}
if(taxTreeFile!=null){
tree=TaxTree.loadTaxTree(taxTreeFile, outstream, true, true);
assert(tree.nameMap!=null);
}else{
tree=null;
throw new RuntimeException("No tree specified.");
}
lifeNode=tree.getNodeByName("life");
}
void process(Timer t){
ByteFile bf=ByteFile.makeByteFile(ffin1);
ByteStreamWriter bsw=new ByteStreamWriter(ffout1);
bsw.start();
bsw.print("#Name\tAncestor\tMajority\tTaxonomy...\n".getBytes());
ByteStreamWriter bswInvalid=null;
if(ffoutInvalid!=null){
bswInvalid=new ByteStreamWriter(ffoutInvalid);
bswInvalid.start();
}
// final HashArray1D counts=countTable ? new HashArray1D(256000, true) : null;
final IntList giList=new IntList();
final IntList tidList=new IntList();
final IntList traversal=new IntList();
byte[] line=bf.nextLine();
ByteBuilder bb=new ByteBuilder();
while(line!=null){
if(line.length>0){
if(maxLines>0 && linesProcessed>=maxLines){break;}
linesProcessed++;
bytesProcessed+=line.length;
giList.clear();
tidList.clear();
traversal.clear();
final int giCount=getGiNumbers(line, giList, ',');
final int ncbiCount=getTaxidNumbers(giList, tidList);
taxaCounted+=giCount;
taxaValid+=ncbiCount;
final boolean valid=(ncbiCount>0);
if(valid){
linesValid++;
int ancestor=findAncestor(tidList);
int majority=findMajority(tidList);
for(int i=0; i<line.length && line[i]!='\t'; i++){
bb.append(line[i]);
}
bb.tab();
bb.append(ancestor);
bb.tab();
bb.append(majority);
bb.tab();
fillTraversal(majority, traversal, true);
writeTraversal(traversal, bb);
bb.nl();
for(int i=0; i<tidList.size; i++){
final int id=tidList.get(i);
fillTraversal(id, traversal, true);
writeTraversal(traversal, bb);
bb.nl();
}
bsw.print(bb.toBytes());
bb.clear();
}else{
if(bswInvalid!=null){
bswInvalid.println(line);
}
}
}
line=bf.nextLine();
}
errorState|=bf.close();
if(bsw!=null){errorState|=bsw.poisonAndWait();}
if(bswInvalid!=null){errorState|=bswInvalid.poisonAndWait();}
t.stop();
outstream.println(Tools.timeLinesBytesProcessed(t, linesProcessed, bytesProcessed, 8));
outstream.println();
outstream.println("Valid Lines: \t"+linesValid);
outstream.println("Invalid Lines: \t"+(linesProcessed-linesValid));
// if(counts!=null){
// outstream.println("Unique Taxa: \t"+taxaCounted);
// }
if(errorState){
throw new RuntimeException(getClass().getName()+" terminated in an error state; the output may be corrupt.");
}
}
private void fillTraversal(int id, IntList traversal, boolean addLife){
traversal.clear();
for(TaxNode node=tree.getNode(id); node!=null && node!=lifeNode; node=tree.getNode(node.pid)){
traversal.add(node.id);
}
if(addLife || traversal.size==0){traversal.add(lifeNode.id);}
}
private void writeTraversal(IntList traversal, ByteBuilder bb){
for(int i=traversal.size-1; i>=0; i--){
final int id=traversal.get(i);
if(id>=0){
TaxNode tn=tree.getNode(id);
// bb.append(tn.level+"_"+tn.name);
bb.append(/*tn.level+"_"+*/tn.name);
if(i>0){bb.tab();}
}
}
}
private int getGiNumbers(final byte[] line, final IntList list, final char delimiter){
int i=0;
//Skip name
while(i<line.length && line[i]!='\t'){i++;}
//Skip whitespaces
while(i<line.length && Character.isWhitespace(line[i])){i++;}
while(i<line.length){
while(i<line.length && line[i]==delimiter){i++;}
int start=i;
while(i<line.length && line[i]!=delimiter){i++;}
final int stop=i;
if(Tools.startsWith(line, prefix, start)){start+=3;}
assert(start<stop) : "Badly formatted line at "+start+":\n"+new String(line);
// System.err.println(start+","+stop+",'"+new String(line).substring(start, stop)+"'");
if(start<stop){
final int number=Parse.parseInt(line, start, stop);
list.add(number);
}
}
return list.size;
}
private static int getTaxidNumbers(final IntList giList, final IntList ncbiList){
final int size=giList.size;
for(int i=0; i<size; i++){
final int gi=giList.get(i);
final int ncbi=GiToTaxid.getID(gi);
// System.err.println(gi+" -> "+ncbi);
if(ncbi>=0){ncbiList.add(ncbi);}
}
return ncbiList.size;
}
private int findAncestor(IntList list){
return findAncestor(tree, list);
}
public static int findAncestor(TaxTree tree, IntList list){
if(list.size<1){
assert(false);
return -1;
}
int ancestor=list.get(0);
for(int i=1; i<list.size && ancestor>-1; i++){
final int id=list.get(i);
// System.err.println(ancestor+"+"+id+" -> "+tree.commonAncestor(ancestor, id));
int x=tree.commonAncestor(ancestor, id);
if(x>-1){
ancestor=x;
}
}
// System.err.println("Ancestor node: "+tree.getNode(ancestor));
// System.err.println(list+" -> "+ancestor);
// if(ancestor<0){ancestor=lifeNode.id;}
return ancestor;
}
private int findMajority(IntList list){
if(list.size<3){return findAncestor(list);}
final int majority=list.size/2+1;
// System.err.println("Majority: "+majority);
for(int i=0; i<list.size; i++){
final int id=list.get(i);
TaxNode tn=tree.getNode(id);
// System.err.println("Found node "+tn);
assert(tn!=null) : "No node for id "+id;
if(tn!=null){
tree.percolateUp(tn, 1);
}
}
TaxNode best=lifeNode;
for(int i=0; i<list.size; i++){
final int id=list.get(i);
TaxNode tn=tree.getNode(id);
while(tn!=null && tn!=lifeNode){
if(tn.countSum>=majority && tn.levelExtended<best.levelExtended){
best=tn;
break;
}
tn=tree.getNode(tn.pid);
}
}
// System.err.println("Best node: "+best);
for(int i=0; i<list.size; i++){
final int id=list.get(i);
TaxNode tn=tree.getNode(id);
if(tn!=null){
tree.percolateUp(tn, -1);
}
}
return best.id;
}
/*--------------------------------------------------------------*/
/*--------------------------------------------------------------*/
private String in1=null;
private String out1=null;
private String outInvalid=null;
private String giTableFile=null;
private String taxTreeFile=null;
private final TaxTree tree;
private final TaxNode lifeNode;
/*--------------------------------------------------------------*/
private long taxaCounted=0;
private long taxaValid=0;
private long linesProcessed=0;
private long linesValid=0;
private long bytesProcessed=0;
private long maxLines=Long.MAX_VALUE;
// private boolean prefix=false;
private boolean countTable=true;
// private boolean keepInvalidSequence=false;
private final String prefix="gi|";
/*--------------------------------------------------------------*/
private final FileFormat ffin1;
private final FileFormat ffout1;
private final FileFormat ffoutInvalid;
/*--------------------------------------------------------------*/
private PrintStream outstream=System.err;
public static boolean verbose=false;
public boolean errorState=false;
private boolean overwrite=false;
private boolean append=false;
}
|