2 * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8)
3 * Copyright (C) 2012 J Procter, AM Waterhouse, LM Lui, J Engelhardt, G Barton, M Clamp, S Searle
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 of the License, or (at your option) any later version.
11 * Jalview is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty
13 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
14 * PURPOSE. See the GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License along with Jalview. If not, see <http://www.gnu.org/licenses/>.
29 * Read and write PileUp style MSF Files. This used to be the MSFFile class, and
30 * was written according to the EBI's idea of a subset of the MSF alignment
31 * format. But, that was updated to reflect current GCG style IO fashion, as
32 * found in Emboss (thanks David Martin!)
37 import jalview.datamodel.*;
38 import jalview.util.*;
40 public class PileUpfile extends MSFfile
44 * Creates a new MSFfile object.
51 * Creates a new MSFfile object.
61 public PileUpfile(String inFile, String type) throws IOException
66 public PileUpfile(FileParse source) throws IOException
74 * @return DOCUMENT ME!
78 return print(getSeqsAsArray());
81 public String print(SequenceI[] s)
83 StringBuffer out = new StringBuffer("PileUp");
92 int[] checksums = new int[s.length];
95 checksums[i] = checkSum(s[i].getSequenceAsString());
96 bigChecksum += checksums[i];
100 out.append(" MSF: " + s[0].getSequence().length
101 + " Type: P Check: " + bigChecksum % 10000 + " ..");
107 while ((i < s.length) && (s[i] != null))
109 String seq = s[i].getSequenceAsString();
110 out.append(" Name: " + printId(s[i]) + " oo Len: " + seq.length()
111 + " Check: " + checksums[i] + " Weight: 1.00");
114 if (seq.length() > max)
119 if (s[i].getName().length() > maxid)
121 maxid = s[i].getName().length();
141 int nochunks = (max / len) + 1;
143 if ((max % len) == 0)
148 for (i = 0; i < nochunks; i++)
152 while ((j < s.length) && (s[j] != null))
154 String name = printId(s[j]);
156 out.append(new Format("%-" + maxid + "s").form(name + " "));
158 for (int k = 0; k < 5; k++)
160 int start = (i * 50) + (k * 10);
161 int end = start + 10;
163 if ((end < s[j].getSequence().length)
164 && (start < s[j].getSequence().length))
166 out.append(s[j].getSequence(start, end));
179 if (start < s[j].getSequence().length)
181 out.append(s[j].getSequenceAsString().substring(start));
200 return out.toString();