void write(final PrintWriter writer) { writer.printf("chain\t%f\t%s\t%d\t+\t%d\t%d\t%s\t%d\t%s\t%d\t%d\t%d\n", score, fromSequenceName, fromSequenceSize, fromChainStart, fromChainEnd, toSequenceName, toSequenceSize, (toOppositeStrand ? "-": "+"), toChainStart, toChainEnd, id); for (int i = 0; i < blockList.size() - 1; ++i) { final ContinuousBlock thisBlock = blockList.get(i); final ContinuousBlock nextBlock = blockList.get(i+1); final int fromGap = nextBlock.fromStart - thisBlock.getFromEnd(); final int toGap = nextBlock.toStart - thisBlock.getToEnd(); writer.printf("%d\t%d\t%d\n", thisBlock.blockLength, fromGap, toGap); } writer.printf("%d\n", blockList.get(blockList.size() - 1).blockLength); writer.println(); }
void write(final PrintWriter writer) { writer.printf("chain\t%f\t%s\t%d\t+\t%d\t%d\t%s\t%d\t%s\t%d\t%d\t%d\n", score, fromSequenceName, fromSequenceSize, fromChainStart, fromChainEnd, toSequenceName, toSequenceSize, (toNegativeStrand? "-": "+"), toChainStart, toChainEnd, id); for (int i = 0; i < blockList.size() - 1; ++i) { final ContinuousBlock thisBlock = blockList.get(i); final ContinuousBlock nextBlock = blockList.get(i+1); final int fromGap = nextBlock.fromStart - thisBlock.getFromEnd(); final int toGap = nextBlock.toStart - thisBlock.getToEnd(); writer.printf("%d\t%d\t%d\n", thisBlock.blockLength, fromGap, toGap); } writer.printf("%d\n", blockList.get(blockList.size() - 1).blockLength); writer.println(); }
void write(final PrintWriter writer) { writer.printf("chain\t%f\t%s\t%d\t+\t%d\t%d\t%s\t%d\t%s\t%d\t%d\t%d\n", score, fromSequenceName, fromSequenceSize, fromChainStart, fromChainEnd, toSequenceName, toSequenceSize, (toOppositeStrand ? "-": "+"), toChainStart, toChainEnd, id); for (int i = 0; i < blockList.size() - 1; ++i) { final ContinuousBlock thisBlock = blockList.get(i); final ContinuousBlock nextBlock = blockList.get(i+1); final int fromGap = nextBlock.fromStart - thisBlock.getFromEnd(); final int toGap = nextBlock.toStart - thisBlock.getToEnd(); writer.printf("%d\t%d\t%d\n", thisBlock.blockLength, fromGap, toGap); } writer.printf("%d\n", blockList.get(blockList.size() - 1).blockLength); writer.println(); }
if (block.fromStart >= end) { break; } else if (block.getFromEnd() <= start) { continue; if (block.getFromEnd() > end) { offsetFromEnd = block.getFromEnd() - end; } else { offsetFromEnd = 0; int thisIntersection = Math.min(end, block.getFromEnd()) - Math.max(start, block.fromStart); if (thisIntersection <= 0) { throw new SAMException("Should have been some intersection.");
if (lastBlock.getFromEnd() != fromChainEnd) { throw new SAMException("Last block from end != chain from end for chain " + id); final ContinuousBlock thisBlock = blockList.get(i); final ContinuousBlock prevBlock = blockList.get(i-1); if (thisBlock.fromStart < prevBlock.getFromEnd()) { throw new SAMException("Continuous block " + i + " from starts before previous block ends for chain " + id);
if (block.fromStart >= end) { break; } else if (block.getFromEnd() <= start) { continue; if (block.getFromEnd() > end) { offsetFromEnd = block.getFromEnd() - end; } else { offsetFromEnd = 0; int thisIntersection = Math.min(end, block.getFromEnd()) - Math.max(start, block.fromStart); if (thisIntersection <= 0) { throw new SAMException("Should have been some intersection.");
if (lastBlock.getFromEnd() != fromChainEnd) { throw new SAMException("Last block from end != chain from end for chain " + id); final ContinuousBlock thisBlock = blockList.get(i); final ContinuousBlock prevBlock = blockList.get(i-1); if (thisBlock.fromStart < prevBlock.getFromEnd()) { throw new SAMException("Continuous block " + i + " from starts before previous block ends for chain " + id);
if (lastBlock.getFromEnd() != fromChainEnd) { throw new SAMException("Last block from end != chain from end for chain " + id); final ContinuousBlock thisBlock = blockList.get(i); final ContinuousBlock prevBlock = blockList.get(i-1); if (thisBlock.fromStart < prevBlock.getFromEnd()) { throw new SAMException("Continuous block " + i + " from starts before previous block ends for chain " + id);
if (block.fromStart >= end) { break; } else if (block.getFromEnd() <= start) { continue; if (block.getFromEnd() > end) { offsetFromEnd = block.getFromEnd() - end; } else { offsetFromEnd = 0; int thisIntersection = Math.min(end, block.getFromEnd()) - Math.max(start, block.fromStart); if (thisIntersection <= 0) { throw new SAMException("Should have been some intersection.");