Newer
Older
/* UserDataAlgorithm.java
*
* created: Wed May 10 2000
*
* This file is part of Artemis
*
* Copyright (C) 2000 Genome Research Limited
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* $Header: //tmp/pathsoft/artemis/uk/ac/sanger/artemis/plot/UserDataAlgorithm.java,v 1.10 2009-07-15 12:20:30 tjc Exp $
*/
package uk.ac.sanger.artemis.plot;
import uk.ac.sanger.artemis.sequence.*;
import uk.ac.sanger.artemis.util.*;
import uk.ac.sanger.artemis.io.ReadFormatException;
import java.awt.Color;
import java.util.HashMap;
/**
* Objects of this class have one useful method - getValues (), which takes a
* range of bases and returns a single floating point number. The number is
* calculated by averaging the values from a data file. The Strand to use is
* set in the constructor.
*
* @author Kim Rutherford <kmr@sanger.ac.uk>
* @version $Id: UserDataAlgorithm.java,v 1.10 2009-07-15 12:20:30 tjc Exp $
/** A base per line file format */
private static int BASE_PER_LINE_FORMAT = 1;
/** Base position is specified in the first column file format */
private static int BASE_SPECIFIED_FORMAT = 2;
/** Wiggle format */
private static int WIGGLE_VARIABLE_STEP_FORMAT = 3;
private static int WIGGLE_FIXED_STEP_FORMAT = 4;
/** The data read by the constructor - for BASE_PER_LINE_FORMAT */
/** The data read by the constructor - for BASE_SPECIFIED_FORMAT
- and WIGGLE_VARIABLE_STEP_FORMAT
- and WIGGLE_FIXED_STEP_FORMAT */
private HashMap<Integer, Float[]> dataMap;
/** The maximum value in the data array. */
/** The minimum value in the data array. */
/** Default window size */
private int default_window_size = 3;
/** The average calculated by readData (). */
/** The value returned by getValueCount (). */
private int number_of_values;
private boolean logTransform;
/** Format type for this instance */
private int FORMAT = BASE_PER_LINE_FORMAT;
public Wiggle wiggle[];
* Create a new UserDataAlgorithm object. This reads a file
* which can be one of two types of formats:
* a. one line of values per base.
* b. the first column specifies the base position with
* subsequent columns being values.
* @param strand The strand to do the calculation on.
* @param document The Document to read the data from.
* @param logTransform true if the log transformation is to be
* shown.
public UserDataAlgorithm (final Strand strand, final Document document,
final boolean logTransform)
throws IOException
{
super (strand, "User algorithm from " + document.getName (), "user");
LinePushBackReader pushback_reader = new LinePushBackReader (document_reader);
String first_line = pushback_reader.readLine ();
Pattern dataPattern = Pattern.compile("^\\s*([\\d\\.]+\\s*)+$");
if(dataPattern.matcher(first_line).matches())
FORMAT = BASE_PER_LINE_FORMAT;
else
StringBuffer header = new StringBuffer(first_line+"\n");
while(!dataPattern.matcher(first_line).matches())
first_line = pushback_reader.readLine ().trim();
header.append(first_line+"\n");
FORMAT = parseHeader(header);
final Pattern patt = Pattern.compile("\\s+");
String tokens[] = patt.split(first_line);
if (tokens.length < 1)
this.number_of_values = tokens.length;
if(FORMAT == BASE_PER_LINE_FORMAT)
data = new float [strand.getSequenceLength ()][tokens.length];
if(FORMAT == BASE_SPECIFIED_FORMAT ||
FORMAT == BASE_PER_LINE_FORMAT)
readData(pushback_reader);
else
readWiggle(pushback_reader);
}
/**
* Read all from buffered_reader into data.
**/
private void readData (final LinePushBackReader pushback_reader)
int countAll = 0;
int estimate_window_size = Integer.MAX_VALUE;
final int seqLength = getStrand ().getSequenceLength ();
final Pattern patt = Pattern.compile("\\s+");
while ((line = pushback_reader.readLine ()) != null)
{
throw new ReadFormatException ("too many values in input file");
String tokens[] = patt.split(line);
if (FORMAT == BASE_PER_LINE_FORMAT && tokens.length != data[0].length)
throw new ReadFormatException ("line has the wrong number of fields:\n"+line);
int base = 0;
Float line_data[] = new Float[tokens.length-1];
for (int i = 0 ; i < tokens.length ; ++i)
if( FORMAT == BASE_SPECIFIED_FORMAT &&
i == 0)
int last_base = base;
base = (int) Float.parseFloat(tokens[i]);
if(base > seqLength)
throw new ReadFormatException (
"a base position is greater than the sequence length:\n"+line);
if((base - last_base) < estimate_window_size &&
(base - last_base) > 0)
estimate_window_size = base - last_base;
if(dataMap == null)
dataMap = new HashMap<Integer, Float[]>();
continue;
}
float value = Float.parseFloat(tokens[i]);
if(logTransform)
value = (float) Math.log(value+1);
if (value > data_max)
data_max = value;
if (value < data_min)
data_min = value;
if(FORMAT == BASE_PER_LINE_FORMAT)
line_data[i-1] = value;
countAll++;
average_value += value;
}
catch (NumberFormatException e)
{
throw new ReadFormatException ("cannot understand this number: " +
tokens[i] + " - " +e.getMessage ());
if(FORMAT == BASE_SPECIFIED_FORMAT)
dataMap.put(base, line_data);
if (FORMAT == BASE_PER_LINE_FORMAT)
average_value /= data[0].length * seqLength;
else
{
average_value = average_value/countAll;
if(estimate_window_size != Integer.MAX_VALUE)
default_window_size = estimate_window_size;
}
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
/**
* Read all from buffered_reader into data.
**/
private void readWiggle (final LinePushBackReader pushback_reader)
throws IOException
{
String line = null;
int count = 0;
int stepCount = 0;
final int seqLength = getStrand ().getSequenceLength ();
final Pattern patt = Pattern.compile("\\s+");
dataMap = new HashMap<Integer, Float[]>();
this.number_of_values = 1;
while ((line = pushback_reader.readLine ()) != null)
{
if(line.startsWith("track"))
{
parseTrackLine(line);
continue;
}
else if(line.startsWith("variableStep ") ||
line.startsWith("fixedStep"))
{
FORMAT = parseWiggle(line);
stepCount = 0;
this.number_of_values++;
continue;
}
else if(line.startsWith("#"))
continue;
String tokens[] = patt.split(line.trim());
int base = 0;
int valueIndex = 0;
try
{
if(FORMAT == WIGGLE_VARIABLE_STEP_FORMAT)
{
base = (int) Float.parseFloat(tokens[0]);
valueIndex = 1;
}
else
{
base = wiggle[wiggle.length-1].start +
(stepCount*wiggle[wiggle.length-1].step);
}
if(base > seqLength)
throw new ReadFormatException (
"the base position ("+base+") is greater than the sequence length:\n"+line);
float value = Float.parseFloat(tokens[valueIndex]);
if(logTransform)
value = (float) Math.log(value+1);
if (value > data_max)
data_max = value;
if (value < data_min)
data_min = value;
Float valueArray[] = new Float[number_of_values];
valueArray[number_of_values-1] = value;
dataMap.put(base, valueArray);
count++;
stepCount++;
average_value += value;
}
catch (NumberFormatException e)
{
throw new ReadFormatException ("cannot understand this number: " +
tokens[valueIndex] + " - " +e.getMessage ());
}
}
average_value = average_value/count;
default_window_size = 1;
}
/**
* Return the value of the function between a pair of bases.
* @param start The start base (included in the range).
* @param end The end base (included in the range).
* @param values The one return value for this algorithm is returned in
* this array.
**/
public void getValues (int start, int end, final float [] values)
{
if(getStrand ().getDirection() == Bases.REVERSE)
{
int tstart = start;
int tend = end;
end = getStrand().getBases().getComplementPosition(tstart);
start = getStrand().getBases().getComplementPosition(tend);
}
if(FORMAT == BASE_SPECIFIED_FORMAT ||
FORMAT == WIGGLE_VARIABLE_STEP_FORMAT ||
FORMAT == WIGGLE_FIXED_STEP_FORMAT)
for (int i = 0 ; i < value_count ; ++i)
{
values[i] = 0;
int count = 0;
for (int base = start ; base <= end ; ++base)
{
if(dataMap.containsKey(base) &&
((Float[])dataMap.get(base)).length > i &&
((Float[])dataMap.get(base))[i] != null)
values[i] += ((Float[])dataMap.get(base))[i];
count++;
}
}
if(count > 1)
values[i] = values[i]/count;
}
}
else
{
for (int i = 0 ; i < value_count ; ++i)
{
values [i] = 0;
for (int base = start ; base <= end ; ++base)
values [i] += data[base - 1][i] / (end - start + 1);
}
* Determine the graph file format.
* Read the line colour from the header, there should be
* one per line and space separated.
* @param line
* @throws ReadFormatException
private int parseHeader(StringBuffer headerText) throws ReadFormatException
FORMAT = BASE_SPECIFIED_FORMAT;
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
BufferedReader reader = new BufferedReader(
new StringReader(headerText.toString()));
String line = null;
try
{
while ((line = reader.readLine()) != null)
{
if((line.indexOf("colour") == -1 &&
line.indexOf("color") == -1 ) ||
line.startsWith("track"))
{
if(line.startsWith("track "))
parseTrackLine(line);
else if(line.startsWith("variableStep ") ||
line.startsWith("fixedStep"))
FORMAT = parseWiggle(line);
continue;
}
int index = line.indexOf("colour");
if (index == -1)
index = line.indexOf("color");
index = line.indexOf(" ", index + 1);
line = line.substring(index).trim();
String rgbValues[] = line.split(" ");
lines = new LineAttributes[rgbValues.length];
for (int j = 0; j < rgbValues.length; j++)
lines[j] = new LineAttributes(LineAttributes.parse(rgbValues[j]));
}
}
catch (NumberFormatException e)
{
throw new ReadFormatException ("cannot understand this number: " +
line + " - " +e.getMessage ());
}
catch (Exception e)
{
e.printStackTrace();
}
return FORMAT;
}
/**
* http://genome.ucsc.edu/goldenPath/help/hgWiggleTrackHelp.html
*
* All options are placed in a single line separated by spaces:
*
* track type=wiggle_0 name=track_label description=center_label
* visibility=display_mode color=r,g,b altColor=r,g,b
* priority=priority autoScale=on|off
* gridDefault=on|off maxHeightPixels=max:default:min
* graphType=bar|points viewLimits=lower:upper
* yLineMark=real-value yLineOnOff=on|off
* windowingFunction=maximum|mean|minimum smoothingWindow=off|2-16
*
* @param trackLine
*/
private void parseTrackLine(String trackLine)
{
String colour = "0,0,0";
int beginIndex = trackLine.indexOf(" color=");
if(beginIndex > -1)
{
beginIndex+=7;
int endIndex = trackLine.indexOf(" ", beginIndex);
colour = trackLine.substring(beginIndex, endIndex);
}
incrementLines(LineAttributes.parse(colour));
}
private void incrementLines(Color colour)
{
LineAttributes line = new LineAttributes(colour);
if(lines == null)
lines = new LineAttributes[1];
else
LineAttributes linesTmp[] = new LineAttributes[lines.length];
System.arraycopy(lines, 0, linesTmp, 0, lines.length);
lines = new LineAttributes[linesTmp.length+1];
System.arraycopy(linesTmp, 0, lines, 0, linesTmp.length);
lines[lines.length-1] = line;
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
/**
* Wiggle formats (default: span=1) :
* variableStep chrom=chrN [span=windowSize]
* fixedStep chrom=chrN start=position step=stepInterval [span=windowSize]
* @param line
* @return
*/
private int parseWiggle(String line) throws NumberFormatException
{
if(line.startsWith("variableStep "))
FORMAT = WIGGLE_VARIABLE_STEP_FORMAT;
else if (line.startsWith("fixedStep "))
FORMAT = WIGGLE_FIXED_STEP_FORMAT;
if(wiggle == null)
{
wiggle = new Wiggle[lines.length];
for(int i=0; i<wiggle.length; i++)
wiggle[i] = new Wiggle();
}
else
{
Wiggle wiggleTmp[] = new Wiggle[wiggle.length];
System.arraycopy(wiggle, 0, wiggleTmp, 0, wiggle.length);
wiggle = new Wiggle[wiggleTmp.length+1];
System.arraycopy(wiggleTmp, 0, wiggle, 0, wiggleTmp.length);
wiggle[wiggle.length-1] = new Wiggle();
}
if(wiggle.length > lines.length)
incrementLines(lines[lines.length-1].getLineColour());
if(FORMAT == WIGGLE_FIXED_STEP_FORMAT)
{
wiggle[wiggle.length-1].start =
Integer.parseInt(getSubString(" start=" ,line));
wiggle[wiggle.length-1].step =
Integer.parseInt(getSubString(" step=" ,line));
}
int beginIndex = line.indexOf(" span=");
if(beginIndex > -1)
{
wiggle[wiggle.length-1].span =
Integer.parseInt(getSubString(" span=" ,line));
}
return FORMAT;
}
/**
* Find the value of a key within a string.
* @param key
* @param line
* @return
*/
private String getSubString(String key, String line)
{
int beginIndex = line.indexOf(key)+key.length();
int endIndex = line.indexOf(" ", beginIndex);
if(endIndex == -1)
endIndex = line.length();
return line.substring(beginIndex, endIndex);
}
/**
* Return any LineAttributes read from the header (for
* BASE_SPECIFIED_FORMAT).
* @return
*/
public LineAttributes[] getLineAttributes()
{
return lines;
}
/**
* Return the number of values a call to getValues () will return - one
* in this case.
**/
if(FORMAT == BASE_SPECIFIED_FORMAT)
return number_of_values - 1;
return number_of_values;
}
/**
* Return the default or optimal window size.
* @return null is returned if this algorithm doesn't have optimal window
* size.
**/
return new Integer (default_window_size);
}
/**
* Return the default maximum window size for this algorithm.
* @return null is returned if this algorithm doesn't have maximum window
* size.
**/
return new Integer (100);
}
/**
* Return the default minimum window size for this algorithm.
* @return null is returned if this algorithm doesn't have minimum window
* size.
**/
return new Integer (1);
}
/**
* Return the default or optimal step size.
* @return null is returned if this algorithm doesn't have optimal step
* size.
**/
public Integer getDefaultStepSize (int window_size)
{
if (window_size > 10)
return null;
}
/**
* Return the maximum value of this algorithm.
**/
return new Float (data_max);
}
/**
* Return the minimum value of this algorithm.
**/
return new Float (data_min);
}
/**
* Return the average value of function over the whole strand.
**/
public int getWiggleStart(int index)
{
return wiggle[index].start;
}
public int getWiggleSpan(int index)
{
return wiggle[index].span;
}
public boolean isWiggleFormat()
{
if(FORMAT == WIGGLE_VARIABLE_STEP_FORMAT ||
FORMAT == WIGGLE_FIXED_STEP_FORMAT)
return true;
return false;
}
class Wiggle
{
int start;
int step;
int span = 0;
}