[med-svn] [trinityrnaseq] 02/04: Imported Upstream version 2.0.4+dfsg

Michael Crusoe misterc-guest at moszumanska.debian.org
Mon Feb 16 07:10:15 UTC 2015


This is an automated email from the git hooks/post-receive script.

misterc-guest pushed a commit to branch master
in repository trinityrnaseq.

commit a0eedbeae8505cb73c9c1b6445bd93a69176e7dd
Author: Michael R. Crusoe <mcrusoe at msu.edu>
Date:   Mon Feb 16 00:51:21 2015 -0500

    Imported Upstream version 2.0.4+dfsg
---
 Analysis/DifferentialExpression/run_DE_analysis.pl |   11 +-
 Butterfly/Butterfly.jar                            |  Bin 1427334 -> 0 bytes
 Butterfly/prev_vers/Butterfly_r2013_08_14.jar      |  Bin 1150829 -> 0 bytes
 Butterfly/src/src/jaligner/Alignment.java          |  692 ---
 Butterfly/src/src/jaligner/Cell.java               |   98 -
 Butterfly/src/src/jaligner/Directions.java         |   44 -
 Butterfly/src/src/jaligner/Markups.java            |   47 -
 Butterfly/src/src/jaligner/NeedlemanWunsch.java    |  304 --
 .../src/src/jaligner/NeedlemanWunschGotoh.java     |  432 --
 Butterfly/src/src/jaligner/Sequence.java           |  250 --
 Butterfly/src/src/jaligner/SmithWatermanGotoh.java |  388 --
 Butterfly/src/src/jaligner/TracebackNode.java      |   99 -
 .../jaligner/example/NeedlemanWunschExample.java   |   74 -
 .../example/NeedlemanWunschGotohExample.java       |   76 -
 .../example/SmithWatermanGotohExample.java         |  112 -
 Butterfly/src/src/jaligner/example/package.html    |    8 -
 .../src/jaligner/example/sequences/p53_human.fasta |    7 -
 .../src/jaligner/example/sequences/p53_mouse.fasta |    8 -
 Butterfly/src/src/jaligner/formats/CLUSTAL.java    |  121 -
 Butterfly/src/src/jaligner/formats/FASTA.java      |   79 -
 Butterfly/src/src/jaligner/formats/Format.java     |   59 -
 .../src/src/jaligner/formats/FormatFactory.java    |   84 -
 Butterfly/src/src/jaligner/formats/Pair.java       |  191 -
 Butterfly/src/src/jaligner/formats/package.html    |    8 -
 .../src/src/jaligner/matrix/MatricesCompartor.java |   68 -
 Butterfly/src/src/jaligner/matrix/Matrix.java      |   80 -
 .../src/src/jaligner/matrix/MatrixGenerator.java   |   61 -
 .../src/src/jaligner/matrix/MatrixLoader.java      |  243 -
 .../src/jaligner/matrix/MatrixLoaderException.java |   39 -
 .../src/src/jaligner/matrix/matrices/BLOSUM100     |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM30      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM35      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM40      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM45      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM50      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM55      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM60      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM62      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM65      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM70      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM75      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM80      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM85      |   31 -
 .../src/src/jaligner/matrix/matrices/BLOSUM90      |   31 -
 Butterfly/src/src/jaligner/matrix/matrices/BLOSUMN |   31 -
 Butterfly/src/src/jaligner/matrix/matrices/DAYHOFF |   32 -
 .../src/src/jaligner/matrix/matrices/EDNAFULL      |   25 -
 Butterfly/src/src/jaligner/matrix/matrices/GONNET  |   26 -
 .../src/src/jaligner/matrix/matrices/IDENTITY      |   25 -
 Butterfly/src/src/jaligner/matrix/matrices/MATCH   |   25 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM10   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM100  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM110  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM120  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM130  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM140  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM150  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM160  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM170  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM180  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM190  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM20   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM200  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM210  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM220  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM230  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM240  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM250  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM260  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM270  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM280  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM290  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM30   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM300  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM310  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM320  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM330  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM340  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM350  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM360  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM370  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM380  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM390  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM40   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM400  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM410  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM420  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM430  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM440  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM450  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM460  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM470  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM480  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM490  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM50   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM500  |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM60   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM70   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM80   |   34 -
 Butterfly/src/src/jaligner/matrix/matrices/PAM90   |   34 -
 Butterfly/src/src/jaligner/matrix/package.html     |    8 -
 Butterfly/src/src/jaligner/package.html            |    8 -
 .../jaligner/test/NeedlemanWunschGotohTester.java  |  131 -
 .../src/jaligner/test/NeedlemanWunschTester.java   |  129 -
 .../src/jaligner/test/RandomSequenceGenerator.java |   77 -
 .../jaligner/test/SmithWatermanGotohTester.java    |  131 -
 Butterfly/src/src/jaligner/test/package.html       |    8 -
 .../jaligner/ui/filechooser/NamedInputStream.java  |   67 -
 Butterfly/src/src/jaligner/util/Commons.java       |  222 -
 .../src/src/jaligner/util/SequenceParser.java      |  215 -
 .../src/jaligner/util/SequenceParserException.java |   38 -
 Butterfly/src/src/jaligner/util/package.html       |    8 -
 Makefile                                           |    4 +-
 Release.Notes                                      |   10 +-
 Trinity                                            |   72 +-
 sample_data/test_Trinity_Assembly/Makefile         |   10 +-
 .../__test_runMe_with_jaccard_clip.sh              |    6 -
 sample_data/test_Trinity_Assembly/cleanme.pl       |    2 +
 .../misc_run_tests/__runMe_with_qual_trimming.sh   |    2 +-
 ...__runMe_with_qual_trimming_and_normalization.sh |    2 +-
 .../__test_runMe_include_normalization.sh          |    2 +-
 .../__test_runMe_with_jaccard_clip.sh              |    2 +-
 trinity-plugins/GAL_0.2.1/README                   |    6 -
 trinity-plugins/GAL_0.2.1/fasta_tool               | 1053 -----
 trinity-plugins/Makefile                           |    4 +-
 trinity-plugins/TransDecoder_r20140704.tar.gz      |  Bin 21189681 -> 0 bytes
 trinity-plugins/Trimmomatic-0.32/LICENSE           |  674 ---
 .../Trimmomatic-0.32/adapters/NexteraPE-PE.fa      |   12 -
 .../Trimmomatic-0.32/adapters/TruSeq2-PE.fa        |   16 -
 .../Trimmomatic-0.32/adapters/TruSeq2-SE.fa        |    6 -
 .../Trimmomatic-0.32/adapters/TruSeq3-PE-2.fa      |   12 -
 .../Trimmomatic-0.32/adapters/TruSeq3-PE.fa        |    4 -
 .../Trimmomatic-0.32/adapters/TruSeq3-SE.fa        |    4 -
 .../Trimmomatic-0.32/trimmomatic-0.32.jar          |  Bin 118310 -> 0 bytes
 trinity-plugins/Trimmomatic-0.32/trimmomatic.jar   |    1 -
 trinity-plugins/collectl/Tests.py                  |  117 -
 trinity-plugins/collectl/build_collectl.sh         |   53 -
 trinity-plugins/collectl/collectl-3.6.9.src.tar.gz |  Bin 467637 -> 0 bytes
 trinity-plugins/collectl/collectl-3.7.4.src.tar.gz |  Bin 462752 -> 0 bytes
 trinity-plugins/collectl/make_data_files.py        |  181 -
 trinity-plugins/collectl/plot.py                   |  176 -
 trinity-plugins/collectl/timetable.py              |   33 -
 trinity-plugins/parafly-code/LICENSE               |   17 -
 trinity-plugins/parafly-code/Makefile.am           |    1 -
 trinity-plugins/parafly-code/Makefile.in           |  671 ---
 trinity-plugins/parafly-code/aclocal.m4            |  951 ----
 trinity-plugins/parafly-code/config.h              |   23 -
 trinity-plugins/parafly-code/config.h.in           |   22 -
 trinity-plugins/parafly-code/configure             | 4685 --------------------
 trinity-plugins/parafly-code/configure.ac          |   15 -
 trinity-plugins/parafly-code/depcomp               |  688 ---
 trinity-plugins/parafly-code/install-sh            |  527 ---
 trinity-plugins/parafly-code/missing               |  331 --
 trinity-plugins/parafly-code/src/Makefile.am       |    6 -
 trinity-plugins/parafly-code/src/Makefile.in       |  449 --
 trinity-plugins/parafly-code/src/ParaFly.cpp       |  268 --
 trinity-plugins/parafly-code/src/argProcessor.cpp  |   61 -
 trinity-plugins/parafly-code/src/argProcessor.hpp  |   31 -
 trinity-plugins/parafly-code/stamp-h1              |    1 -
 trinity-plugins/rsem-1.2.19.tar.gz                 |  Bin 9367568 -> 0 bytes
 util/align_and_estimate_abundance.pl               |    8 +-
 .../process_GMAP_alignments_gff3_chimeras_ok.pl    |    3 +-
 util/misc/run_GSNAP.pl                             |   51 +-
 util/support_scripts/tests.py                      |   40 +-
 164 files changed, 152 insertions(+), 18215 deletions(-)

diff --git a/Analysis/DifferentialExpression/run_DE_analysis.pl b/Analysis/DifferentialExpression/run_DE_analysis.pl
index a514d92..10b1cff 100755
--- a/Analysis/DifferentialExpression/run_DE_analysis.pl
+++ b/Analysis/DifferentialExpression/run_DE_analysis.pl
@@ -92,6 +92,8 @@ my $contrasts_file;
 
 my $reference_sample;
 
+my $make_tar_gz_file = 0;
+
 my ($DESEQ_method, $DESEQ_sharingMode, $DESEQ_fitType);
 
 
@@ -111,6 +113,7 @@ my ($DESEQ_method, $DESEQ_sharingMode, $DESEQ_fitType);
               'DESEQ_sharingMode=s' => \$DESEQ_sharingMode,
               'DESEQ_fitType=s' => \$DESEQ_fitType,
 
+              'tar_gz_outdir' => \$make_tar_gz_file,
 
     );
 
@@ -263,7 +266,13 @@ main: {
 
         }
     }
-        
+
+    if ($make_tar_gz_file) {
+        chdir $workdir or die "Error, cannot cd to $workdir";
+        my $cmd = "tar -zcvf $output_dir.tar.gz $output_dir";
+        &process_cmd($cmd);
+    }
+            
 
     exit(0);
 }
diff --git a/Butterfly/Butterfly.jar b/Butterfly/Butterfly.jar
deleted file mode 100644
index 21e2d54..0000000
Binary files a/Butterfly/Butterfly.jar and /dev/null differ
diff --git a/Butterfly/prev_vers/Butterfly_r2013_08_14.jar b/Butterfly/prev_vers/Butterfly_r2013_08_14.jar
deleted file mode 100644
index 4767a2c..0000000
Binary files a/Butterfly/prev_vers/Butterfly_r2013_08_14.jar and /dev/null differ
diff --git a/Butterfly/src/src/jaligner/Alignment.java b/Butterfly/src/src/jaligner/Alignment.java
deleted file mode 100644
index f279e72..0000000
--- a/Butterfly/src/src/jaligner/Alignment.java
+++ /dev/null
@@ -1,692 +0,0 @@
-/*
- * $Id: Alignment.java,v 1.11 2006/08/19 00:42:35 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-import jaligner.matrix.Matrix;
-import jaligner.util.Commons;
-
-import java.text.DecimalFormat;
-
-/**
- * Holds the output of a pairwise sequences alignment.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public final class Alignment {
-
-	/**
-	 * Gap character
-	 */
-	public static final char GAP = '-';
-
-	/**
-	 * Default name for sequence #1
-	 */
-	private static final String SEQUENCE1 = "jaligner_1";
-
-	/**
-	 * Default name for sequence #2
-	 */
-	private static final String SEQUENCE2 = "jaligner_2";
-
-	/**
-	 * Scoring matrix
-	 */
-	private Matrix matrix;
-
-	/**
-	 * Gap open cost
-	 */
-	private float open;
-
-	/**
-	 * Gap extend cost
-	 */
-	private float extend;
-
-	/**
-	 * Alignment score
-	 */
-	private float score;
-
-	/**
-	 * Aligned sequence #1
-	 */
-	private char[] sequence1;
-
-	/**
-	 * Name of sequence #1
-	 */
-	private String name1;
-
-	/**
-	 * Alignment start location in sequence #1
-	 */
-	private int start1;
-
-	/**
-	 * Aligned sequence #2
-	 */
-	private char[] sequence2;
-
-	/**
-	 * Name of sequence #2
-	 */
-	private String name2;
-
-	/**
-	 * Alignment start location in sequence #2
-	 */
-	private int start2;
-
-	/**
-	 * Markup line
-	 */
-	private char[] markupLine;
-
-	/**
-	 * Count of identical locations
-	 */
-	private int identity;
-
-	/**
-	 * Count of similar locations
-	 */
-	private int similarity;
-
-	/**
-	 * Count of gap locations
-	 */
-	private int gaps;
-
-	private Sequence originalSequence1;
-
-	private Sequence originalSequence2;
-
-	/**
-	 * Constructor for Alignment
-	 */
-
-	public Alignment() {
-		super();
-	}
-
-	/**
-	 * @return Returns the extend.
-	 */
-	public float getExtend() {
-		return extend;
-	}
-
-	/**
-	 * @param extend
-	 *            The extend to set.
-	 */
-	public void setExtend(float extend) {
-		this.extend = extend;
-	}
-
-	/**
-	 * @return Returns the matrix.
-	 */
-	public Matrix getMatrix() {
-		return matrix;
-	}
-
-	/**
-	 * @param matrix
-	 *            The matrix to set.
-	 */
-	public void setMatrix(Matrix matrix) {
-		this.matrix = matrix;
-	}
-
-	/**
-	 * @return Returns the name1.
-	 */
-	public String getName1() {
-		return name1 == null || name1.trim().length() == 0 ? SEQUENCE1 : name1;
-	}
-
-	/**
-	 * @param name1
-	 *            The name1 to set.
-	 */
-	public void setName1(String name1) {
-		this.name1 = name1;
-	}
-
-	/**
-	 * @return Returns the name2.
-	 */
-	public String getName2() {
-		return name2 == null || name2.trim().length() == 0 ? SEQUENCE2 : name2;
-	}
-
-	/**
-	 * @param name2
-	 *            The name2 to set.
-	 */
-	public void setName2(String name2) {
-		this.name2 = name2;
-	}
-
-	/**
-	 * @return Returns the open.
-	 */
-	public float getOpen() {
-		return open;
-	}
-
-	/**
-	 * @param open
-	 *            The open to set.
-	 */
-	public void setOpen(float open) {
-		this.open = open;
-	}
-
-	/**
-	 * @return Returns the score.
-	 */
-	public float getScore() {
-		return score;
-	}
-
-	/**
-	 * @param score
-	 *            The score to set.
-	 */
-	public void setScore(float score) {
-		this.score = score;
-	}
-
-	/**
-	 * Returns the length of the alignment
-	 * 
-	 * @return Alignment length
-	 */
-	public int getLength() {
-		return this.sequence1.length;
-	}
-
-	/**
-	 * @return Returns the sequence1.
-	 */
-	public char[] getSequence1() {
-		return sequence1;
-	}
-
-	/**
-	 * @param sequence1
-	 *            The sequence1 to set.
-	 */
-	public void setSequence1(char[] sequence1) {
-		this.sequence1 = sequence1;
-	}
-
-	/**
-	 * @return Returns the sequence2.
-	 */
-	public char[] getSequence2() {
-		return sequence2;
-	}
-
-	/**
-	 * @param sequence2
-	 *            The sequence2 to set.
-	 */
-	public void setSequence2(char[] sequence2) {
-		this.sequence2 = sequence2;
-	}
-
-	/**
-	 * @return Returns the start1.
-	 */
-	public int getStart1() {
-		return start1;
-	}
-
-	/**
-	 * @param start1
-	 *            The start1 to set.
-	 */
-	public void setStart1(int start1) {
-		this.start1 = start1;
-	}
-
-	/**
-	 * @return Returns the start2.
-	 */
-	public int getStart2() {
-		return start2;
-	}
-
-	/**
-	 * @param start2
-	 *            The start2 to set.
-	 */
-	public void setStart2(int start2) {
-		this.start2 = start2;
-	}
-
-	/**
-	 * @return Returns the gaps.
-	 */
-	public int getGaps() {
-		return gaps;
-	}
-
-	/**
-	 * @param gaps
-	 *            The gaps to set.
-	 */
-	public void setGaps(int gaps) {
-		this.gaps = gaps;
-	}
-
-	/**
-	 * @return Returns the identity.
-	 */
-	public int getIdentity() {
-		return identity;
-	}
-
-	/**
-	 * @param identity
-	 *            The identity to set.
-	 */
-	public void setIdentity(int identity) {
-		this.identity = identity;
-	}
-
-	/**
-	 * @return Returns the markupLine.
-	 */
-	public char[] getMarkupLine() {
-		return markupLine;
-	}
-
-	/**
-	 * @param markupLine
-	 *            The markupLine to set.
-	 */
-	public void setMarkupLine(char[] markupLine) {
-		this.markupLine = markupLine;
-	}
-
-	/**
-	 * @return Returns the similarity.
-	 */
-	public int getSimilarity() {
-		return similarity;
-	}
-
-	/**
-	 * @param similarity
-	 *            The similarity to set.
-	 */
-	public void setSimilarity(int similarity) {
-		this.similarity = similarity;
-	}
-
-	/**
-	 * Returns a summary for alignment
-	 * 
-	 * @return {@link String} alignment summary
-	 */
-	public String getSummary() {
-		StringBuffer buffer = new StringBuffer();
-		DecimalFormat f1 = new DecimalFormat("0.00");
-		DecimalFormat f2 = new DecimalFormat("0.00%");
-
-		int length = getSequence1().length;
-
-		buffer.append("Sequence #1: " + getName1());
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Sequence #2: " + getName2());
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Length #1: " + getOriginalSequence1().length());
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Length #2: " + getOriginalSequence2().length());
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Matrix: "
-				+ (matrix.getId() == null ? "" : matrix.getId()));
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Gap open: " + open);
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Gap extend: " + extend);
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Length: " + length);
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Identity: " + identity + "/" + length + " ("
-				+ f2.format(identity / (float) length) + ")");
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Similarity: " + similarity + "/" + length + " ("
-				+ f2.format(similarity / (float) length) + ")");
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Gaps: " + gaps + "/" + length + " ("
-				+ f2.format(gaps / (float) length) + ")");
-		buffer.append(Commons.getLineSeparator());
-		buffer.append("Score: " + f1.format(score));
-		buffer.append(Commons.getLineSeparator());
-
-		return buffer.toString();
-	}
-
-	/**
-	 * Calculate the score of the alignment, not using the score field (the
-	 * function only uses sequence1, sequence2, matrix and gap penalties).
-	 * 
-	 * @return the calculated score (By: Bram Minnaert)
-	 */
-	public float calculateScore() {
-		// The calculated score
-		float calcScore = 0;
-
-		// In the previous step there was a gap in the first sequence
-		boolean previous1wasGap = false;
-
-		// In the previous step there was a gap in the second sequence
-		boolean previous2wasGap = false;
-
-		int start = 0;
-		int end = sequence1.length - 1;
-
-		char c1, c2; // the next character
-		for (int i = start; i <= end; i++) {
-			c1 = sequence1[i];
-			c2 = sequence2[i];
-			// the next character in the first sequence is a gap
-			if (c1 == GAP) {
-				if (previous1wasGap) {
-					calcScore -= extend;
-				} else {
-					calcScore -= open;
-				}
-				previous1wasGap = true;
-				previous2wasGap = false;
-			}
-			// the next character in the second sequence is a gap
-			else if (c2 == GAP) {
-				if (previous2wasGap) {
-					calcScore -= extend;
-				} else {
-					calcScore -= open;
-				}
-				previous1wasGap = false;
-				previous2wasGap = true;
-			}
-			// the next characters in boths sequences are not gaps
-			else {
-				calcScore += matrix.getScore(c1, c2);
-				previous1wasGap = false;
-				previous2wasGap = false;
-			}
-		}
-		return calcScore;
-	}
-
-	/**
-	 * Calculate the score of the alignment without the terminal gaps.
-	 * 
-	 */
-	public float getScoreWithNoTerminalGaps() {
-		// The calculated score
-		float calcScore = 0;
-
-		// In the previous step there was a gap in the first sequence
-		boolean previous1wasGap = false;
-
-		// In the previous step there was a gap in the second sequence
-		boolean previous2wasGap = false;
-
-		int start = 0;
-		int end = sequence1.length - 1;
-
-		if (sequence1[start] == GAP) {
-			while (sequence1[start] == GAP) {
-				start++;
-			}
-		} else if (sequence2[start] == GAP) {
-			while (sequence2[start] == GAP) {
-				start++;
-			}
-		}
-
-		if (sequence1[end] == GAP) {
-			while (sequence1[end] == GAP) {
-				end--;
-			}
-		} else if (sequence2[end] == GAP) {
-			while (sequence2[end] == GAP) {
-				end--;
-			}
-		}
-
-		char c1, c2; // the next character
-		for (int i = start; i <= end; i++) {
-			c1 = sequence1[i];
-			c2 = sequence2[i];
-			// the next character in the first sequence is a gap
-			if (c1 == GAP) {
-				if (previous1wasGap) {
-					calcScore -= extend;
-				} else {
-					calcScore -= open;
-				}
-				previous1wasGap = true;
-				previous2wasGap = false;
-			}
-			// the next character in the second sequence is a gap
-			else if (c2 == GAP) {
-				if (previous2wasGap) {
-					calcScore -= extend;
-				} else {
-					calcScore -= open;
-				}
-				previous1wasGap = false;
-				previous2wasGap = true;
-			}
-			// the next characters in boths sequences are not gaps
-			else {
-				calcScore += matrix.getScore(c1, c2);
-				previous1wasGap = false;
-				previous2wasGap = false;
-			}
-		}
-		return calcScore;
-	}
-
-	/**
-	 * Check if the calculated score matches the field score.
-	 * 
-	 * @return true if equal, else false. (By: Bram Minnaert)
-	 */
-	public boolean checkScore() {
-		if (calculateScore() == score) {
-			return true;
-		} else {
-			return false;
-		}
-	}
-
-	/**
-	 * Returns original {@link Sequence} #1
-	 * 
-	 * @return original {@link Sequence} #1
-	 */
-	public Sequence getOriginalSequence1() {
-		return originalSequence1;
-	}
-
-	/**
-	 * 
-	 * @param originalSequence1
-	 */
-	public void setOriginalSequence1(Sequence originalSequence1) {
-		this.originalSequence1 = originalSequence1;
-	}
-
-	/**
-	 * Returns original {@link Sequence} #2
-	 * 
-	 * @return original {@link Sequence} #2
-	 */
-	public Sequence getOriginalSequence2() {
-		return originalSequence2;
-	}
-
-	/**
-	 * 
-	 * @param originalSequence2
-	 */
-	public void setOriginalSequence2(Sequence originalSequence2) {
-		this.originalSequence2 = originalSequence2;
-	}
-
-	/**
-	 * Returns the number of gaps of the aligned sequence #1
-	 * 
-	 * @return the number of gaps of the aligned sequence #1
-	 */
-	public int getGaps1() {
-		int count = 0;
-		for (int i = 0, n = sequence1.length; i < n; i++) {
-			if (sequence1[i] == Alignment.GAP) {
-				count++;
-			}
-		}
-		return count;
-	}
-
-	/**
-	 * Returns the number of gaps of the aligned sequence #2
-	 * 
-	 * @return the number of gaps of the aligned sequence #2
-	 */
-	public int getGaps2() {
-		int count = 0;
-		for (int i = 0, n = sequence2.length; i < n; i++) {
-			if (sequence2[i] == Alignment.GAP) {
-				count++;
-			}
-		}
-		return count;
-	}
-
-	/**
-	 * Adds this alignment to another alignment, the order is important.
-	 * 
-	 * @param a1
-	 *            The 1st alignment
-	 * @param a2
-	 *            The 2nd alignment
-	 * @return the sum of two alignment
-	 */
-	public static Alignment add(Alignment a1, Alignment a2) {
-
-		if (a1 == null) {
-			if (a2 == null) {
-				return null;
-			} else {
-				return copy(a2);
-			}
-		} else {
-			if (a2 == null) {
-				return copy(a1);
-			} else {
-				Alignment sum = new Alignment();
-
-				StringBuffer buffer = new StringBuffer();
-
-				buffer.append(a1.getOriginalSequence1());
-				buffer.append(a2.getOriginalSequence1());
-
-				sum.setOriginalSequence1(new Sequence(buffer.toString()));
-
-				buffer = new StringBuffer();
-
-				buffer.append(a1.getOriginalSequence2());
-				buffer.append(a2.getOriginalSequence2());
-
-				sum.setOriginalSequence2(new Sequence(buffer.toString()));
-
-				buffer = new StringBuffer();
-
-				buffer.append(a1.getSequence1());
-				buffer.append(a2.getSequence1());
-
-				sum.setSequence1(buffer.toString().toCharArray());
-
-				buffer = new StringBuffer();
-
-				buffer.append(a1.getSequence2());
-				buffer.append(a2.getSequence2());
-
-				sum.setSequence2(buffer.toString().toCharArray());
-
-				buffer = new StringBuffer();
-
-				buffer.append(a1.getMarkupLine());
-				buffer.append(a2.getMarkupLine());
-
-				sum.setMarkupLine(buffer.toString().toCharArray());
-
-				sum.setScore(a1.getScore() + a2.getScore());
-				sum.setGaps(a1.getGaps() + a2.getGaps());
-
-				sum.setStart1(a1.getStart1());
-				sum.setStart2(a1.getStart2());
-				sum.setExtend(a1.getExtend());
-				sum.setOpen(a1.getOpen());
-				sum.setMatrix(a1.getMatrix());
-
-				return sum;
-			}
-		}
-	}
-
-	/**
-	 * Copies an alignment to another alignment.
-	 * 
-	 * @param alignment
-	 *            Alignment
-	 */
-	public static Alignment copy(Alignment alignment) {
-
-		Alignment copy = new Alignment();
-
-		copy.setSequence1(alignment.getSequence1());
-		copy.setSequence2(alignment.getSequence2());
-		copy.setMarkupLine(alignment.getMarkupLine());
-		copy.setScore(alignment.getScore());
-		copy.setGaps(alignment.getGaps());
-		copy.setStart1(alignment.getStart1());
-		copy.setStart2(alignment.getStart2());
-		copy.setExtend(alignment.getExtend());
-		copy.setOpen(alignment.getOpen());
-		copy.setMatrix(alignment.getMatrix());
-		copy.setOriginalSequence1(alignment.getOriginalSequence1());
-		copy.setOriginalSequence2(alignment.getOriginalSequence2());
-
-		return copy;
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/Cell.java b/Butterfly/src/src/jaligner/Cell.java
deleted file mode 100644
index 165ce69..0000000
--- a/Butterfly/src/src/jaligner/Cell.java
+++ /dev/null
@@ -1,98 +0,0 @@
-/*
- * $Id: Cell.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-/**
- * A cell in a similarity matrix, to hold row, column and score.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class Cell {
-	/**
-	 * Row of the cell
-	 */
-	private int row;
-	/**
-	 * Column of the cell
-	 */
-	private int col;
-	/**
-	 * Alignment score at this cell
-	 */
-	private float score;
-	
-	/**
-	 * Constructor
-	 */
-	public Cell() {
-		super();
-		this.row = 0;
-		this.col = 0;
-		this.score = Float.NEGATIVE_INFINITY;
-	}
-	/**
-	 * @return Returns the col.
-	 */
-	public int getCol() {
-		return this.col;
-	}
-	/**
-	 * @param col The col to set.
-	 */
-	public void setCol(int col) {
-		this.col = col;
-	}
-	/**
-	 * @return Returns the row.
-	 */
-	public int getRow() {
-		return this.row;
-	}
-	/**
-	 * @param row The row to set.
-	 */
-	public void setRow(int row) {
-		this.row = row;
-	}
-	/**
-	 * @return Returns the score.
-	 */
-	public float getScore() {
-		return this.score;
-	}
-	/**
-	 * @param score The score to set.
-	 */
-	public void setScore(float score) {
-		this.score = score;
-	}
-	
-	/**
-	 * Sets the row, column and score of the cell.
-	 * @param row The row to set.
-	 * @param col The col to set.
-	 * @param score The score to set.
-	 */
-	public void set(int row, int col, float score) {
-		this.row = row;
-		this.col = col;
-		this.score = score;
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/Directions.java b/Butterfly/src/src/jaligner/Directions.java
deleted file mode 100644
index 2bd067f..0000000
--- a/Butterfly/src/src/jaligner/Directions.java
+++ /dev/null
@@ -1,44 +0,0 @@
-/*
- * $Id: Directions.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-/**
- * Traceback directions.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public abstract class Directions {
-	/**
-	 * Traceback direction stop
-	 */
-	public static final byte STOP = 0;
-	/**
-	 * Traceback direction left
-	 */
-	public static final byte LEFT = 1;
-    /**
-	 * Traceback direction diagonal
-	 */
-	public static final byte DIAGONAL = 2;
-	/**
-	 * Traceback direction up
-	 */
-	public static final byte UP = 3;
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/Markups.java b/Butterfly/src/src/jaligner/Markups.java
deleted file mode 100644
index 61599fa..0000000
--- a/Butterfly/src/src/jaligner/Markups.java
+++ /dev/null
@@ -1,47 +0,0 @@
-/*
- * $Id: Markups.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-/**
- * Markups line characters.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public abstract class Markups {
-	/**
-	 * Markup line identity character
-	 */
-	public static final char IDENTITY	= '|';
-	
-	/**
-	 * Markup line similarity character
-	 */
-	public static final char SIMILARITY	= ':';
-	
-	/**
-	 * Markup line gap character
-	 */
-	public static final char GAP		= ' ';
-	
-	/**
-	 * Markup line mismatch character
-	 */
-	public static final char MISMATCH	= '.';
-}
diff --git a/Butterfly/src/src/jaligner/NeedlemanWunsch.java b/Butterfly/src/src/jaligner/NeedlemanWunsch.java
deleted file mode 100644
index 8e072b1..0000000
--- a/Butterfly/src/src/jaligner/NeedlemanWunsch.java
+++ /dev/null
@@ -1,304 +0,0 @@
-/*
- * $Id: NeedlemanWunsch.java,v 1.4 2006/02/09 12:23:24 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-import jaligner.matrix.Matrix;
-
-/**
- * An implementation of the Needleman-Wunsch algorithm for biological global
- * pairwise sequence alignment.
- * 
- * <br>
- * Reference: <a
- * href="http://www.sbc.su.se/~per/molbioinfo2001/dynprog/adv_dynamic.html">Advanced
- * Dynamic Programming Tutorial</a>.
- * 
- * 
- * @author <a href="ahmed at users.sf.net">Ahmed Moustafa</a>
- */
-
-public final class NeedlemanWunsch {
-    /**
-     * Hidden constructor
-     */
-    private NeedlemanWunsch() {
-        super();
-    }
-
-    /**
-     * Aligns two sequences by Needleman-Wunsch (global)
-     * 
-     * @param s1
-     *            sequene #1 ({@link Sequence})
-     * @param s2
-     *            sequene #2 ({@link Sequence})
-     * @param matrix
-     *            scoring matrix ({@link Matrix})
-     * @param gap
-     *            open gap penalty
-     * @return alignment object contains the two aligned sequences, the
-     *         alignment score and alignment statistics
-     * @see Sequence
-     * @see Matrix
-     */
-    public static Alignment align(Sequence s1, Sequence s2, Matrix matrix,
-            float gap) {
-        float[][] scores = matrix.getScores();
-
-        int m = s1.length() + 1;
-        int n = s2.length() + 1;
-
-        byte[][] pointers = new byte[m][n];
-
-        // Initializes the element (0,0) of the traceback matrix to STOP.
-        pointers[0][0] = Directions.STOP;
-
-        // Initializes the boundaries of the traceback matrix.
-        for (int i = 1; i < m; i++) {
-            pointers[i][0] = Directions.UP;
-        }
-        for (int j = 1; j < n; j++) {
-            pointers[0][j] = Directions.LEFT;
-        }
-
-        Cell cell = construct(s1, s2, scores, gap, pointers);
-        Alignment alignment = traceback(s1, s2, matrix, pointers, cell);
-
-        alignment.setOriginalSequence1(s1);
-        alignment.setOriginalSequence2(s2);
-        alignment.setMatrix(matrix);
-        alignment.setOpen(gap);
-        alignment.setExtend(gap);
-
-        if (s1.getId() != null) {
-            alignment.setName1(s1.getId());
-        }
-        if (s2.getId() != null) {
-            alignment.setName2(s2.getId());
-        }
-
-        return alignment;
-    }
-
-    /**
-     * Constructs directions matrix for the traceback.
-     * 
-     * @param s1
-     *            sequence #1
-     * @param s2
-     *            sequence #2
-     * @param matrix
-     *            scoring matrix
-     * @param gap
-     *            gap penalty
-     * @param pointers
-     *            traceback matrix
-     * 
-     * @return The cell where the traceback starts.
-     */
-    private static Cell construct(Sequence s1, Sequence s2, float[][] matrix,
-            float gap, byte[][] pointers) {
-
-        Cell cell = new Cell();
-
-        char[] a1 = s1.toArray();
-        char[] a2 = s2.toArray();
-
-        int m = s1.length() + 1; // number of rows in similarity matrix
-        int n = s2.length() + 1; // number of columns in similarity matrix
-
-        // float[] v = new float[n]; // optimal alignment
-        float[] v = new float[n];
-
-        // Initialization of v
-        for (int j = 1; j < n; j++) {
-            v[j] = j * -gap;
-        }
-        v[0] = 0;
-
-        float x, y, z;
-        float vOld = 0;
-
-        // Fill the matrices
-        for (int i = 1; i < m; i++) { // for all rows
-            v[0] = i * -gap;
-
-            for (int j = 1; j < n; j++) { // for all columns
-
-                x = v[j] - gap;
-                y = v[j - 1] - gap;
-                z = vOld + matrix[a1[i - 1]][a2[j - 1]];
-
-                vOld = v[j];
-                v[j] = maximum(x, y, z);
-
-                // Determine the traceback direction
-                if (v[j] == x) {
-                    pointers[i][j] = Directions.UP;
-                } else if (v[j] == y) {
-                    pointers[i][j] = Directions.LEFT;
-                } else {
-                    pointers[i][j] = Directions.DIAGONAL;
-                }
-
-            } // loop columns
-
-            vOld = i * -gap;
-        } // loop rows
-
-        // cell contains the row number, the column number
-        // and the score of the cell with the maximum score
-
-        // Set the traceback start at the last cell m, n
-        // because we are doing global alignment
-        cell.set(m - 1, n - 1, v[n - 1]);
-        return cell;
-    }
-
-    /**
-     * Returns the alignment of two sequences based on the passed array of
-     * pointers
-     * 
-     * @param s1
-     *            sequence #1
-     * @param s2
-     *            sequence #2
-     * @param m
-     *            scoring matrix
-     * @param pointers
-     *            traceback matrix
-     * @param cell
-     *            The cell where the traceback starts.
-     * @return {@link Alignment} with the two aligned sequences and alignment
-     *         score.
-     * @see Cell
-     * @see Alignment
-     */
-    private static Alignment traceback(Sequence s1, Sequence s2, Matrix m,
-            byte[][] pointers, Cell cell) {
-        char[] array1 = s1.toArray();
-        char[] array2 = s2.toArray();
-        float[][] scores = m.getScores();
-
-        Alignment alignment = new Alignment();
-        alignment.setScore(cell.getScore());
-
-        // maximum length after the aligned sequences
-        int maxlen = s1.length() + s2.length();
-
-        char[] reversed1 = new char[maxlen]; // reversed sequence #1
-        char[] reversed2 = new char[maxlen]; // reversed sequence #2
-        char[] reversed3 = new char[maxlen]; // reversed markup
-
-        int len1 = 0; // length of sequence #1 after alignment
-        int len2 = 0; // length of sequence #2 after alignment
-        int len3 = 0; // length of the markup line
-
-        int identity = 0; // count of identitcal pairs
-        int similarity = 0; // count of similar pairs
-        int gaps = 0; // count of gaps
-
-        char c1, c2;
-
-        int i = cell.getRow(); // traceback start row
-        int j = cell.getCol(); // traceback start col
-
-        // Traceback flag, where true => continue and false => stop
-        boolean stillGoing = true;
-        while (stillGoing) {
-            switch (pointers[i][j]) {
-            case Directions.UP:
-                reversed1[len1++] = array1[--i];
-                reversed2[len2++] = Alignment.GAP;
-                reversed3[len3++] = Markups.GAP;
-                gaps++;
-                break;
-            case Directions.DIAGONAL:
-                c1 = array1[--i];
-                c2 = array2[--j];
-                reversed1[len1++] = c1;
-                reversed2[len2++] = c2;
-                if (c1 == c2) {
-                    reversed3[len3++] = Markups.IDENTITY;
-                    identity++;
-                    similarity++;
-                } else if (scores[c1][c2] > 0) {
-                    reversed3[len3++] = Markups.SIMILARITY;
-                    similarity++;
-                } else {
-                    reversed3[len3++] = Markups.MISMATCH;
-                }
-                break;
-            case Directions.LEFT:
-                reversed1[len1++] = Alignment.GAP;
-                reversed2[len2++] = array2[--j];
-                reversed3[len3++] = Markups.GAP;
-                gaps++;
-                break;
-            case Directions.STOP:
-                stillGoing = false;
-            }
-        }
-
-        alignment.setSequence1(reverse(reversed1, len1));
-        alignment.setStart1(i);
-        alignment.setSequence2(reverse(reversed2, len2));
-        alignment.setStart2(j);
-        alignment.setMarkupLine(reverse(reversed3, len3));
-        alignment.setIdentity(identity);
-        alignment.setGaps(gaps);
-        alignment.setSimilarity(similarity);
-
-        return alignment;
-    }
-
-    /**
-     * Returns the maximum of two float numbers.
-     * 
-     * @param a
-     *            float #1
-     * @param b
-     *            float #2
-     * @param c
-     *            float #3
-     * @return the maximum of a and b
-     */
-    private static float maximum(float a, float b, float c) {
-        if (a > b) {
-            return a > c ? a : c;
-        } else {
-            return b > c ? b : c;
-        }
-    }
-
-    /**
-     * Reverses an array of chars
-     * 
-     * @param a
-     * @param len
-     * @return the input array of char reserved
-     */
-    private static char[] reverse(char[] a, int len) {
-        char[] b = new char[len];
-        for (int i = len - 1, j = 0; i >= 0; i--, j++) {
-            b[j] = a[i];
-        }
-        return b;
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/NeedlemanWunschGotoh.java b/Butterfly/src/src/jaligner/NeedlemanWunschGotoh.java
deleted file mode 100644
index f321d37..0000000
--- a/Butterfly/src/src/jaligner/NeedlemanWunschGotoh.java
+++ /dev/null
@@ -1,432 +0,0 @@
-/*
- * $Id: NeedlemanWunschGotoh.java,v 1.12 2006/04/05 00:18:30 ahmed Exp $
- * 
- * 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.
- */
-package jaligner;
-
-import jaligner.matrix.Matrix;
-
-import java.util.logging.Logger;
-
-/**
- * An implementation of the Needleman-Wunsch algorithm with Gotoh's improvement
- * for biological global pairwise sequence alignment.
- * 
- * Modified to use int[[] for lengths array for deal with long sequences by Josh Bowden, CSIRO
- * 
- * @author Ahmed Moustafa
- * @author Bram Minnaert
- * @version $Revision: 1.12 $
- */
-
-public final class NeedlemanWunschGotoh {
-
-    /**
-     * Logger
-     */
-    private static final Logger logger = Logger
-            .getLogger(NeedlemanWunschGotoh.class.getSimpleName());
-
-    /**
-     * Hidden constructor
-     */
-    private NeedlemanWunschGotoh() {
-        super();
-    }
-
-    /**
-     * Aligns two sequences by Needleman-Wunsch (global)
-     * 
-     * @param s1
-     *            sequene #1 ({@link Read})
-     * @param s2
-     *            sequene #2 ({@link Read})
-     * @param matrix
-     *            scoring matrix ({@link Matrix})
-     * @param o
-     *            open gap penalty
-     * @param e
-     *            extend gap penalty
-     * @return alignment object contains the two aligned sequences, the
-     *         alignment score and alignment statistics
-     * @see Read
-     * @see Matrix
-     */
-    public static Alignment align(Sequence s1, Sequence s2, Matrix matrix,
-            float o, float e) {
-
-        float[][] scores = matrix.getScores();
-
-        Sequence _s1;
-        Sequence _s2;
-
-        if (s1.length() < s2.length()) {
-            _s1 = s2;
-            _s2 = s1;
-        } else {
-            _s1 = s1;
-            _s2 = s2;
-        }
-
-        int m = _s1.length() + 1;
-        int n = _s2.length() + 1;
-
-        byte[] pointers = new byte[m * n];
-
-        int[] lengths = new int[m * n];  // was short
-
-        // Initializes the element (0,0) of the traceback matrix to STOP.
-        pointers[0] = Directions.STOP;
-
-        // Initializes the boundaries of the traceback matrix.
-        for (int i = 1, k = n; i < m; i++, k += n) {
-            pointers[k] = Directions.UP;
-            lengths[k] = (int) i; // was short
-        }
-        for (int j = 1; j < n; j++) {
-            pointers[j] = Directions.LEFT;
-            lengths[j] = (int) j;  // was short
-        }
-
-        Cell cell = construct(_s1, _s2, scores, o, e, pointers, lengths);
-
-        Alignment alignment = traceback(_s1, _s2, matrix, pointers, cell,
-                lengths);
-
-        alignment.setMatrix(matrix);
-        alignment.setOpen(o);
-        alignment.setExtend(e);
-        alignment.setName1(_s1.getId());
-        alignment.setName2(_s2.getId());
-        alignment.setOriginalSequence1(_s1);
-        alignment.setOriginalSequence2(_s2);
-
-        return alignment;
-    }
-
-    /**
-     * Constructs directions matrix for the traceback.
-     * 
-     * @param s1
-     *            sequence #1
-     * @param s2
-     *            sequence #2
-     * @param matrix
-     *            scoring matrix
-     * @param o
-     *            open gap penalty
-     * @param e
-     *            extend gap penalty
-     * @param pointers
-     *            traceback matrix
-     * 
-     * @return The cell where the traceback starts.
-     */
-    private static Cell construct(Sequence s1, Sequence s2, float[][] matrix,
-            float o, float e, byte[] pointers, int[] lengths) {  // was short[] lengths
-
-        //logger.info("Started...");
-
-        char[] a1 = s1.toArray();
-        char[] a2 = s2.toArray();
-
-        int m = s1.length() + 1; // number of rows in similarity matrix
-        int n = s2.length() + 1; // number of columns in similarity matrix
-
-        float[] v = new float[n];
-        float vDiagonal = 0;// Float.NEGATIVE_INFINITY; // best score in cell
-        float f = Float.NEGATIVE_INFINITY; // score from diagonal
-        float h = Float.NEGATIVE_INFINITY; // best score ending with gap from
-        // left
-        float[] g = new float[n]; // best score ending with gap from above
-
-        // Initialization of v and g
-        g[0] = Float.NEGATIVE_INFINITY;
-        for (int j = 1; j < n; j++) {
-            v[j] = 0;// -o - (j - 1) * e;
-            g[j] = Float.NEGATIVE_INFINITY;
-        }
-
-        int lengthOfHorizontalGap = 0;
-        int[] lengthOfVerticalGap = new int[n];
-
-        float similarityScore;
-        float maximumScore = Float.NEGATIVE_INFINITY;
-        int maxi = 0;
-        int maxj = 0;
-
-        // Fill the matrices
-        for (int i = 1, k = n; i < m; i++, k += n) { // for all rows
-            v[0] = -o - (i - 1) * e;
-            for (int j = 1, l = k + 1; j < n; j++, l++) { // for all columns
-
-                similarityScore = matrix[a1[i - 1]][a2[j - 1]];
-
-                f = vDiagonal + similarityScore;// from diagonal
-
-                // Which cell from the left?
-                if (h - e >= v[j - 1] - o) {
-                    h -= e;
-                    lengthOfHorizontalGap++;
-                } else {
-                    h = v[j - 1] - o;
-                    lengthOfHorizontalGap = 1;
-                }
-
-                // Which cell from above?
-                if (g[j] - e >= v[j] - o) {
-                    g[j] = g[j] - e;
-                    lengthOfVerticalGap[j] = lengthOfVerticalGap[j] + 1;
-                } else {
-                    g[j] = v[j] - o;
-                    lengthOfVerticalGap[j] = 1;
-                }
-
-                vDiagonal = v[j];
-                v[j] = maximum(f, g[j], h); // best one
-                if (v[j] > maximumScore) {
-                    maximumScore = v[j];
-                    maxi = i;
-                    maxj = j;
-                }
-
-                // Determine the traceback direction
-                if (v[j] == f) {
-                    pointers[l] = Directions.DIAGONAL;
-                } else if (v[j] == g[j]) {
-                    pointers[l] = Directions.UP;
-                    lengths[l] = (int) lengthOfVerticalGap[j]; // was short
-                } else if (v[j] == h) {
-                    pointers[l] = Directions.LEFT;
-                    lengths[l] = (int) lengthOfHorizontalGap;  // was short
-                }
-
-            } // loop columns
-
-            // Reset
-            h = Float.NEGATIVE_INFINITY;
-            vDiagonal = 0;// -o - (i - 1) * e;
-
-            lengthOfHorizontalGap = 0;
-
-        } // loop rows
-
-        Cell cell = new Cell();
-        cell.set(maxi, maxj, v[n - 1]);
-
-        //logger.info("Finished.");
-
-        return cell;
-    }
-
-    /**
-     * Returns the alignment of two sequences based on the passed array of
-     * pointers
-     * 
-     * @param s1
-     *            sequence #1
-     * @param s2
-     *            sequence #2
-     * @param m
-     *            scoring matrix
-     * @param pointers
-     *            traceback matrix
-     * @param cell
-     *            The cell where the traceback starts.
-     * @return {@link Alignment} with the two aligned sequences and alignment
-     *         score.
-     * @see Cell
-     * @see Alignment
-     */
-    private static Alignment traceback(Sequence s1, Sequence s2, Matrix m,
-            byte[] pointers, Cell cell, int[] lengths) { // was short[] lengths
-        //logger.info("Started...");
-
-        char[] array1 = s1.toArray();
-        char[] array2 = s2.toArray();
-        float[][] scores = m.getScores();
-
-        Alignment alignment = new Alignment();
-        alignment.setScore(cell.getScore());
-
-        // maximum length after the aligned sequences
-        int maxlen = s1.length() + s2.length();
-
-        char[] reversed1 = new char[maxlen]; // reversed sequence #1
-        char[] reversed2 = new char[maxlen]; // reversed sequence #2
-        char[] reversed3 = new char[maxlen]; // reversed markup
-
-        int len1 = 0; // length of sequence #1 after alignment
-        int len2 = 0; // length of sequence #2 after alignment
-        int len3 = 0; // length of the markup line
-
-        int identity = 0; // count of identitcal pairs
-        int similarity = 0; // count of similar pairs
-        int gaps = 0; // count of gaps
-
-        char c1, c2;
-
-        int i = cell.getRow(); // traceback start row
-        int j = cell.getCol(); // traceback start col
-        int n = s2.length() + 1;
-        int row = i * n;
-
-        int a = s1.length() - 1;
-        int b = s2.length() - 1;
-        if (a - i > b - j) {
-            for (; a - i > b - j; a--) {
-                reversed1[len1++] = array1[a];
-                reversed2[len2++] = Alignment.GAP;
-                reversed3[len3++] = Markups.GAP;
-                gaps++;
-            }
-            for (; b > j - 1; a--, b--) {
-                c1 = array1[a];
-                c2 = array2[b];
-
-                reversed1[len1++] = c1;
-                reversed2[len2++] = c2;
-
-                if (c1 == c2) {
-                    reversed3[len3++] = Markups.IDENTITY;
-                    identity++;
-                    similarity++;
-                } else if (scores[c1][c2] > 0) {
-                    reversed3[len3++] = Markups.SIMILARITY;
-                    similarity++;
-                } else {
-                    reversed3[len3++] = Markups.MISMATCH;
-                }
-            }
-        } else {
-            for (; b - j > a - i; b--) {
-                reversed1[len1++] = Alignment.GAP;
-                reversed2[len2++] = array2[b];
-                reversed3[len3++] = Markups.GAP;
-                gaps++;
-            }
-            for (; a > i - 1; a--, b--) {
-                c1 = array1[a];
-                c2 = array2[b];
-
-                reversed1[len1++] = c1;
-                reversed2[len2++] = c2;
-
-                if (c1 == c2) {
-                    reversed3[len3++] = Markups.IDENTITY;
-                    identity++;
-                    similarity++;
-                } else if (scores[c1][c2] > 0) {
-                    reversed3[len3++] = Markups.SIMILARITY;
-                    similarity++;
-                } else {
-                    reversed3[len3++] = Markups.MISMATCH;
-                }
-            }
-        }
-
-        // Traceback flag, where true => continue and false => stop
-        boolean stillGoing = true;
-        while (stillGoing) {
-            int l = row + j;
-            switch (pointers[l]) {
-            case Directions.UP:
-                for (int k = 0, len = lengths[l]; k < len; k++) {
-                    reversed1[len1++] = array1[--i];
-                    reversed2[len2++] = Alignment.GAP;
-                    reversed3[len3++] = Markups.GAP;
-                    row -= n;
-                    gaps++;
-                }
-                break;
-            case Directions.DIAGONAL:
-                c1 = array1[--i];
-                c2 = array2[--j];
-                reversed1[len1++] = c1;
-                reversed2[len2++] = c2;
-                row -= n;
-                if (c1 == c2) {
-                    reversed3[len3++] = Markups.IDENTITY;
-                    identity++;
-                    similarity++;
-                } else if (scores[c1][c2] > 0) {
-                    reversed3[len3++] = Markups.SIMILARITY;
-                    similarity++;
-                } else {
-                    reversed3[len3++] = Markups.MISMATCH;
-                }
-                break;
-            case Directions.LEFT:
-                for (int k = 0, len = lengths[l]; k < len; k++) {
-                    reversed1[len1++] = Alignment.GAP;
-                    reversed2[len2++] = array2[--j];
-                    reversed3[len3++] = Markups.GAP;
-                    gaps++;
-                }
-                break;
-            case Directions.STOP:
-                stillGoing = false;
-            }
-        }
-
-        alignment.setSequence1(reverse(reversed1, len1));
-        alignment.setStart1(i);
-        alignment.setSequence2(reverse(reversed2, len2));
-        alignment.setStart2(j);
-        alignment.setMarkupLine(reverse(reversed3, len3));
-        alignment.setIdentity(identity);
-        alignment.setGaps(gaps);
-        alignment.setSimilarity(similarity);
-
-        //logger.info("Finished.");
-
-        return alignment;
-    }
-
-    /**
-     * Returns the maximum of two float numbers.
-     * 
-     * @param a
-     *            float #1
-     * @param b
-     *            float #2
-     * @param c
-     *            float #3
-     * @return the maximum of a and b
-     */
-    private static float maximum(float a, float b, float c) {
-        if (a > b) {
-            return a > c ? a : c;
-        } else {
-            return b > c ? b : c;
-        }
-    }
-
-    /**
-     * Reverses an array of chars
-     * 
-     * @param a
-     * @param len
-     * @return the input array of char reserved
-     */
-    private static char[] reverse(char[] a, int len) {
-        char[] b = new char[len];
-        for (int i = len - 1, j = 0; i >= 0; i--, j++) {
-            b[j] = a[i];
-        }
-        return b;
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/Sequence.java b/Butterfly/src/src/jaligner/Sequence.java
deleted file mode 100644
index d05f3c4..0000000
--- a/Butterfly/src/src/jaligner/Sequence.java
+++ /dev/null
@@ -1,250 +0,0 @@
-/*
- * $Id: Sequence.java,v 1.6 2006/07/27 16:28:24 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-import jaligner.util.Commons;
-
-import java.io.Serializable;
-
-/**
- * A basic (nucleic or protein) sequence. It's a wrapper to
- * {@link java.lang.String}.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class Sequence implements Serializable {
-	/**
-	 * 
-	 */
-	private static final long serialVersionUID = 3256721801357898297L;
-
-	/**
-	 * Sequence type nucleic.
-	 */
-	public static final int NUCLEIC = 0;
-
-	/**
-	 * Sequence type protein.
-	 */
-	public static final int PROTEIN = 1;
-
-	/**
-	 * Sequence
-	 */
-	private String sequence;
-
-	/**
-	 * Sequence id.
-	 */
-	private String id = null;
-
-	/**
-	 * Sequence description.
-	 */
-	private String description = null;
-
-	/**
-	 * Sequence type.
-	 */
-	private int type = PROTEIN;
-
-	/**
-	 * Constructor
-	 */
-	public Sequence() {
-		super();
-	}
-
-	/**
-	 * Constructor
-	 * 
-	 * @param sequence
-	 */
-	public Sequence(String sequence) {
-		super();
-		this.sequence = sequence;
-	}
-	
-	/**
-	 * Constructor
-	 * 
-	 * @param name
-	 * @param sequence
-	 */
-	public Sequence(String name, char[] sequence) {
-		super();
-		this.id = name;
-		this.sequence = new String(sequence);
-	}
-
-	/**
-	 * Constructor
-	 * 
-	 * @param name
-	 * @param sequence
-	 */
-	public Sequence(String name, String sequence) {
-		super();
-		this.id = name;
-		this.sequence = sequence;
-	}
-
-	/**
-	 * Constructor
-	 * 
-	 * @param sequence
-	 * @param id
-	 * @param description
-	 * @param type
-	 */
-	public Sequence(String sequence, String id, String description, int type) {
-		super();
-		this.sequence = sequence;
-		this.id = id;
-		this.description = description;
-		this.type = type;
-	}
-
-	/**
-	 * Returns the sequence string
-	 * 
-	 * @return Returns the sequence
-	 */
-	public String getSequence() {
-		return sequence;
-	}
-
-	/**
-	 * Sets the sequence string
-	 * 
-	 * @param sequence
-	 *            The sequence to set
-	 */
-	public void setSequence(String sequence) {
-		this.sequence = sequence;
-	}
-
-	/**
-	 * Returns the sequence id
-	 * 
-	 * @return Returns the id
-	 */
-	public String getId() {
-		return id;
-	}
-
-	/**
-	 * Sets the sequence id
-	 * 
-	 * @param id
-	 *            The id to set
-	 */
-	public void setId(String id) {
-		this.id = id;
-	}
-
-	/**
-	 * Returns the sequence description
-	 * 
-	 * @return Returns the description
-	 */
-	public String getDescription() {
-		return description;
-	}
-
-	/**
-	 * Sets the sequence description
-	 * 
-	 * @param description
-	 *            The description to set
-	 */
-	public void setDescription(String description) {
-		this.description = description;
-	}
-
-	/**
-	 * Returns the sequence type (nucleic or protein)
-	 * 
-	 * @return Returns the type
-	 */
-	public int getType() {
-		return type;
-	}
-
-	/**
-	 * Sets the sequence type (nucleic or protein)
-	 * 
-	 * @param type
-	 *            The type to set
-	 */
-	public void setType(int type) {
-		this.type = type;
-	}
-
-	/**
-	 * Returns the length of the sequence
-	 * 
-	 * @return sequence length
-	 */
-	public int length() {
-		return this.sequence.length();
-	}
-
-	/**
-	 * Returns a subsequence
-	 * 
-	 * @param index
-	 *            start index
-	 * @param length
-	 *            length of subsequence
-	 * @return subsequence
-	 */
-	public String subsequence(int index, int length) {
-		return this.sequence.substring(index, index + length);
-	}
-
-	/**
-	 * Returns the acid at specific location in the sequence
-	 * 
-	 * @param index
-	 * @return acid at index
-	 */
-	public char acidAt(int index) {
-		return this.sequence.charAt(index);
-	}
-
-	/**
-	 * Returns the sequence as an array of characters.
-	 * 
-	 * @return array of chars.
-	 */
-	public char[] toArray() {
-		return this.sequence.toCharArray();
-	}
-    
-    /**
-     * Returns the sequence id and the sequence string
-     * 
-     * @return Returns the sequence id and the sequence string
-     */
-    public String toString() {
-        return id + Commons.TAB + sequence;
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/SmithWatermanGotoh.java b/Butterfly/src/src/jaligner/SmithWatermanGotoh.java
deleted file mode 100644
index 695a283..0000000
--- a/Butterfly/src/src/jaligner/SmithWatermanGotoh.java
+++ /dev/null
@@ -1,388 +0,0 @@
-/*
- * $Id: SmithWatermanGotoh.java,v 1.10 2006/02/09 13:27:36 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-import jaligner.matrix.Matrix;
-
-import java.util.logging.Logger;
-
-/**
- * An implementation of the Smith-Waterman algorithm with Gotoh's improvement
- * for biological local pairwise sequence alignment.
- * 
- * <strong>Recursive definition:</strong>
- * <ul>
- * <li>
- * <strong>Base conditions:</strong>
- * <ul>
- * <li><code>V(0, 0) = 0</code></li>
- * <li><code>V(i, 0) = E(i, 0) = W<sub>g</sub> + iW<sub>s</sub></code></li>
- * <li><code>V(0, j) = F(0, j) = W<sub>g</sub> + jW<sub>s</sub></code></li>
- * </ul>
- * </li>
- * <li>
- * <strong>Recurrence relation:</strong>
- * <ul>
- * <li><code>V(i, j) = max{E(i, j), F(i, j), G(i, j)}</code>, where:</li>
- * <li><code>G(i, j) = V(i - 1, j - 1) + similarity(S<sub>i</sub>, T<sub>j</sub>)</code></li>
- * <li><code>E(i, j) = max{E(i, j - 1) + W<sub>s</sub>, V(i, j - 1) + W<sub>g</sub> + W<sub>s</sub>}</code></li>
- * <li><code>F(i, j) = max{F(i - 1, j) + W<sub>s</sub>, V(i - 1, j) + W<sub>g</sub> + W<sub>s</sub>}</code></li>
- * </ul>
- * </ul> 
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public final class SmithWatermanGotoh {
-	/**
-	 * Hidden constructor
-	 */
-	private SmithWatermanGotoh() {
-		super();
-	}
-
-	/**
-	 * Logger
-	 */
-	private static final Logger logger = Logger
-			.getLogger(SmithWatermanGotoh.class.getName());
-
-	/**
-	 * Aligns two sequences by Smith-Waterman (local)
-	 * 
-	 * @param s1
-	 *            sequene #1 ({@link Sequence})
-	 * @param s2
-	 *            sequene #2 ({@link Sequence})
-	 * @param matrix
-	 *            scoring matrix ({@link Matrix})
-	 * @param o
-	 *            open gap penalty
-	 * @param e
-	 *            extend gap penalty
-	 * @return alignment object contains the two aligned sequences, the
-	 *         alignment score and alignment statistics
-	 * @see Sequence
-	 * @see Matrix
-	 */
-	public static Alignment align(Sequence s1, Sequence s2, Matrix matrix,
-			float o, float e) {
-		//logger.info("Started...");
-		long start = System.currentTimeMillis();
-		float[][] scores = matrix.getScores();
-
-		int m = s1.length() + 1;
-		int n = s2.length() + 1;
-
-		byte[] pointers = new byte[m * n];
-
-		// Initializes the boundaries of the traceback matrix to STOP.
-		for (int i = 0, k = 0; i < m; i++, k += n) {
-			pointers[k] = Directions.STOP;
-		}
-		for (int j = 1; j < n; j++) {
-			pointers[j] = Directions.STOP;
-		}
-
-		short[] sizesOfVerticalGaps = new short[m * n];
-		short[] sizesOfHorizontalGaps = new short[m * n];
-		for (int i = 0, k = 0; i < m; i++, k += n) {
-			for (int j = 0; j < n; j++) {
-				sizesOfVerticalGaps[k + j] = sizesOfHorizontalGaps[k + j] = 1;
-			}
-		}
-
-		Cell cell = SmithWatermanGotoh.construct(s1, s2, scores, o, e,
-				pointers, sizesOfVerticalGaps, sizesOfHorizontalGaps);
-		Alignment alignment = SmithWatermanGotoh.traceback(s1, s2, matrix,
-				pointers, cell, sizesOfVerticalGaps, sizesOfHorizontalGaps);
-		alignment.setOriginalSequence1(s1);
-		alignment.setOriginalSequence2(s2);
-		alignment.setMatrix(matrix);
-		alignment.setOpen(o);
-		alignment.setExtend(e);
-		if (s1.getId() != null) {
-			alignment.setName1(s1.getId());
-		}
-		if (s2.getId() != null) {
-			alignment.setName2(s2.getId());
-		}
-		/*logger.info("Finished in " + (System.currentTimeMillis() - start)
-				+ " milliseconds");
-		*/
-		
-		return alignment;
-	}
-
-	/**
-	 * Constructs directions matrix for the traceback
-	 * 
-	 * @param s1
-	 *            sequence #1
-	 * @param s2
-	 *            sequence #2
-	 * @param matrix
-	 *            scoring matrix
-	 * @param o
-	 *            open gap penalty
-	 * @param e
-	 *            extend gap penalty
-	 * @return The cell where the traceback starts.
-	 */
-	private static Cell construct(Sequence s1, Sequence s2, float[][] matrix,
-			float o, float e, byte[] pointers, short[] sizesOfVerticalGaps,
-			short[] sizesOfHorizontalGaps) {
-		//logger.info("Started...");
-		long start = System.currentTimeMillis();
-
-		char[] a1 = s1.toArray();
-		char[] a2 = s2.toArray();
-
-		int m = s1.length() + 1;
-		int n = s2.length() + 1;
-
-		float f; // score of alignment x1...xi to y1...yi if xi aligns to yi
-		float[] g = new float[n]; // score if xi aligns to a gap after yi
-		float h; // score if yi aligns to a gap after xi
-		float[] v = new float[n]; // best score of alignment x1...xi to
-		// y1...yi
-		float vDiagonal;
-
-		g[0] = Float.NEGATIVE_INFINITY;
-		h = Float.NEGATIVE_INFINITY;
-		v[0] = 0;
-
-		for (int j = 1; j < n; j++) {
-			g[j] = Float.NEGATIVE_INFINITY;
-			v[j] = 0;
-		}
-
-		float similarityScore, g1, g2, h1, h2;
-
-		Cell cell = new Cell();
-
-		for (int i = 1, k = n; i < m; i++, k += n) {
-			h = Float.NEGATIVE_INFINITY;
-			vDiagonal = v[0];
-			for (int j = 1, l = k + 1; j < n; j++, l++) {
-				similarityScore = matrix[a1[i - 1]][a2[j - 1]];
-
-				// Fill the matrices
-				f = vDiagonal + similarityScore;
-
-				g1 = g[j] - e;
-				g2 = v[j] - o;
-				if (g1 > g2) {
-					g[j] = g1;
-					sizesOfVerticalGaps[l] = (short) (sizesOfVerticalGaps[l - n] + 1);
-				} else {
-					g[j] = g2;
-				}
-
-				h1 = h - e;
-				h2 = v[j - 1] - o;
-				if (h1 > h2) {
-					h = h1;
-					sizesOfHorizontalGaps[l] = (short) (sizesOfHorizontalGaps[l - 1] + 1);
-				} else {
-					h = h2;
-				}
-
-				vDiagonal = v[j];
-				v[j] = maximum(f, g[j], h, 0);
-
-				// Determine the traceback direction
-				if (v[j] == 0) {
-					pointers[l] = Directions.STOP;
-				} else if (v[j] == f) {
-					pointers[l] = Directions.DIAGONAL;
-				} else if (v[j] == g[j]) {
-					pointers[l] = Directions.UP;
-				} else {
-					pointers[l] = Directions.LEFT;
-				}
-
-				// Set the traceback start at the current cell i, j and score
-				if (v[j] > cell.getScore()) {
-					cell.set(i, j, v[j]);
-				}
-			}
-		}
-		/*logger.info("Finished in " + (System.currentTimeMillis() - start)
-				+ " milliseconds");
-		 */	
-		return cell;
-	}
-
-	/**
-	 * Returns the alignment of two sequences based on the passed array of
-	 * pointers
-	 * 
-	 * @param s1
-	 *            sequence #1
-	 * @param s2
-	 *            sequence #2
-	 * @param m
-	 *            scoring matrix
-	 * @param cell
-	 *            The cell where the traceback starts.
-	 * @return {@link Alignment}with the two aligned sequences and alignment
-	 *         score.
-	 * @see Cell
-	 * @see Alignment
-	 */
-	private static Alignment traceback(Sequence s1, Sequence s2, Matrix m,
-			byte[] pointers, Cell cell, short[] sizesOfVerticalGaps,
-			short[] sizesOfHorizontalGaps) {
-		//logger.info("Started...");
-		long start = System.currentTimeMillis();
-
-		char[] a1 = s1.toArray();
-		char[] a2 = s2.toArray();
-
-		float[][] scores = m.getScores();
-
-		int n = s2.length() + 1;
-
-		Alignment alignment = new Alignment();
-		alignment.setScore(cell.getScore());
-
-		int maxlen = s1.length() + s2.length(); // maximum length after the
-		// aligned sequences
-
-		char[] reversed1 = new char[maxlen]; // reversed sequence #1
-		char[] reversed2 = new char[maxlen]; // reversed sequence #2
-		char[] reversed3 = new char[maxlen]; // reversed markup
-
-		int len1 = 0; // length of sequence #1 after alignment
-		int len2 = 0; // length of sequence #2 after alignment
-		int len3 = 0; // length of the markup line
-
-		int identity = 0; // count of identitcal pairs
-		int similarity = 0; // count of similar pairs
-		int gaps = 0; // count of gaps
-
-		char c1, c2;
-
-		int i = cell.getRow(); // traceback start row
-		int j = cell.getCol(); // traceback start col
-		int k = i * n;
-
-		boolean stillGoing = true; // traceback flag: true -> continue & false
-		// -> stop
-
-		while (stillGoing) {
-			switch (pointers[k + j]) {
-			case Directions.UP:
-				for (int l = 0, len = sizesOfVerticalGaps[k + j]; l < len; l++) {
-					reversed1[len1++] = a1[--i];
-					reversed2[len2++] = Alignment.GAP;
-					reversed3[len3++] = Markups.GAP;
-					k -= n;
-					gaps++;
-				}
-				break;
-			case Directions.DIAGONAL:
-				c1 = a1[--i];
-				c2 = a2[--j];
-				k -= n;
-				reversed1[len1++] = c1;
-				reversed2[len2++] = c2;
-				if (c1 == c2) {
-					reversed3[len3++] = Markups.IDENTITY;
-					identity++;
-					similarity++;
-				} else if (scores[c1][c2] > 0) {
-					reversed3[len3++] = Markups.SIMILARITY;
-					similarity++;
-				} else {
-					reversed3[len3++] = Markups.MISMATCH;
-				}
-				break;
-			case Directions.LEFT:
-				for (int l = 0, len = sizesOfHorizontalGaps[k + j]; l < len; l++) {
-					reversed1[len1++] = Alignment.GAP;
-					reversed2[len2++] = a2[--j];
-					reversed3[len3++] = Markups.GAP;
-					gaps++;
-				}
-				break;
-			case Directions.STOP:
-				stillGoing = false;
-			}
-		}
-
-		alignment.setSequence1(reverse(reversed1, len1));
-		alignment.setStart1(i);
-		alignment.setSequence2(reverse(reversed2, len2));
-		alignment.setStart2(j);
-		alignment.setMarkupLine(reverse(reversed3, len3));
-		alignment.setIdentity(identity);
-		alignment.setGaps(gaps);
-		alignment.setSimilarity(similarity);
-
-		/*logger.info("Finished in " + (System.currentTimeMillis() - start)
-				+ " milliseconds");
-		*/
-		
-		return alignment;
-	}
-
-	/**
-	 * Returns the maximum of 4 float numbers.
-	 * 
-	 * @param a
-	 *            float #1
-	 * @param b
-	 *            float #2
-	 * @param c
-	 *            float #3
-	 * @param d
-	 *            float #4
-	 * @return The maximum of a, b, c and d.
-	 */
-	private static float maximum(float a, float b, float c, float d) {
-		if (a > b) {
-			if (a > c) {
-				return a > d ? a : d;
-			} else {
-				return c > d ? c : d;
-			}
-		} else if (b > c) {
-			return b > d ? b : d;
-		} else {
-			return c > d ? c : d;
-		}
-	}
-
-	/**
-	 * Reverses an array of chars
-	 * 
-	 * @param a
-	 * @param len
-	 * @return the input array of char reserved
-	 */
-	private static char[] reverse(char[] a, int len) {
-		char[] b = new char[len];
-		for (int i = len - 1, j = 0; i >= 0; i--, j++) {
-			b[j] = a[i];
-		}
-		return b;
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/TracebackNode.java b/Butterfly/src/src/jaligner/TracebackNode.java
deleted file mode 100644
index 701b96c..0000000
--- a/Butterfly/src/src/jaligner/TracebackNode.java
+++ /dev/null
@@ -1,99 +0,0 @@
-/*
- * $Id: TracebackNode.java,v 1.1 2006/01/18 20:12:04 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner;
-
-/**
- * Traceback node
- * 
- * @author Bram Minnaert
- * @author Ahmed Moustafa
- */
-
-public final class TracebackNode {
-
-	/**
-	 * Direction
-	 */
-	private byte direction;
-
-	/**
-	 * Length of gap (for up and left directions)
-	 */
-	private int length;
-
-	/**
-	 * Constructor
-	 */
-	public TracebackNode() {
-		super();
-	}
-
-	/**
-	 * Sets the direction to diagonal
-	 * 
-	 */
-	public void setDiagonal() {
-		direction = Directions.DIAGONAL;
-		length = 0;
-	}
-
-	/**
-	 * Sets the direction to up
-	 * 
-	 * @param length
-	 *            length of gap
-	 */
-	public void setUp(int length) {
-		direction = Directions.UP;
-		this.length = length;
-	}
-
-	/**
-	 * Sets the direction to left
-	 * 
-	 * @param length
-	 *            length of gap
-	 */
-	public void setLeft(int length) {
-		direction = Directions.LEFT;
-		this.length = length;
-	}
-
-	/**
-	 * Sets the direction to stop
-	 */
-	public void setStop() {
-		direction = Directions.STOP;
-		length = 0;
-	}
-
-	/**
-	 * @return Returns the direction.
-	 */
-	public byte getDirection() {
-		return direction;
-	}
-
-	/**
-	 * @return Returns the length.
-	 */
-	public int getLength() {
-		return length;
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/example/NeedlemanWunschExample.java b/Butterfly/src/src/jaligner/example/NeedlemanWunschExample.java
deleted file mode 100644
index ad5f33c..0000000
--- a/Butterfly/src/src/jaligner/example/NeedlemanWunschExample.java
+++ /dev/null
@@ -1,74 +0,0 @@
-/*
- * $Id: NeedlemanWunschExample.java,v 1.2 2006/02/03 05:00:22 ahmed Exp $
- *
- * 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.
- */
-
-package jaligner.example;
-
-import jaligner.Alignment;
-import jaligner.NeedlemanWunsch;
-import jaligner.Sequence;
-import jaligner.formats.Pair;
-import jaligner.matrix.Matrix;
-import jaligner.matrix.MatrixGenerator;
-import jaligner.util.SequenceParser;
-
-import java.util.logging.Level;
-import java.util.logging.Logger;
-
-/**
- * Example of using JAligner API to perform global pairwise sequence alignment
- * with Needleman-Wunsch algorithm {@link jaligner.NeedlemanWunsch}.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class NeedlemanWunschExample {
-
-    /**
-     * Logger
-     */
-    private static final Logger logger = Logger
-            .getLogger(NeedlemanWunschExample.class.getName());
-
-    /**
-     * 
-     * @param args
-     */
-    public static void main(String[] args) {
-        try {
-            logger.info("Running example...");
-
-            Sequence s1 = SequenceParser.parse("GAATTCAGTTA");
-            Sequence s2 = SequenceParser.parse("GGATCGA");
-
-            float match = 2;
-            float mismatch = -1;
-            Matrix matrix = MatrixGenerator.generate(match, mismatch);
-            float gap = 2;
-
-            Alignment alignment = NeedlemanWunsch.align(s1, s2, matrix, gap);
-
-            System.out.println(alignment.getSummary());
-            System.out.println(new Pair().format(alignment));
-
-            logger.info("Finished running example");
-        } catch (Exception e) {
-            logger.log(Level.SEVERE, "Failed running example: "
-                    + e.getMessage(), e);
-        }
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/example/NeedlemanWunschGotohExample.java b/Butterfly/src/src/jaligner/example/NeedlemanWunschGotohExample.java
deleted file mode 100644
index bbca0e7..0000000
--- a/Butterfly/src/src/jaligner/example/NeedlemanWunschGotohExample.java
+++ /dev/null
@@ -1,76 +0,0 @@
-/*
- * $Id: NeedlemanWunschGotohExample.java,v 1.1 2006/02/03 05:00:23 ahmed Exp $
- *
- * 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.
- */
-
-package jaligner.example;
-
-import jaligner.Alignment;
-import jaligner.NeedlemanWunschGotoh;
-import jaligner.Sequence;
-import jaligner.formats.Pair;
-import jaligner.matrix.Matrix;
-import jaligner.matrix.MatrixGenerator;
-import jaligner.util.SequenceParser;
-
-import java.util.logging.Level;
-import java.util.logging.Logger;
-
-/**
- * Example of using JAligner API to perform global pairwise sequence alignment
- * with {@link jaligner.NeedlemanWunschGotoh}.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class NeedlemanWunschGotohExample {
-
-    /**
-     * Logger
-     */
-    private static final Logger logger = Logger
-            .getLogger(NeedlemanWunschGotohExample.class.getName());
-
-    /**
-     * 
-     * @param args
-     */
-    public static void main(String[] args) {
-        try {
-            logger.info("Running example...");
-
-            Sequence s1 = SequenceParser.parse("GAATTCAGTTA");
-            Sequence s2 = SequenceParser.parse("GGATCGA");
-
-            float match = 2;
-            float mismatch = -1;
-            Matrix matrix = MatrixGenerator.generate(match, mismatch);
-            float open = 2;
-            float extend = 2;
-
-            Alignment alignment = NeedlemanWunschGotoh.align(s1, s2, matrix,
-                    open, extend);
-
-            System.out.println(alignment.getSummary());
-            System.out.println(new Pair().format(alignment));
-
-            logger.info("Finished running example");
-        } catch (Exception e) {
-            logger.log(Level.SEVERE, "Failed running example: "
-                    + e.getMessage(), e);
-        }
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/example/SmithWatermanGotohExample.java b/Butterfly/src/src/jaligner/example/SmithWatermanGotohExample.java
deleted file mode 100644
index 1e6cb6b..0000000
--- a/Butterfly/src/src/jaligner/example/SmithWatermanGotohExample.java
+++ /dev/null
@@ -1,112 +0,0 @@
-/*
- * $Id: SmithWatermanGotohExample.java,v 1.1 2006/02/03 03:46:18 ahmed Exp $
- *
- * 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.
- */
-
-package jaligner.example;
-
-import jaligner.Alignment;
-import jaligner.Sequence;
-import jaligner.SmithWatermanGotoh;
-import jaligner.formats.Pair;
-import jaligner.matrix.MatrixLoader;
-import jaligner.util.SequenceParser;
-
-import java.io.IOException;
-import java.io.InputStream;
-import java.util.logging.Level;
-import java.util.logging.Logger;
-
-/**
- * Example of using JAligner API to align P53 human aganist
- * P53 mouse using Smith-Waterman-Gotoh algorithm.
- *
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class SmithWatermanGotohExample {
-	
-	/**
-	 * 
-	 */
-	private static final String SAMPLE_SEQUENCE_P35_HUMAN = "jaligner/example/sequences/p53_human.fasta";
-	
-	/**
-	 * 
-	 */
-	private static final String SAMPLE_SEQUENCE_P35_MOUSE = "jaligner/example/sequences/p53_mouse.fasta";
-	
-	/**
-	 * Logger
-	 */
-	private static final Logger logger = Logger.getLogger(SmithWatermanGotohExample.class.getName());
-	
-	/**
-	 * 
-	 * @param args
-	 */
-	public static void main(String[] args) {
-        try {
-        	logger.info("Running example...");
-        	
-			Sequence s1 = SequenceParser.parse(loadP53Human());  
-			Sequence s2 = SequenceParser.parse(loadP53Mouse());
-	        
-	        Alignment alignment = SmithWatermanGotoh.align(s1, s2, MatrixLoader.load("BLOSUM62"), 10f, 0.5f);
-	        
-	        System.out.println ( alignment.getSummary() );
-	        System.out.println ( new Pair().format(alignment) );
-	        
-	        logger.info("Finished running example");
-        } catch (Exception e) {
-        	logger.log(Level.SEVERE, "Failed running example: " + e.getMessage(), e);
-        }
-    }
-	
-	/**
-	 * 
-	 * @param path location of the sequence
-	 * @return sequence string
-	 * @throws IOException
-	 */
-	private static String loadSampleSequence(String path) throws IOException {
-		InputStream inputStream = NeedlemanWunschExample.class.getClassLoader().getResourceAsStream(path);
-        StringBuffer buffer = new StringBuffer();
-        int ch;
-        while ((ch = inputStream.read()) != -1) {
-            buffer.append((char)ch);
-        }
-        return buffer.toString();
-	}
-	
-	/**
-	 * 
-	 * @return sequence string
-	 * @throws IOException
-	 */
-	public static String loadP53Human( ) throws IOException {
-		return loadSampleSequence(SAMPLE_SEQUENCE_P35_HUMAN);
-	}
-
-	/**
-	 * 
-	 * @return sequence string
-	 * @throws IOException
-	 */
-	public static String loadP53Mouse( ) throws IOException {
-		return loadSampleSequence(SAMPLE_SEQUENCE_P35_MOUSE);
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/example/package.html b/Butterfly/src/src/jaligner/example/package.html
deleted file mode 100644
index 266497b..0000000
--- a/Butterfly/src/src/jaligner/example/package.html
+++ /dev/null
@@ -1,8 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-<html>
-<head><!--$Id: package.html,v 1.1 2005/05/25 19:56:30 ahmed Exp $--></head>
-<body bgcolor="white">
-Example for using API of JAligner to perform pairwise sequence alignment.
- at author Ahmed Moustafa (ahmed at users.sf.net)
-</body>
-</html>
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/example/sequences/p53_human.fasta b/Butterfly/src/src/jaligner/example/sequences/p53_human.fasta
deleted file mode 100644
index 1591a95..0000000
--- a/Butterfly/src/src/jaligner/example/sequences/p53_human.fasta
+++ /dev/null
@@ -1,7 +0,0 @@
->p53_human
-MEEPQSDPSVEPPLSQETFSDLWKLLPENNVLSPLPSQAMDDLMLSPDDIEQWFTEDPGPDEAPRMPEAA
-PRVAPAPAAPTPAAPAPAPSWPLSSSVPSQKTYQGSYGFRLGFLHSGTAKSVTCTYSPALNKMFCQLAKT
-CPVQLWVDSTPPPGTRVRAMAIYKQSQHMTEVVRRCPHHERCSDSDGLAPPQHLIRVEGNLRVEYLDDRN
-TFRHSVVVPYEPPEVGSDCTTIHYNYMCNSSCMGGMNRRPILTIITLEDSSGNLLGRNSFEVRVCACAGR
-DRRTEEENLRKKGEPHHELPPGSTKRALPNNTSSSPQPKKKPLDGEYFTLQIRGRERFEMFRELNEALEL
-KDAQAGKEPGGSRAHSSHLKSKKGQSTSRHKKLMFKTEGPDSD
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/example/sequences/p53_mouse.fasta b/Butterfly/src/src/jaligner/example/sequences/p53_mouse.fasta
deleted file mode 100644
index 9b011cd..0000000
--- a/Butterfly/src/src/jaligner/example/sequences/p53_mouse.fasta
+++ /dev/null
@@ -1,8 +0,0 @@
->p53_mouse
-MTAMEESQSDISLELPLSQETFSGLWKLLPPEDILPSPHCMDDLLLPQDVEEFFEGPSEA
-LRVSGAPAAQDPVTETPGPAAPAPATPWPLSSFVPSQKTYQGNYGFHLGFLQSGTAKSVM
-CTYSPPLNKLFCQLAKTCPVQLWVSATPPAGSRVRAMAIYKKSQHMTEVVRRCPHHERCS
-DGDGLAPPQHLIRVEGNLYPEYLEDRQTFRHSVVVPYEPPEAGSEYTTIHYKYMCNSSCM
-GGMNRRPILTIITLEDSSGNLLGRDSFEVRVCACPGRDRRTEEENFRKKEVLCPELPPGS
-AKRALPTCTSASPPQKKKPLDGEYFTLKIRGRKRFEMFRELNEALELKDAHATEESGDSR
-AHSSYLKTKKGQSTSRHKKTMVKKVGPDSD
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/formats/CLUSTAL.java b/Butterfly/src/src/jaligner/formats/CLUSTAL.java
deleted file mode 100644
index 3d2533e..0000000
--- a/Butterfly/src/src/jaligner/formats/CLUSTAL.java
+++ /dev/null
@@ -1,121 +0,0 @@
-/*
- * $Id: CLUSTAL.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.formats;
-
-import jaligner.Alignment;
-
-/**
- * CLUSTAL format.
- * Example:
- * <pre>
- * <small>
- * CLUSTAL_FORMAT W(1.60) multiple sequence alignment
- *
- *
- * JC2395          NVSDVNLNK---YIWRTAEKMK---ICDAKKFARQHKIPESKIDEIEHNSPQDAAE----
- * KPEL_DROME      MAIRLLPLPVRAQLCAHLDAL-----DVWQQLATAVKLYPDQVEQISSQKQRGRS-----
- * FASA_MOUSE      NASNLSLSK---YIPRIAEDMT---IQEAKKFARENNIKEGKIDEIMHDSIQDTAE----
- *
- *
- * JC2395          -------------------------QKIQLLQCWYQSHGKT--GACQALIQGLRKANRCD
- * KPEL_DROME      -------------------------ASNEFLNIWGGQYN----HTVQTLFALFKKLKLHN
- * FASA_MOUSE      -------------------------QKVQLLLCWYQSHGKS--DAYQDLIKGLKKAECRR
- *
- *
- * JC2395          IAEEIQAM
- * KPEL_DROME      AMRLIKDY
- * FASA_MOUSE      TLDKFQDM
- * </small>
- * </pre>
- *
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class CLUSTAL extends Format {
-	
-	/**
-	 * Name width 
-	 */
-    private static final int NAME_WIDTH = 36;
-	
-    /**
-	 * Sequence width
-	 */
-    private static final int SEQUENCE_WIDTH = 50;
-	
-    /**
-	 * CLUSTAL header
-	 */
-    private static final String HEADER = "CLUSTAL_FORMAT W(1.60) multiple sequence alignment\n\n";
-	
-	/**
-	 * Constructor
-	 */
-	public CLUSTAL() {
-		super( );
-		setId("CLUSTAL");
-	}
-	
-	/**
-	 * Returns CLUSTAL format
-	 * @param names array of the names of the sequences.
-	 * @param sequences	array of the sequences 
-	 */
-	public String format(String[] names, String[] sequences) {
-		StringBuffer buffer = new StringBuffer (HEADER);
-		int maxSequenceLength = 0;
-		for (int i = 0; i < sequences.length; i++) {
-			if (sequences[i].length() > maxSequenceLength) {
-				maxSequenceLength = sequences[i].length(); 
-			}
-		}
-		
-		for (int i = 0; i * SEQUENCE_WIDTH < maxSequenceLength; i++) {
-			
-			for (int j = 0; j < sequences.length; j++) {
-				buffer.append(  NAME_WIDTH <= names[j].length() ? names[j].substring(0, NAME_WIDTH - 1) : names[j] ); 
-				for (int k = names[j].length(); k < NAME_WIDTH; k++) {
-					buffer.append(" ");
-				}
-				if (names[j].length() >= NAME_WIDTH) {
-					buffer.append(" ");
-				}
-				buffer.append(sequences[j].substring(i * SEQUENCE_WIDTH, ((i + 1) * SEQUENCE_WIDTH) < sequences[j].length() ? (i + 1) * SEQUENCE_WIDTH: sequences[j].length()));
-				if (j < sequences.length) {
-					buffer.append("\n");
-				}
-			}
-			if ((i + 1) * SEQUENCE_WIDTH < maxSequenceLength) {
-				buffer.append("\n\n");
-			}
-		}
-		return buffer.toString();
-	}
-
-	/**
-	 * Returns CLUSTAL format of the alignment
-	 * @param alignment ({@link Alignment})
-	 * @return CLUSTAL format of the alignment 
-	 */
-	public String format (Alignment alignment) {
-		String[] sequences = {new String(alignment.getSequence1()), new String(alignment.getSequence2())};
-		String[] names = {alignment.getName1(), alignment.getName2()};
-		return format (names, sequences);
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/formats/FASTA.java b/Butterfly/src/src/jaligner/formats/FASTA.java
deleted file mode 100644
index 0aab4e1..0000000
--- a/Butterfly/src/src/jaligner/formats/FASTA.java
+++ /dev/null
@@ -1,79 +0,0 @@
-/*
- * $Id: FASTA.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.formats;
-
-import jaligner.Alignment;
-import jaligner.Sequence;
-
-/**
- * <a href="http://www.ncbi.nlm.nih.gov/BLAST/fasta.html">FASTA</a> format.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class FASTA extends Format {
-	
-	/**
-	 * Number of characters per line
-	 */
-    private static final int LINE_WIDTH = 60;
-	
-    /**
-	 * Constructor for FASTA.
-	 */
-	public FASTA() {
-		super( );
-		setId("FASTA");
-	}
-	
-	/**
-	 * Returns the name, description and sequence combined in one string.
-	 * The length of each line in the sequence is FASTA.LINE_LENGTH
-	 * 
-	 * @return String
-	 */
-	public String format (Sequence sequence) {
-		StringBuffer buffer = new StringBuffer (">");
-		buffer.append(sequence.getId() == null ? "" : sequence.getId());
-		buffer.append("\n");
-        for (int i = 0, n = sequence.length(); i * LINE_WIDTH < n; i++) {
-        	for (int j = i * LINE_WIDTH, m = (i + 1) * LINE_WIDTH < n ? (i + 1) * LINE_WIDTH: n; j < m; j++) {
-        		buffer.append(sequence.subsequence(j, 1));
-        	}
-        	buffer.append("\n");
-        }
-		return buffer.toString( );
-	}
-
-	/**
-	 * 
-	 * @param alignment
-	 * @return FASTA format of the input alignment
-	 */
-	public String format (Alignment alignment) {
-		StringBuffer buffer = new StringBuffer();
-		StringBuffer s1 = new StringBuffer();
-		StringBuffer s2 = new StringBuffer();
-		s1.append(alignment.getSequence1());
-		s2.append(alignment.getSequence2());
-		buffer.append(format(new Sequence(s1.toString(), alignment.getName1(), "", Sequence.PROTEIN)));
-		buffer.append(format(new Sequence(s2.toString(), alignment.getName2(), "", Sequence.PROTEIN)));
-		return buffer.toString();
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/formats/Format.java b/Butterfly/src/src/jaligner/formats/Format.java
deleted file mode 100644
index d2aedb6..0000000
--- a/Butterfly/src/src/jaligner/formats/Format.java
+++ /dev/null
@@ -1,59 +0,0 @@
-/*
- * $Id: Format.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.formats;
-
-import jaligner.Alignment;
-
-/**
- * Abstract format
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public abstract class Format {
-	
-	/**
-	 * Format id
-	 */
-	private String id = null;
-	
-	/**
-	 * Formats alignment
-	 * @param alignment
-	 * @return formatted alignment
-	 * @see Alignment
-	 */
-	public abstract String format(Alignment alignment);
-	
-	/**
-	 * Sets format id
-	 * @param id to set
-	 */
-	public void setId (String id) {
-		this.id =  id;
-	}
-	
-	/**
-	 * Returns format id
-	 * @return id
-	 */
-	public String getId ( ) {
-		return this.id == null ? this.getClass().getName() : this.id;
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/formats/FormatFactory.java b/Butterfly/src/src/jaligner/formats/FormatFactory.java
deleted file mode 100644
index 53d1b8a..0000000
--- a/Butterfly/src/src/jaligner/formats/FormatFactory.java
+++ /dev/null
@@ -1,84 +0,0 @@
-/*
- * $Id: FormatFactory.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.formats;
-
-import java.util.Collection;
-import java.util.HashMap;
-
-/**
- * Formats factory.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class FormatFactory {
-    /**
-     * Instance of {@link FormatFactory}
-     */
-	private static FormatFactory instance = null;
-    
-    /**
-     * {@link HashMap} of {@link Format}
-     */
-	private HashMap formats = new HashMap();
-	
-	/**
-	 * Hidden constructor
-	 *
-	 */
-	private FormatFactory ( ) {
-		super();
-	}
-	
-	/**
-     * Returns an instance for {@link FormatFactory}.
-     * @return {@link FormatFactory}
-     */
-    public static FormatFactory getInstance() {
-    	if (instance == null) {
-    		instance = new FormatFactory();
-    	}
-    	return instance;
-    }
-    
-    /**
-     * Registers format.
-     * @param format instance of format
-     */
-    public void registerFormat(Format format) {
-    	formats.put(format.getId(), format);
-    }
-    
-    /**
-     * Returns an instance of {@link Format}.
-     * @param id format id
-     * @return {@link Format} or null if id not found
-     */
-    public Format getFormat(String id) {
-    	return (Format) formats.get(id);
-    }
-    
-    /**
-     * Returns a list of registered formats
-     * @return {@link Collection}
-     */
-    public Collection getFormats( ) {
-    	return formats.keySet();
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/formats/Pair.java b/Butterfly/src/src/jaligner/formats/Pair.java
deleted file mode 100644
index dc89158..0000000
--- a/Butterfly/src/src/jaligner/formats/Pair.java
+++ /dev/null
@@ -1,191 +0,0 @@
-/*
- * $Id: Pair.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.formats;
-
-import jaligner.Alignment;
-import jaligner.util.Commons;
-
-/**
- * <a href="http://www.hgmp.mrc.ac.uk/Software/EMBOSS/Themes/AlignExamples/align.pair">Pair</a> format.
- *
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class Pair extends Format {
-	
-	/**
-	 * Name width 
-	 */
-    private static final int NAME_WIDTH = 13;
-	
-    /**
-     * Position width
-     */
-    private static final int POSITION_WIDTH = 6;
-	
-    /**
-     * Sequence width
-     */
-    private static final int SEQUENCE_WIDTH = 50;
-	
-    /**
-     * Space
-     */
-    private static final String BLANK = " ";
-    
-    /**
-     * Constructor
-     *
-     */
-    public Pair( ) {
-    	super();
-    	setId("Pair");
-    }
-	
-	/**
-	 * Formats an alignment object to the Pair_FORMAT format
-	 * @param alignment alignment object to be formated
-	 * @return string of the alignment pair-formatted
-	 */
-	public String format(Alignment alignment) {
-		char[] sequence1 = alignment.getSequence1();
-		char[] sequence2 = alignment.getSequence2();
-		char[] markup = alignment.getMarkupLine();
-		
-		int length = sequence1.length > sequence2.length ? sequence2.length : sequence1.length;
-		
-		String name1 = adjustName(alignment.getName1());
-		String name2 = adjustName(alignment.getName2());
-
-		StringBuffer buffer = new StringBuffer ( );
-		
-		StringBuffer preMarkup = new StringBuffer ( );
-		for (int j = 0; j < NAME_WIDTH + 1 + POSITION_WIDTH + 1; j++) {
-			preMarkup.append(BLANK);
-		}
-		
-		int oldPosition1, position1 = 1 + alignment.getStart1();
-		int oldPosition2, position2 = 1 + alignment.getStart2();
-		
-		char[] subsequence1;
-		char[] subsequence2;
-		char[] submarkup;
-		int line;
-		
-		char c1, c2;
-		
-		for (int i = 0; i * SEQUENCE_WIDTH < length; i++) {
-			
-			oldPosition1 = position1;
-			oldPosition2 = position2;
-			
-			line = ((i + 1) * SEQUENCE_WIDTH) < length ? (i + 1) * SEQUENCE_WIDTH: length;
-
-			subsequence1 = new char[line - i * SEQUENCE_WIDTH];
-			subsequence2 = new char[line - i * SEQUENCE_WIDTH];
-			submarkup = new char[line - i * SEQUENCE_WIDTH];
-		
-			for (int j = i * SEQUENCE_WIDTH, k = 0; j < line; j++, k++) {
-				subsequence1[k] = sequence1[j];
-				subsequence2[k] = sequence2[j];
-				submarkup[k] = markup[j];
-				c1 = subsequence1[k];
-				c2 = subsequence2[k];
-				if (c1 == c2) {
-					position1++;
-					position2++;
-				} else if (c1 == Alignment.GAP) {
-					position2++;
-				} else if (c2 == Alignment.GAP) {
-					position1++;
-				} else {
-					position1++;
-					position2++;
-				}
-			}
-
-			buffer.append(name1);
-			buffer.append(BLANK);
-			buffer.append(adjustPosition(new Integer(oldPosition1).toString()));
-			buffer.append(BLANK);
-			buffer.append(subsequence1);
-			buffer.append(BLANK);
-			buffer.append(adjustPosition(new Integer(position1 - 1).toString()));
-			buffer.append(Commons.getLineSeparator());
-			
-			buffer.append(preMarkup);
-			buffer.append(submarkup);
-			buffer.append(Commons.getLineSeparator());
-
-			buffer.append(name2);
-			buffer.append(BLANK);
-			buffer.append(adjustPosition(new Integer(oldPosition2).toString()));
-			buffer.append(BLANK);
-			buffer.append(subsequence2);
-			buffer.append(BLANK);
-			buffer.append(adjustPosition(new Integer(position2 - 1).toString()));
-			buffer.append(Commons.getLineSeparator());
-			
-			buffer.append(Commons.getLineSeparator());
-		}
-		return buffer.toString();
-	}
-	
-	/**
-	 * 
-	 * @param name name to adjusted
-	 * @return adjusted name
-	 */
-	private String adjustName(String name) {
-		StringBuffer buffer = new StringBuffer ( );
-		
-		if (name.length() > NAME_WIDTH) {
-			buffer.append(name.substring(0, NAME_WIDTH));
-		} else {
-			buffer.append(name);
-			for (int j = buffer.length(); j < NAME_WIDTH; j++) {
-				buffer.append (BLANK);
-			}
-		}
-		return buffer.toString();
-	}
-	
-	/**
-	 * 
-	 * @param position
-	 * @return string
-	 */
-	private String adjustPosition(String position) {
-		StringBuffer buffer1 = new StringBuffer( );
-		StringBuffer buffer2 = new StringBuffer( );
-		
-		if (position.length() > POSITION_WIDTH) {
-			buffer1.append(position.substring(position.length() - POSITION_WIDTH, position.length()));
-		} else {
-			buffer1.append(position);
-		}
-		
-		for (int j = 0, n = POSITION_WIDTH - buffer1.length(); j < n; j++) {
-			buffer2.append(BLANK);
-		}
-		
-		buffer2.append(buffer1.toString());
-		return buffer2.toString();
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/formats/package.html b/Butterfly/src/src/jaligner/formats/package.html
deleted file mode 100644
index cf19168..0000000
--- a/Butterfly/src/src/jaligner/formats/package.html
+++ /dev/null
@@ -1,8 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-<html>
-<head><!--$Id: package.html,v 1.1 2005/05/25 19:56:30 ahmed Exp $--></head>
-<body bgcolor="white">
-Group of formats for output alignments.
- at author Ahmed Moustafa (ahmed at users.sf.net)
-</body>
-</html>
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/matrix/MatricesCompartor.java b/Butterfly/src/src/jaligner/matrix/MatricesCompartor.java
deleted file mode 100644
index 516ae5b..0000000
--- a/Butterfly/src/src/jaligner/matrix/MatricesCompartor.java
+++ /dev/null
@@ -1,68 +0,0 @@
-/*
- * $Id: MatricesCompartor.java,v 1.1 2005/05/25 19:56:30 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.matrix;
-
-import java.util.Comparator;
-
-/**
- * Comparator to sort the scoring matrices by their names. 
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class MatricesCompartor implements Comparator {
-
-	/* (non-Javadoc)
-	 * @see java.util.Comparator#compare(java.lang.Object, java.lang.Object)
-	 */
-	public int compare(Object o1, Object o2) {
-		String s1 = (String) o1;
-		String s2 = (String) o2;
-		
-		int index1 = firstDigitIndex(s1);
-		int index2 = firstDigitIndex(s2);
-		
-		if (index1 == -1 || index2 == -1) {
-			return s1.compareToIgnoreCase(s2); 
-		} else {
-			String s3 = s1.substring(0, index1);
-			String s4 = s2.substring(0, index2);
-			if (s3.equalsIgnoreCase(s4)) {
-				return new Integer(s1.substring(index1)).compareTo(new Integer(s2.substring(index2)));
-			} else {
-				return s1.compareToIgnoreCase(s2);
-			}
-		}
-	}
-	
-	/**
-	 * Returns the index of the first digit in a String.
-	 * If there are no digits, returns -1.
-	 * @param s	String to be searched for the digits in
-	 * @return int
-	 */
-	private int firstDigitIndex (String s) {
-		for (int i = 0; i < s.length(); i++) {
-			if (s.charAt(i) >= '0' && s.charAt(i) <= '9') {
-				return i;  
-			}
-		}
-		return -1;
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/matrix/Matrix.java b/Butterfly/src/src/jaligner/matrix/Matrix.java
deleted file mode 100644
index 71389f1..0000000
--- a/Butterfly/src/src/jaligner/matrix/Matrix.java
+++ /dev/null
@@ -1,80 +0,0 @@
-/*
- * $Id: Matrix.java,v 1.2 2006/01/18 20:16:37 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.matrix;
-
-import java.io.Serializable;
-
-/**
- * Scoring matrix.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class Matrix implements Serializable {
-	/**
-	 * 
-	 */
-	private static final long serialVersionUID = 3833742170619524400L;
-	
-	/**
-	 * The size of the scoring matrix. It is the number of the characters in the
-	 * ASCII table. It is more than the 20 amino acids just to save the
-	 * processing time of the mapping.
-	 */
-	public static final int SIZE = 127;
-
-	/**
-	 * Matrix id (or name)
-	 */
-	private final String id;
-
-	/**
-	 * Scores
-	 */
-	private final float[][] scores;
-
-	public Matrix(String id, float[][] scores) {
-		this.id = id;
-		this.scores = scores;
-	}
-
-	/**
-	 * @return Returns the id.
-	 */
-	public String getId() {
-		return this.id;
-	}
-
-	/**
-	 * @return Returns the scores.
-	 */
-	public float[][] getScores() {
-		return this.scores;
-	}
-
-	/**
-	 * 
-	 * @param a
-	 * @param b
-	 * @return score
-	 */
-	public float getScore(char a, char b) {
-		return this.scores[a][b];
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/matrix/MatrixGenerator.java b/Butterfly/src/src/jaligner/matrix/MatrixGenerator.java
deleted file mode 100644
index f1b94b1..0000000
--- a/Butterfly/src/src/jaligner/matrix/MatrixGenerator.java
+++ /dev/null
@@ -1,61 +0,0 @@
-/*
- * $Id: MatrixGenerator.java,v 1.3 2006/02/26 20:26:41 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.matrix;
-
-/**
- * A utility class to generate a scoring matrix from a fixed match and mismatch
- * scoring scheme.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public final class MatrixGenerator {
-
-    /**
-     * Returns scoring matrix from a fixed match/mismatch scoring scheme.
-     * 
-     * @param match
-     *            match score
-     * @param mismatch
-     *            mistmatch score
-     * 
-     * @return scoring matrix
-     */
-    public static Matrix generate(float match, float mismatch) {
-        float[][] scores = new float[Matrix.SIZE][Matrix.SIZE];
-
-        // Fill the matrix with the scores
-        for (int i = 0; i < Matrix.SIZE; i++) {
-            for (int j = 0; j < Matrix.SIZE; j++) {
-                if (i == j || i == 'N' || j == 'N') {
-                    scores[i][j] = match;
-                } else {
-                    scores[i][j] = mismatch;
-                }
-            }
-        }
-
-        // Generate some id for the matrix (hopefully to be somehow unique)
-        String id = new Long(System.currentTimeMillis()).toString();
-
-        Matrix matrix = new Matrix(id, scores);
-
-        return matrix;
-    }
-}
diff --git a/Butterfly/src/src/jaligner/matrix/MatrixLoader.java b/Butterfly/src/src/jaligner/matrix/MatrixLoader.java
deleted file mode 100644
index c206090..0000000
--- a/Butterfly/src/src/jaligner/matrix/MatrixLoader.java
+++ /dev/null
@@ -1,243 +0,0 @@
-/*
- * $Id: MatrixLoader.java,v 1.3 2006/01/18 20:16:37 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.matrix;
-
-import jaligner.ui.filechooser.NamedInputStream;
-import jaligner.util.Commons;
-
-import java.io.BufferedReader;
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.InputStream;
-import java.io.InputStreamReader;
-import java.net.JarURLConnection;
-import java.net.URL;
-import java.net.URLDecoder;
-import java.util.ArrayList;
-import java.util.Collection;
-import java.util.Collections;
-import java.util.Enumeration;
-import java.util.StringTokenizer;
-import java.util.jar.JarEntry;
-import java.util.jar.JarFile;
-import java.util.logging.Level;
-import java.util.logging.Logger;
-
-/**
- * Scoring matrices loader from a jar file or a file system.
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class MatrixLoader {
-	/**
-	 * The starter character of a comment line.
-	 */
-	private static final char COMMENT_STARTER = '#';
-
-	/**
-	 * The path to the matrices within the package.
-	 */
-	private static final String MATRICES_HOME = "jaligner/matrix/matrices/";
-
-	/**
-	 * Logger
-	 */
-	private static final Logger logger = Logger.getLogger(MatrixLoader.class
-			.getName());
-
-	/**
-	 * Loads scoring matrix from Jar file or file system.
-	 * 
-	 * @param matrix
-	 *            to load
-	 * @return loaded matrix
-	 * @throws MatrixLoaderException
-	 * @see Matrix
-	 */
-	public static Matrix load(String matrix) throws MatrixLoaderException {
-		InputStream is = null;
-
-		if (new StringTokenizer(matrix, Commons.getFileSeparator())
-				.countTokens() == 1) {
-			// Matrix does not include the path
-			// Load the matrix from matrices.jar
-			is = MatrixLoader.class.getClassLoader().getResourceAsStream(
-					MATRICES_HOME + matrix);
-		} else {
-			// Matrix includes the path information
-			// Load the matrix from the file system
-			try {
-				is = new FileInputStream(matrix);
-			} catch (Exception e) {
-				String message = "Failed opening input stream: "
-						+ e.getMessage();
-				logger.log(Level.SEVERE, message, e);
-				throw new MatrixLoaderException(message);
-			}
-		}
-
-		return load(new NamedInputStream(matrix, is));
-	}
-
-	/**
-	 * Loads scoring matrix from {@link InputStream}
-	 * 
-	 * @param nis
-	 *            named input stream
-	 * @return loaded matrix
-	 * @throws MatrixLoaderException
-	 * @see Matrix
-	 * @see NamedInputStream
-	 */
-	public static Matrix load(NamedInputStream nis)
-			throws MatrixLoaderException {
-		logger.info("Loading scoring matrix...");
-		char[] acids = new char[Matrix.SIZE];
-
-		// Initialize the acids array to null values (ascii = 0)
-		for (int i = 0; i < Matrix.SIZE; i++) {
-			acids[i] = 0;
-		}
-
-		float[][] scores = new float[Matrix.SIZE][Matrix.SIZE];
-
-		BufferedReader reader = new BufferedReader(new InputStreamReader(nis
-				.getInputStream()));
-
-		String line;
-
-		try {
-			// Skip the comment lines
-			while ((line = reader.readLine()) != null
-					&& line.trim().charAt(0) == COMMENT_STARTER)
-				;
-		} catch (Exception e) {
-			String message = "Failed reading from input stream: "
-					+ e.getMessage();
-			logger.log(Level.SEVERE, message, e);
-			throw new MatrixLoaderException(message);
-		}
-
-		// Read the headers line (the letters of the acids)
-		StringTokenizer tokenizer;
-		tokenizer = new StringTokenizer(line.trim());
-		for (int j = 0; tokenizer.hasMoreTokens(); j++) {
-			acids[j] = tokenizer.nextToken().charAt(0);
-		}
-
-		try {
-			// Read the scores
-			while ((line = reader.readLine()) != null) {
-				tokenizer = new StringTokenizer(line.trim());
-				char acid = tokenizer.nextToken().charAt(0);
-				for (int i = 0; i < Matrix.SIZE; i++) {
-					if (acids[i] != 0) {
-						scores[acid][acids[i]] = Float.parseFloat(tokenizer
-								.nextToken());
-					}
-				}
-			}
-		} catch (Exception e) {
-			String message = "Failed reading from input stream: "
-					+ e.getMessage();
-			logger.log(Level.SEVERE, message, e);
-			throw new MatrixLoaderException(message);
-		}
-		logger.info("Finished loading scoring matrix");
-		return new Matrix(nis.getName(), scores);
-	}
-
-	/**
-	 * Returns a list of the scoring matrices in the matrices home directory
-	 * 
-	 * @param sort
-	 *            flag to sort the list or not
-	 * @return sorted array of scoring matrices
-	 * @throws MatrixLoaderException
-	 */
-	public static Collection list(boolean sort) throws MatrixLoaderException {
-		logger.info("Loading list of scoring matrices...");
-		ArrayList matrices = new ArrayList();
-		URL url = MatrixLoader.class.getClassLoader()
-				.getResource(MATRICES_HOME);
-		if (url.getFile().toString().indexOf("!") != -1) {
-			// Load from Jar
-			JarURLConnection connection = null;
-			JarFile jar = null;
-			try {
-				connection = (JarURLConnection) url.openConnection();
-				jar = connection.getJarFile();
-			} catch (Exception e) {
-				String message = "Failed opening a connection to jar: "
-						+ e.getMessage();
-				logger.log(Level.SEVERE, message, e);
-				throw new MatrixLoaderException(message);
-			}
-			Enumeration entries = jar.entries();
-			JarEntry entry;
-			String entryName;
-			int length = MATRICES_HOME.length();
-			while (entries.hasMoreElements()) {
-				entry = (JarEntry) entries.nextElement();
-				if (!entry.isDirectory()) {
-					entryName = entry.getName();
-					if (entryName.startsWith(MATRICES_HOME)) {
-						matrices.add(entryName.substring(length));
-					}
-				}
-			}
-		} else {
-			// Load from file system
-			String home = null;
-			try {
-				home = URLDecoder.decode(url.getFile(), "UTF-8");
-			} catch (Exception e) {
-				String message = "Failed decoding matrices url: "
-						+ e.getMessage();
-				logger.log(Level.SEVERE, message, e);
-				throw new MatrixLoaderException(message);
-			}
-			File dir = new File(home);
-			String files[] = dir.list();
-			File file;
-			for (int i = 0, n = files.length; i < n; i++) {
-				file = new File(home + files[i]);
-				if (file.isFile() && file.canRead()) {
-					matrices.add(file.getName());
-				}
-			}
-		}
-		if (sort) {
-			Collections.sort(matrices, new MatricesCompartor());
-		}
-		logger.info("Finished loading list of scoring matrices");
-		return matrices;
-	}
-
-	/**
-	 * Returns a list of the scoring matrices in the matrices home directory
-	 * 
-	 * @return sorted array of scoring matrices
-	 * @throws MatrixLoaderException
-	 */
-	public static Collection list() throws MatrixLoaderException {
-		return list(false);
-	}
-}
diff --git a/Butterfly/src/src/jaligner/matrix/MatrixLoaderException.java b/Butterfly/src/src/jaligner/matrix/MatrixLoaderException.java
deleted file mode 100644
index a62783b..0000000
--- a/Butterfly/src/src/jaligner/matrix/MatrixLoaderException.java
+++ /dev/null
@@ -1,39 +0,0 @@
-/*
- * @author Ahmed Moustafa (ahmed at users.sourceforge.net)
- * 
- * 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.
- */
-
-package jaligner.matrix;
-
-/**
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class MatrixLoaderException extends Exception {
-
-	/**
-     * 
-     */
-    private static final long serialVersionUID = 3906364935142586680L;
-
-    /**
-	 * @param message
-	 */
-	public MatrixLoaderException(String message) {
-		super(message);
-	}
-}
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM100 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM100
deleted file mode 100644
index 46e9e85..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM100
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum100_3.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/3 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 100
-#  Entropy =   1.4516, Expected =  -1.0948
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  8 -3 -4 -5 -2 -2 -3 -1 -4 -4 -4 -2 -3 -5 -2  1 -1 -6 -5 -2 -4 -2 -2 -10 
-R -3 10 -2 -5 -8  0 -2 -6 -1 -7 -6  3 -4 -6 -5 -3 -3 -7 -5 -6 -4 -1 -3 -10 
-N -4 -2 11  1 -5 -1 -2 -2  0 -7 -7 -1 -5 -7 -5  0 -1 -8 -5 -7  5 -2 -3 -10 
-D -5 -5  1 10 -8 -2  2 -4 -3 -8 -8 -3 -8 -8 -5 -2 -4 -10 -7 -8  6  0 -4 -10 
-C -2 -8 -5 -8 14 -7 -9 -7 -8 -3 -5 -8 -4 -4 -8 -3 -3 -7 -6 -3 -7 -8 -5 -10 
-Q -2  0 -1 -2 -7 11  2 -5  1 -6 -5  2 -2 -6 -4 -2 -3 -5 -4 -5 -2  5 -2 -10 
-E -3 -2 -2  2 -9  2 10 -6 -2 -7 -7  0 -5 -8 -4 -2 -3 -8 -7 -5  0  7 -3 -10 
-G -1 -6 -2 -4 -7 -5 -6  9 -6 -9 -8 -5 -7 -8 -6 -2 -5 -7 -8 -8 -3 -5 -4 -10 
-H -4 -1  0 -3 -8  1 -2 -6 13 -7 -6 -3 -5 -4 -5 -3 -4 -5  1 -7 -2 -1 -4 -10 
-I -4 -7 -7 -8 -3 -6 -7 -9 -7  8  2 -6  1 -2 -7 -5 -3 -6 -4  4 -8 -7 -3 -10 
-L -4 -6 -7 -8 -5 -5 -7 -8 -6  2  8 -6  3  0 -7 -6 -4 -5 -4  0 -8 -6 -3 -10 
-K -2  3 -1 -3 -8  2  0 -5 -3 -6 -6 10 -4 -6 -3 -2 -3 -8 -5 -5 -2  0 -3 -10 
-M -3 -4 -5 -8 -4 -2 -5 -7 -5  1  3 -4 12 -1 -5 -4 -2 -4 -5  0 -7 -4 -3 -10 
-F -5 -6 -7 -8 -4 -6 -8 -8 -4 -2  0 -6 -1 11 -7 -5 -5  0  4 -3 -7 -7 -4 -10 
-P -2 -5 -5 -5 -8 -4 -4 -6 -5 -7 -7 -3 -5 -7 12 -3 -4 -8 -7 -6 -5 -4 -4 -10 
-S  1 -3  0 -2 -3 -2 -2 -2 -3 -5 -6 -2 -4 -5 -3  9  2 -7 -5 -4 -1 -2 -2 -10 
-T -1 -3 -1 -4 -3 -3 -3 -5 -4 -3 -4 -3 -2 -5 -4  2  9 -7 -5 -1 -2 -3 -2 -10 
-W -6 -7 -8 -10 -7 -5 -8 -7 -5 -6 -5 -8 -4  0 -8 -7 -7 17  2 -5 -9 -7 -6 -10 
-Y -5 -5 -5 -7 -6 -4 -7 -8  1 -4 -4 -5 -5  4 -7 -5 -5  2 12 -5 -6 -6 -4 -10 
-V -2 -6 -7 -8 -3 -5 -5 -8 -7  4  0 -5  0 -3 -6 -4 -1 -5 -5  8 -7 -5 -3 -10 
-B -4 -4  5  6 -7 -2  0 -3 -2 -8 -8 -2 -7 -7 -5 -1 -2 -9 -6 -7  6  0 -4 -10 
-Z -2 -1 -2  0 -8  5  7 -5 -1 -7 -6  0 -4 -7 -4 -2 -3 -7 -6 -5  0  6 -2 -10 
-X -2 -3 -3 -4 -5 -2 -3 -4 -4 -3 -3 -3 -3 -4 -4 -2 -2 -6 -4 -3 -4 -2 -3 -10 
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM30 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM30
deleted file mode 100644
index 81ebd98..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM30
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum30.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/5 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 30
-#  Entropy =   0.1424, Expected =  -0.1074
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -1  0  0 -3  1  0  0 -2  0 -1  0  1 -2 -1  1  1 -5 -4  1  0  0  0 -7 
-R -1  8 -2 -1 -2  3 -1 -2 -1 -3 -2  1  0 -1 -1 -1 -3  0  0 -1 -2  0 -1 -7 
-N  0 -2  8  1 -1 -1 -1  0 -1  0 -2  0  0 -1 -3  0  1 -7 -4 -2  4 -1  0 -7 
-D  0 -1  1  9 -3 -1  1 -1 -2 -4 -1  0 -3 -5 -1  0 -1 -4 -1 -2  5  0 -1 -7 
-C -3 -2 -1 -3 17 -2  1 -4 -5 -2  0 -3 -2 -3 -3 -2 -2 -2 -6 -2 -2  0 -2 -7 
-Q  1  3 -1 -1 -2  8  2 -2  0 -2 -2  0 -1 -3  0 -1  0 -1 -1 -3 -1  4  0 -7 
-E  0 -1 -1  1  1  2  6 -2  0 -3 -1  2 -1 -4  1  0 -2 -1 -2 -3  0  5 -1 -7 
-G  0 -2  0 -1 -4 -2 -2  8 -3 -1 -2 -1 -2 -3 -1  0 -2  1 -3 -3  0 -2 -1 -7 
-H -2 -1 -1 -2 -5  0  0 -3 14 -2 -1 -2  2 -3  1 -1 -2 -5  0 -3 -2  0 -1 -7 
-I  0 -3  0 -4 -2 -2 -3 -1 -2  6  2 -2  1  0 -3 -1  0 -3 -1  4 -2 -3  0 -7 
-L -1 -2 -2 -1  0 -2 -1 -2 -1  2  4 -2  2  2 -3 -2  0 -2  3  1 -1 -1  0 -7 
-K  0  1  0  0 -3  0  2 -1 -2 -2 -2  4  2 -1  1  0 -1 -2 -1 -2  0  1  0 -7 
-M  1  0  0 -3 -2 -1 -1 -2  2  1  2  2  6 -2 -4 -2  0 -3 -1  0 -2 -1  0 -7 
-F -2 -1 -1 -5 -3 -3 -4 -3 -3  0  2 -1 -2 10 -4 -1 -2  1  3  1 -3 -4 -1 -7 
-P -1 -1 -3 -1 -3  0  1 -1  1 -3 -3  1 -4 -4 11 -1  0 -3 -2 -4 -2  0 -1 -7 
-S  1 -1  0  0 -2 -1  0  0 -1 -1 -2  0 -2 -1 -1  4  2 -3 -2 -1  0 -1  0 -7 
-T  1 -3  1 -1 -2  0 -2 -2 -2  0  0 -1  0 -2  0  2  5 -5 -1  1  0 -1  0 -7 
-W -5  0 -7 -4 -2 -1 -1  1 -5 -3 -2 -2 -3  1 -3 -3 -5 20  5 -3 -5 -1 -2 -7 
-Y -4  0 -4 -1 -6 -1 -2 -3  0 -1  3 -1 -1  3 -2 -2 -1  5  9  1 -3 -2 -1 -7 
-V  1 -1 -2 -2 -2 -3 -3 -3 -3  4  1 -2  0  1 -4 -1  1 -3  1  5 -2 -3  0 -7 
-B  0 -2  4  5 -2 -1  0  0 -2 -2 -1  0 -2 -3 -2  0  0 -5 -3 -2  5  0 -1 -7 
-Z  0  0 -1  0  0  4  5 -2  0 -3 -1  1 -1 -4  0 -1 -1 -1 -2 -3  0  4  0 -7 
-X  0 -1  0 -1 -2  0 -1 -1 -1  0  0  0  0 -1 -1  0  0 -2 -1  0 -1  0 -1 -7 
-* -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM35 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM35
deleted file mode 100644
index a6d99f5..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM35
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum35.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/4 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 35
-#  Entropy =   0.2111, Expected =  -0.1550
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -1 -1 -1 -2  0 -1  0 -2 -1 -2  0  0 -2 -2  1  0 -2 -1  0 -1 -1  0 -5 
-R -1  8 -1 -1 -3  2 -1 -2 -1 -3 -2  2  0 -1 -2 -1 -2  0  0 -1 -1  0 -1 -5 
-N -1 -1  7  1 -1  1 -1  1  1 -1 -2  0 -1 -1 -2  0  0 -2 -2 -2  4  0  0 -5 
-D -1 -1  1  8 -3 -1  2 -2  0 -3 -2 -1 -3 -3 -1 -1 -1 -3 -2 -2  5  1 -1 -5 
-C -2 -3 -1 -3 15 -3 -1 -3 -4 -4 -2 -2 -4 -4 -4 -3 -1 -5 -5 -2 -2 -2 -2 -5 
-Q  0  2  1 -1 -3  7  2 -2 -1 -2 -2  0 -1 -4  0  0  0 -1  0 -3  0  4 -1 -5 
-E -1 -1 -1  2 -1  2  6 -2 -1 -3 -1  1 -2 -3  0  0 -1 -1 -1 -2  0  5 -1 -5 
-G  0 -2  1 -2 -3 -2 -2  7 -2 -3 -3 -1 -1 -3 -2  1 -2 -1 -2 -3  0 -2 -1 -5 
-H -2 -1  1  0 -4 -1 -1 -2 12 -3 -2 -2  1 -3 -1 -1 -2 -4  0 -4  0 -1 -1 -5 
-I -1 -3 -1 -3 -4 -2 -3 -3 -3  5  2 -2  1  1 -1 -2 -1 -1  0  4 -2 -3  0 -5 
-L -2 -2 -2 -2 -2 -2 -1 -3 -2  2  5 -2  3  2 -3 -2  0  0  0  2 -2 -2  0 -5 
-K  0  2  0 -1 -2  0  1 -1 -2 -2 -2  5  0 -1  0  0  0  0 -1 -2  0  1  0 -5 
-M  0  0 -1 -3 -4 -1 -2 -1  1  1  3  0  6  0 -3 -1  0  1  0  1 -2 -2  0 -5 
-F -2 -1 -1 -3 -4 -4 -3 -3 -3  1  2 -1  0  8 -4 -1 -1  1  3  1 -2 -3 -1 -5 
-P -2 -2 -2 -1 -4  0  0 -2 -1 -1 -3  0 -3 -4 10 -2  0 -4 -3 -3 -1  0 -1 -5 
-S  1 -1  0 -1 -3  0  0  1 -1 -2 -2  0 -1 -1 -2  4  2 -2 -1 -1  0  0  0 -5 
-T  0 -2  0 -1 -1  0 -1 -2 -2 -1  0  0  0 -1  0  2  5 -2 -2  1 -1 -1  0 -5 
-W -2  0 -2 -3 -5 -1 -1 -1 -4 -1  0  0  1  1 -4 -2 -2 16  3 -2 -3 -1 -1 -5 
-Y -1  0 -2 -2 -5  0 -1 -2  0  0  0 -1  0  3 -3 -1 -2  3  8  0 -2 -1 -1 -5 
-V  0 -1 -2 -2 -2 -3 -2 -3 -4  4  2 -2  1  1 -3 -1  1 -2  0  5 -2 -2  0 -5 
-B -1 -1  4  5 -2  0  0  0  0 -2 -2  0 -2 -2 -1  0 -1 -3 -2 -2  5  0 -1 -5 
-Z -1  0  0  1 -2  4  5 -2 -1 -3 -2  1 -2 -3  0  0 -1 -1 -1 -2  0  4  0 -5 
-X  0 -1  0 -1 -2 -1 -1 -1 -1  0  0  0  0 -1 -1  0  0 -1 -1  0 -1  0 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM40 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM40
deleted file mode 100644
index 1a4baa2..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM40
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum40.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/4 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 40
-#  Entropy =   0.2851, Expected =  -0.2090
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -2 -1 -1 -2  0 -1  1 -2 -1 -2 -1 -1 -3 -2  1  0 -3 -2  0 -1 -1  0 -6 
-R -2  9  0 -1 -3  2 -1 -3  0 -3 -2  3 -1 -2 -3 -1 -2 -2 -1 -2 -1  0 -1 -6 
-N -1  0  8  2 -2  1 -1  0  1 -2 -3  0 -2 -3 -2  1  0 -4 -2 -3  4  0 -1 -6 
-D -1 -1  2  9 -2 -1  2 -2  0 -4 -3  0 -3 -4 -2  0 -1 -5 -3 -3  6  1 -1 -6 
-C -2 -3 -2 -2 16 -4 -2 -3 -4 -4 -2 -3 -3 -2 -5 -1 -1 -6 -4 -2 -2 -3 -2 -6 
-Q  0  2  1 -1 -4  8  2 -2  0 -3 -2  1 -1 -4 -2  1 -1 -1 -1 -3  0  4 -1 -6 
-E -1 -1 -1  2 -2  2  7 -3  0 -4 -2  1 -2 -3  0  0 -1 -2 -2 -3  1  5 -1 -6 
-G  1 -3  0 -2 -3 -2 -3  8 -2 -4 -4 -2 -2 -3 -1  0 -2 -2 -3 -4 -1 -2 -1 -6 
-H -2  0  1  0 -4  0  0 -2 13 -3 -2 -1  1 -2 -2 -1 -2 -5  2 -4  0  0 -1 -6 
-I -1 -3 -2 -4 -4 -3 -4 -4 -3  6  2 -3  1  1 -2 -2 -1 -3  0  4 -3 -4 -1 -6 
-L -2 -2 -3 -3 -2 -2 -2 -4 -2  2  6 -2  3  2 -4 -3 -1 -1  0  2 -3 -2 -1 -6 
-K -1  3  0  0 -3  1  1 -2 -1 -3 -2  6 -1 -3 -1  0  0 -2 -1 -2  0  1 -1 -6 
-M -1 -1 -2 -3 -3 -1 -2 -2  1  1  3 -1  7  0 -2 -2 -1 -2  1  1 -3 -2  0 -6 
-F -3 -2 -3 -4 -2 -4 -3 -3 -2  1  2 -3  0  9 -4 -2 -1  1  4  0 -3 -4 -1 -6 
-P -2 -3 -2 -2 -5 -2  0 -1 -2 -2 -4 -1 -2 -4 11 -1  0 -4 -3 -3 -2 -1 -2 -6 
-S  1 -1  1  0 -1  1  0  0 -1 -2 -3  0 -2 -2 -1  5  2 -5 -2 -1  0  0  0 -6 
-T  0 -2  0 -1 -1 -1 -1 -2 -2 -1 -1  0 -1 -1  0  2  6 -4 -1  1  0 -1  0 -6 
-W -3 -2 -4 -5 -6 -1 -2 -2 -5 -3 -1 -2 -2  1 -4 -5 -4 19  3 -3 -4 -2 -2 -6 
-Y -2 -1 -2 -3 -4 -1 -2 -3  2  0  0 -1  1  4 -3 -2 -1  3  9 -1 -3 -2 -1 -6 
-V  0 -2 -3 -3 -2 -3 -3 -4 -4  4  2 -2  1  0 -3 -1  1 -3 -1  5 -3 -3 -1 -6 
-B -1 -1  4  6 -2  0  1 -1  0 -3 -3  0 -3 -3 -2  0  0 -4 -3 -3  5  2 -1 -6 
-Z -1  0  0  1 -3  4  5 -2  0 -4 -2  1 -2 -4 -1  0 -1 -2 -2 -3  2  5 -1 -6 
-X  0 -1 -1 -1 -2 -1 -1 -1 -1 -1 -1 -1  0 -1 -2  0  0 -2 -1 -1 -1 -1 -1 -6 
-* -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM45 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM45
deleted file mode 100644
index 18c3323..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM45
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum45.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/3 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 45
-#  Entropy =   0.3795, Expected =  -0.2789
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -2 -1 -2 -1 -1 -1  0 -2 -1 -1 -1 -1 -2 -1  1  0 -2 -2  0 -1 -1  0 -5 
-R -2  7  0 -1 -3  1  0 -2  0 -3 -2  3 -1 -2 -2 -1 -1 -2 -1 -2 -1  0 -1 -5 
-N -1  0  6  2 -2  0  0  0  1 -2 -3  0 -2 -2 -2  1  0 -4 -2 -3  4  0 -1 -5 
-D -2 -1  2  7 -3  0  2 -1  0 -4 -3  0 -3 -4 -1  0 -1 -4 -2 -3  5  1 -1 -5 
-C -1 -3 -2 -3 12 -3 -3 -3 -3 -3 -2 -3 -2 -2 -4 -1 -1 -5 -3 -1 -2 -3 -2 -5 
-Q -1  1  0  0 -3  6  2 -2  1 -2 -2  1  0 -4 -1  0 -1 -2 -1 -3  0  4 -1 -5 
-E -1  0  0  2 -3  2  6 -2  0 -3 -2  1 -2 -3  0  0 -1 -3 -2 -3  1  4 -1 -5 
-G  0 -2  0 -1 -3 -2 -2  7 -2 -4 -3 -2 -2 -3 -2  0 -2 -2 -3 -3 -1 -2 -1 -5 
-H -2  0  1  0 -3  1  0 -2 10 -3 -2 -1  0 -2 -2 -1 -2 -3  2 -3  0  0 -1 -5 
-I -1 -3 -2 -4 -3 -2 -3 -4 -3  5  2 -3  2  0 -2 -2 -1 -2  0  3 -3 -3 -1 -5 
-L -1 -2 -3 -3 -2 -2 -2 -3 -2  2  5 -3  2  1 -3 -3 -1 -2  0  1 -3 -2 -1 -5 
-K -1  3  0  0 -3  1  1 -2 -1 -3 -3  5 -1 -3 -1 -1 -1 -2 -1 -2  0  1 -1 -5 
-M -1 -1 -2 -3 -2  0 -2 -2  0  2  2 -1  6  0 -2 -2 -1 -2  0  1 -2 -1 -1 -5 
-F -2 -2 -2 -4 -2 -4 -3 -3 -2  0  1 -3  0  8 -3 -2 -1  1  3  0 -3 -3 -1 -5 
-P -1 -2 -2 -1 -4 -1  0 -2 -2 -2 -3 -1 -2 -3  9 -1 -1 -3 -3 -3 -2 -1 -1 -5 
-S  1 -1  1  0 -1  0  0  0 -1 -2 -3 -1 -2 -2 -1  4  2 -4 -2 -1  0  0  0 -5 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -1 -1 -1 -1 -1  2  5 -3 -1  0  0 -1  0 -5 
-W -2 -2 -4 -4 -5 -2 -3 -2 -3 -2 -2 -2 -2  1 -3 -4 -3 15  3 -3 -4 -2 -2 -5 
-Y -2 -1 -2 -2 -3 -1 -2 -3  2  0  0 -1  0  3 -3 -2 -1  3  8 -1 -2 -2 -1 -5 
-V  0 -2 -3 -3 -1 -3 -3 -3 -3  3  1 -2  1  0 -3 -1  0 -3 -1  5 -3 -3 -1 -5 
-B -1 -1  4  5 -2  0  1 -1  0 -3 -3  0 -2 -3 -2  0  0 -4 -2 -3  4  2 -1 -5 
-Z -1  0  0  1 -3  4  4 -2  0 -3 -2  1 -1 -3 -1  0 -1 -2 -2 -3  2  4 -1 -5 
-X  0 -1 -1 -1 -2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  0  0 -2 -1 -1 -1 -1 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM50 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM50
deleted file mode 100644
index 3f62e3c..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM50
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum50.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/3 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 50
-#  Entropy =   0.4808, Expected =  -0.3573
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -2 -1 -2 -1 -1 -1  0 -2 -1 -2 -1 -1 -3 -1  1  0 -3 -2  0 -2 -1 -1 -5 
-R -2  7 -1 -2 -4  1  0 -3  0 -4 -3  3 -2 -3 -3 -1 -1 -3 -1 -3 -1  0 -1 -5 
-N -1 -1  7  2 -2  0  0  0  1 -3 -4  0 -2 -4 -2  1  0 -4 -2 -3  4  0 -1 -5 
-D -2 -2  2  8 -4  0  2 -1 -1 -4 -4 -1 -4 -5 -1  0 -1 -5 -3 -4  5  1 -1 -5 
-C -1 -4 -2 -4 13 -3 -3 -3 -3 -2 -2 -3 -2 -2 -4 -1 -1 -5 -3 -1 -3 -3 -2 -5 
-Q -1  1  0  0 -3  7  2 -2  1 -3 -2  2  0 -4 -1  0 -1 -1 -1 -3  0  4 -1 -5 
-E -1  0  0  2 -3  2  6 -3  0 -4 -3  1 -2 -3 -1 -1 -1 -3 -2 -3  1  5 -1 -5 
-G  0 -3  0 -1 -3 -2 -3  8 -2 -4 -4 -2 -3 -4 -2  0 -2 -3 -3 -4 -1 -2 -2 -5 
-H -2  0  1 -1 -3  1  0 -2 10 -4 -3  0 -1 -1 -2 -1 -2 -3  2 -4  0  0 -1 -5 
-I -1 -4 -3 -4 -2 -3 -4 -4 -4  5  2 -3  2  0 -3 -3 -1 -3 -1  4 -4 -3 -1 -5 
-L -2 -3 -4 -4 -2 -2 -3 -4 -3  2  5 -3  3  1 -4 -3 -1 -2 -1  1 -4 -3 -1 -5 
-K -1  3  0 -1 -3  2  1 -2  0 -3 -3  6 -2 -4 -1  0 -1 -3 -2 -3  0  1 -1 -5 
-M -1 -2 -2 -4 -2  0 -2 -3 -1  2  3 -2  7  0 -3 -2 -1 -1  0  1 -3 -1 -1 -5 
-F -3 -3 -4 -5 -2 -4 -3 -4 -1  0  1 -4  0  8 -4 -3 -2  1  4 -1 -4 -4 -2 -5 
-P -1 -3 -2 -1 -4 -1 -1 -2 -2 -3 -4 -1 -3 -4 10 -1 -1 -4 -3 -3 -2 -1 -2 -5 
-S  1 -1  1  0 -1  0 -1  0 -1 -3 -3  0 -2 -3 -1  5  2 -4 -2 -2  0  0 -1 -5 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -1 -1 -1 -2 -1  2  5 -3 -2  0  0 -1  0 -5 
-W -3 -3 -4 -5 -5 -1 -3 -3 -3 -3 -2 -3 -1  1 -4 -4 -3 15  2 -3 -5 -2 -3 -5 
-Y -2 -1 -2 -3 -3 -1 -2 -3  2 -1 -1 -2  0  4 -3 -2 -2  2  8 -1 -3 -2 -1 -5 
-V  0 -3 -3 -4 -1 -3 -3 -4 -4  4  1 -3  1 -1 -3 -2  0 -3 -1  5 -4 -3 -1 -5 
-B -2 -1  4  5 -3  0  1 -1  0 -4 -4  0 -3 -4 -2  0  0 -5 -3 -4  5  2 -1 -5 
-Z -1  0  0  1 -3  4  5 -2  0 -3 -3  1 -1 -4 -1  0 -1 -2 -2 -3  2  5 -1 -5 
-X -1 -1 -1 -1 -2 -1 -1 -2 -1 -1 -1 -1 -1 -2 -2 -1  0 -3 -1 -1 -1 -1 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM55 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM55
deleted file mode 100644
index c0cf3ff..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM55
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum55.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/3 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 55
-#  Entropy =   0.5637, Expected =  -0.4179
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -2 -2 -2  0 -1 -1  0 -2 -2 -2 -1 -1 -3 -1  2  0 -4 -2  0 -2 -1 -1 -5 
-R -2  8 -1 -2 -4  1  0 -3  0 -4 -3  3 -2 -3 -3 -1 -1 -3 -2 -3 -1  0 -1 -5 
-N -2 -1  8  2 -3  0  0  0  1 -4 -4  0 -3 -4 -2  1  0 -5 -2 -4  4  0 -1 -5 
-D -2 -2  2  8 -4  0  2 -2 -1 -4 -5 -1 -4 -5 -2  0 -1 -5 -3 -4  5  1 -2 -5 
-C  0 -4 -3 -4 13 -4 -4 -3 -4 -2 -2 -4 -2 -3 -3 -1 -1 -4 -3 -1 -4 -4 -2 -5 
-Q -1  1  0  0 -4  7  2 -2  1 -4 -3  2  0 -4 -1  0 -1 -2 -1 -3  0  4 -1 -5 
-E -1  0  0  2 -4  2  7 -3 -1 -4 -4  1 -3 -4 -1  0 -1 -3 -2 -3  1  5 -1 -5 
-G  0 -3  0 -2 -3 -2 -3  8 -2 -5 -5 -2 -3 -4 -3  0 -2 -3 -4 -4 -1 -3 -2 -5 
-H -2  0  1 -1 -4  1 -1 -2 11 -4 -3  0 -2 -1 -3 -1 -2 -3  2 -4  0  0 -1 -5 
-I -2 -4 -4 -4 -2 -4 -4 -5 -4  6  2 -4  2  0 -3 -3 -1 -3 -1  4 -4 -4 -1 -5 
-L -2 -3 -4 -5 -2 -3 -4 -5 -3  2  6 -3  3  1 -4 -3 -2 -3 -1  1 -4 -3 -1 -5 
-K -1  3  0 -1 -4  2  1 -2  0 -4 -3  6 -2 -4 -1  0 -1 -4 -2 -3  0  1 -1 -5 
-M -1 -2 -3 -4 -2  0 -3 -3 -2  2  3 -2  8  0 -3 -2 -1 -2 -1  1 -3 -2 -1 -5 
-F -3 -3 -4 -5 -3 -4 -4 -4 -1  0  1 -4  0  9 -5 -3 -3  2  4 -1 -5 -4 -2 -5 
-P -1 -3 -2 -2 -3 -1 -1 -3 -3 -3 -4 -1 -3 -5 10 -1 -1 -5 -4 -3 -2 -1 -2 -5 
-S  2 -1  1  0 -1  0  0  0 -1 -3 -3  0 -2 -3 -1  5  2 -4 -2 -2  0  0 -1 -5 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -2 -1 -1 -3 -1  2  6 -3 -2  0 -1 -1 -1 -5 
-W -4 -3 -5 -5 -4 -2 -3 -3 -3 -3 -3 -4 -2  2 -5 -4 -3 15  3 -4 -5 -3 -3 -5 
-Y -2 -2 -2 -3 -3 -1 -2 -4  2 -1 -1 -2 -1  4 -4 -2 -2  3  9 -2 -3 -2 -1 -5 
-V  0 -3 -4 -4 -1 -3 -3 -4 -4  4  1 -3  1 -1 -3 -2  0 -4 -2  5 -4 -3 -1 -5 
-B -2 -1  4  5 -4  0  1 -1  0 -4 -4  0 -3 -5 -2  0 -1 -5 -3 -4  5  2 -1 -5 
-Z -1  0  0  1 -4  4  5 -3  0 -4 -3  1 -2 -4 -1  0 -1 -3 -2 -3  2  5 -1 -5 
-X -1 -1 -1 -2 -2 -1 -1 -2 -1 -1 -1 -1 -1 -2 -2 -1 -1 -3 -1 -1 -1 -1 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM60 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM60
deleted file mode 100644
index 4fd1943..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM60
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum60.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 60
-#  Entropy =   0.6603, Expected =  -0.4917
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -1 -1 -2  0 -1 -1  0 -2 -1 -1 -1 -1 -2 -1  1  0 -3 -2  0 -2 -1  0 -4 
-R -1  5  0 -1 -3  1  0 -2  0 -3 -2  2 -1 -3 -2 -1 -1 -3 -2 -2 -1  0 -1 -4 
-N -1  0  6  1 -2  0  0  0  1 -3 -3  0 -2 -3 -2  1  0 -4 -2 -3  3  0 -1 -4 
-D -2 -1  1  6 -3  0  2 -1 -1 -3 -3 -1 -3 -3 -1  0 -1 -4 -3 -3  4  1 -1 -4 
-C  0 -3 -2 -3  9 -3 -3 -2 -3 -1 -1 -3 -1 -2 -3 -1 -1 -2 -2 -1 -3 -3 -2 -4 
-Q -1  1  0  0 -3  5  2 -2  1 -3 -2  1  0 -3 -1  0 -1 -2 -1 -2  0  3 -1 -4 
-E -1  0  0  2 -3  2  5 -2  0 -3 -3  1 -2 -3 -1  0 -1 -3 -2 -2  1  4 -1 -4 
-G  0 -2  0 -1 -2 -2 -2  6 -2 -3 -4 -1 -2 -3 -2  0 -2 -2 -3 -3 -1 -2 -1 -4 
-H -2  0  1 -1 -3  1  0 -2  7 -3 -3 -1 -1 -1 -2 -1 -2 -2  2 -3  0  0 -1 -4 
-I -1 -3 -3 -3 -1 -3 -3 -3 -3  4  2 -3  1  0 -3 -2 -1 -2 -1  3 -3 -3 -1 -4 
-L -1 -2 -3 -3 -1 -2 -3 -4 -3  2  4 -2  2  0 -3 -2 -1 -2 -1  1 -3 -2 -1 -4 
-K -1  2  0 -1 -3  1  1 -1 -1 -3 -2  4 -1 -3 -1  0 -1 -3 -2 -2  0  1 -1 -4 
-M -1 -1 -2 -3 -1  0 -2 -2 -1  1  2 -1  5  0 -2 -1 -1 -1 -1  1 -3 -1 -1 -4 
-F -2 -3 -3 -3 -2 -3 -3 -3 -1  0  0 -3  0  6 -4 -2 -2  1  3 -1 -3 -3 -1 -4 
-P -1 -2 -2 -1 -3 -1 -1 -2 -2 -3 -3 -1 -2 -4  7 -1 -1 -4 -3 -2 -2 -1 -2 -4 
-S  1 -1  1  0 -1  0  0  0 -1 -2 -2  0 -1 -2 -1  4  1 -3 -2 -2  0  0  0 -4 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -1 -1 -1 -2 -1  1  4 -2 -2  0  0 -1  0 -4 
-W -3 -3 -4 -4 -2 -2 -3 -2 -2 -2 -2 -3 -1  1 -4 -3 -2 10  2 -3 -4 -2 -2 -4 
-Y -2 -2 -2 -3 -2 -1 -2 -3  2 -1 -1 -2 -1  3 -3 -2 -2  2  6 -1 -2 -2 -1 -4 
-V  0 -2 -3 -3 -1 -2 -2 -3 -3  3  1 -2  1 -1 -2 -2  0 -3 -1  4 -3 -2 -1 -4 
-B -2 -1  3  4 -3  0  1 -1  0 -3 -3  0 -3 -3 -2  0  0 -4 -2 -3  4  1 -1 -4 
-Z -1  0  0  1 -3  3  4 -2  0 -3 -2  1 -1 -3 -1  0 -1 -2 -2 -2  1  3 -1 -4 
-X  0 -1 -1 -1 -2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -2  0  0 -2 -1 -1 -1 -1 -1 -4 
-* -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM62 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM62
deleted file mode 100644
index 205f139..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM62
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum62.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 62
-#  Entropy =   0.6979, Expected =  -0.5209
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -1 -2 -2  0 -1 -1  0 -2 -1 -1 -1 -1 -2 -1  1  0 -3 -2  0 -2 -1  0 -4 
-R -1  5  0 -2 -3  1  0 -2  0 -3 -2  2 -1 -3 -2 -1 -1 -3 -2 -3 -1  0 -1 -4 
-N -2  0  6  1 -3  0  0  0  1 -3 -3  0 -2 -3 -2  1  0 -4 -2 -3  3  0 -1 -4 
-D -2 -2  1  6 -3  0  2 -1 -1 -3 -4 -1 -3 -3 -1  0 -1 -4 -3 -3  4  1 -1 -4 
-C  0 -3 -3 -3  9 -3 -4 -3 -3 -1 -1 -3 -1 -2 -3 -1 -1 -2 -2 -1 -3 -3 -2 -4 
-Q -1  1  0  0 -3  5  2 -2  0 -3 -2  1  0 -3 -1  0 -1 -2 -1 -2  0  3 -1 -4 
-E -1  0  0  2 -4  2  5 -2  0 -3 -3  1 -2 -3 -1  0 -1 -3 -2 -2  1  4 -1 -4 
-G  0 -2  0 -1 -3 -2 -2  6 -2 -4 -4 -2 -3 -3 -2  0 -2 -2 -3 -3 -1 -2 -1 -4 
-H -2  0  1 -1 -3  0  0 -2  8 -3 -3 -1 -2 -1 -2 -1 -2 -2  2 -3  0  0 -1 -4 
-I -1 -3 -3 -3 -1 -3 -3 -4 -3  4  2 -3  1  0 -3 -2 -1 -3 -1  3 -3 -3 -1 -4 
-L -1 -2 -3 -4 -1 -2 -3 -4 -3  2  4 -2  2  0 -3 -2 -1 -2 -1  1 -4 -3 -1 -4 
-K -1  2  0 -1 -3  1  1 -2 -1 -3 -2  5 -1 -3 -1  0 -1 -3 -2 -2  0  1 -1 -4 
-M -1 -1 -2 -3 -1  0 -2 -3 -2  1  2 -1  5  0 -2 -1 -1 -1 -1  1 -3 -1 -1 -4 
-F -2 -3 -3 -3 -2 -3 -3 -3 -1  0  0 -3  0  6 -4 -2 -2  1  3 -1 -3 -3 -1 -4 
-P -1 -2 -2 -1 -3 -1 -1 -2 -2 -3 -3 -1 -2 -4  7 -1 -1 -4 -3 -2 -2 -1 -2 -4 
-S  1 -1  1  0 -1  0  0  0 -1 -2 -2  0 -1 -2 -1  4  1 -3 -2 -2  0  0  0 -4 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -1 -1 -1 -2 -1  1  5 -2 -2  0 -1 -1  0 -4 
-W -3 -3 -4 -4 -2 -2 -3 -2 -2 -3 -2 -3 -1  1 -4 -3 -2 11  2 -3 -4 -3 -2 -4 
-Y -2 -2 -2 -3 -2 -1 -2 -3  2 -1 -1 -2 -1  3 -3 -2 -2  2  7 -1 -3 -2 -1 -4 
-V  0 -3 -3 -3 -1 -2 -2 -3 -3  3  1 -2  1 -1 -2 -2  0 -3 -1  4 -3 -2 -1 -4 
-B -2 -1  3  4 -3  0  1 -1  0 -3 -4  0 -3 -3 -2  0 -1 -4 -3 -3  4  1 -1 -4 
-Z -1  0  0  1 -3  3  4 -2  0 -3 -3  1 -1 -3 -1  0 -1 -3 -2 -2  1  4 -1 -4 
-X  0 -1 -1 -1 -2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -2  0  0 -2 -1 -1 -1 -1 -1 -4 
-* -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM65 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM65
deleted file mode 100644
index 1eacd14..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM65
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum65.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 65
-#  Entropy =   0.7576, Expected =  -0.5675
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -1 -2 -2  0 -1 -1  0 -2 -1 -2 -1 -1 -2 -1  1  0 -3 -2  0 -2 -1 -1 -5 
-R -1  6  0 -2 -4  1  0 -2  0 -3 -2  2 -2 -3 -2 -1 -1 -3 -2 -3 -1  0 -1 -5 
-N -2  0  6  1 -3  0  0 -1  1 -3 -4  0 -2 -3 -2  1  0 -4 -2 -3  3  0 -1 -5 
-D -2 -2  1  6 -4  0  2 -1 -1 -3 -4 -1 -3 -4 -2  0 -1 -5 -3 -3  4  1 -1 -5 
-C  0 -4 -3 -4  9 -3 -4 -3 -3 -1 -1 -3 -2 -2 -3 -1 -1 -2 -2 -1 -3 -4 -2 -5 
-Q -1  1  0  0 -3  6  2 -2  1 -3 -2  1  0 -3 -1  0 -1 -2 -2 -2  0  3 -1 -5 
-E -1  0  0  2 -4  2  5 -2  0 -3 -3  1 -2 -3 -1  0 -1 -3 -2 -3  1  4 -1 -5 
-G  0 -2 -1 -1 -3 -2 -2  6 -2 -4 -4 -2 -3 -3 -2  0 -2 -3 -3 -3 -1 -2 -2 -5 
-H -2  0  1 -1 -3  1  0 -2  8 -3 -3 -1 -2 -1 -2 -1 -2 -2  2 -3  0  0 -1 -5 
-I -1 -3 -3 -3 -1 -3 -3 -4 -3  4  2 -3  1  0 -3 -2 -1 -2 -1  3 -3 -3 -1 -5 
-L -2 -2 -4 -4 -1 -2 -3 -4 -3  2  4 -3  2  0 -3 -3 -1 -2 -1  1 -4 -3 -1 -5 
-K -1  2  0 -1 -3  1  1 -2 -1 -3 -3  5 -2 -3 -1  0 -1 -3 -2 -2  0  1 -1 -5 
-M -1 -2 -2 -3 -2  0 -2 -3 -2  1  2 -2  6  0 -3 -2 -1 -2 -1  1 -3 -2 -1 -5 
-F -2 -3 -3 -4 -2 -3 -3 -3 -1  0  0 -3  0  6 -4 -2 -2  1  3 -1 -3 -3 -2 -5 
-P -1 -2 -2 -2 -3 -1 -1 -2 -2 -3 -3 -1 -3 -4  8 -1 -1 -4 -3 -2 -2 -1 -2 -5 
-S  1 -1  1  0 -1  0  0  0 -1 -2 -3  0 -2 -2 -1  4  1 -3 -2 -2  0  0 -1 -5 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -1 -1 -1 -2 -1  1  5 -3 -2  0 -1 -1 -1 -5 
-W -3 -3 -4 -5 -2 -2 -3 -3 -2 -2 -2 -3 -2  1 -4 -3 -3 10  2 -3 -4 -3 -2 -5 
-Y -2 -2 -2 -3 -2 -2 -2 -3  2 -1 -1 -2 -1  3 -3 -2 -2  2  7 -1 -3 -2 -1 -5 
-V  0 -3 -3 -3 -1 -2 -3 -3 -3  3  1 -2  1 -1 -2 -2  0 -3 -1  4 -3 -2 -1 -5 
-B -2 -1  3  4 -3  0  1 -1  0 -3 -4  0 -3 -3 -2  0 -1 -4 -3 -3  4  1 -1 -5 
-Z -1  0  0  1 -4  3  4 -2  0 -3 -3  1 -2 -3 -1  0 -1 -3 -2 -2  1  4 -1 -5 
-X -1 -1 -1 -1 -2 -1 -1 -2 -1 -1 -1 -1 -1 -2 -2 -1 -1 -2 -1 -1 -1 -1 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM70 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM70
deleted file mode 100644
index 3e4093f..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM70
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum70.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 70
-#  Entropy =   0.8391, Expected =  -0.6313
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -2 -2 -2 -1 -1 -1  0 -2 -2 -2 -1 -1 -2 -1  1  0 -3 -2  0 -2 -1 -1 -5 
-R -2  6 -1 -2 -4  1  0 -3  0 -3 -3  2 -2 -3 -2 -1 -1 -3 -2 -3 -1  0 -1 -5 
-N -2 -1  6  1 -3  0  0 -1  0 -4 -4  0 -2 -3 -2  0  0 -4 -2 -3  3  0 -1 -5 
-D -2 -2  1  6 -4 -1  1 -2 -1 -4 -4 -1 -3 -4 -2  0 -1 -5 -4 -4  4  1 -2 -5 
-C -1 -4 -3 -4  9 -3 -4 -3 -4 -1 -2 -4 -2 -2 -3 -1 -1 -3 -3 -1 -4 -4 -2 -5 
-Q -1  1  0 -1 -3  6  2 -2  1 -3 -2  1  0 -3 -2  0 -1 -2 -2 -2  0  3 -1 -5 
-E -1  0  0  1 -4  2  5 -2  0 -4 -3  1 -2 -4 -1  0 -1 -4 -3 -3  1  4 -1 -5 
-G  0 -3 -1 -2 -3 -2 -2  6 -2 -4 -4 -2 -3 -4 -3 -1 -2 -3 -4 -4 -1 -2 -2 -5 
-H -2  0  0 -1 -4  1  0 -2  8 -4 -3 -1 -2 -1 -2 -1 -2 -2  2 -3 -1  0 -1 -5 
-I -2 -3 -4 -4 -1 -3 -4 -4 -4  4  2 -3  1  0 -3 -3 -1 -3 -1  3 -4 -3 -1 -5 
-L -2 -3 -4 -4 -2 -2 -3 -4 -3  2  4 -3  2  0 -3 -3 -2 -2 -1  1 -4 -3 -1 -5 
-K -1  2  0 -1 -4  1  1 -2 -1 -3 -3  5 -2 -3 -1  0 -1 -3 -2 -3 -1  1 -1 -5 
-M -1 -2 -2 -3 -2  0 -2 -3 -2  1  2 -2  6  0 -3 -2 -1 -2 -1  1 -3 -2 -1 -5 
-F -2 -3 -3 -4 -2 -3 -4 -4 -1  0  0 -3  0  6 -4 -3 -2  1  3 -1 -4 -4 -2 -5 
-P -1 -2 -2 -2 -3 -2 -1 -3 -2 -3 -3 -1 -3 -4  8 -1 -1 -4 -3 -3 -2 -1 -2 -5 
-S  1 -1  0  0 -1  0  0 -1 -1 -3 -3  0 -2 -3 -1  4  1 -3 -2 -2  0  0 -1 -5 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -2 -1 -1 -2 -1  1  5 -3 -2  0 -1 -1 -1 -5 
-W -3 -3 -4 -5 -3 -2 -4 -3 -2 -3 -2 -3 -2  1 -4 -3 -3 11  2 -3 -4 -3 -3 -5 
-Y -2 -2 -2 -4 -3 -2 -3 -4  2 -1 -1 -2 -1  3 -3 -2 -2  2  7 -2 -3 -2 -2 -5 
-V  0 -3 -3 -4 -1 -2 -3 -4 -3  3  1 -3  1 -1 -3 -2  0 -3 -2  4 -3 -3 -1 -5 
-B -2 -1  3  4 -4  0  1 -1 -1 -4 -4 -1 -3 -4 -2  0 -1 -4 -3 -3  4  0 -1 -5 
-Z -1  0  0  1 -4  3  4 -2  0 -3 -3  1 -2 -4 -1  0 -1 -3 -2 -3  0  4 -1 -5 
-X -1 -1 -1 -2 -2 -1 -1 -2 -1 -1 -1 -1 -1 -2 -2 -1 -1 -3 -2 -1 -1 -1 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM75 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM75
deleted file mode 100644
index 98964be..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM75
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum75.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 75
-#  Entropy =   0.9077, Expected =  -0.6845
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -2 -2 -2 -1 -1 -1  0 -2 -2 -2 -1 -1 -3 -1  1  0 -3 -2  0 -2 -1 -1 -5 
-R -2  6 -1 -2 -4  1  0 -3  0 -3 -3  2 -2 -3 -2 -1 -1 -3 -2 -3 -1  0 -1 -5 
-N -2 -1  6  1 -3  0 -1 -1  0 -4 -4  0 -3 -4 -3  0  0 -4 -3 -3  3  0 -1 -5 
-D -2 -2  1  6 -4 -1  1 -2 -1 -4 -4 -1 -4 -4 -2 -1 -1 -5 -4 -4  4  1 -2 -5 
-C -1 -4 -3 -4  9 -3 -5 -3 -4 -1 -2 -4 -2 -2 -4 -1 -1 -3 -3 -1 -4 -4 -2 -5 
-Q -1  1  0 -1 -3  6  2 -2  1 -3 -3  1  0 -4 -2  0 -1 -2 -2 -2  0  3 -1 -5 
-E -1  0 -1  1 -5  2  5 -3  0 -4 -4  1 -2 -4 -1  0 -1 -4 -3 -3  1  4 -1 -5 
-G  0 -3 -1 -2 -3 -2 -3  6 -2 -5 -4 -2 -3 -4 -3 -1 -2 -3 -4 -4 -1 -2 -2 -5 
-H -2  0  0 -1 -4  1  0 -2  8 -4 -3 -1 -2 -2 -2 -1 -2 -2  2 -4 -1  0 -1 -5 
-I -2 -3 -4 -4 -1 -3 -4 -5 -4  4  1 -3  1  0 -3 -3 -1 -3 -2  3 -4 -4 -2 -5 
-L -2 -3 -4 -4 -2 -3 -4 -4 -3  1  4 -3  2  0 -3 -3 -2 -2 -1  1 -4 -3 -1 -5 
-K -1  2  0 -1 -4  1  1 -2 -1 -3 -3  5 -2 -4 -1  0 -1 -4 -2 -3 -1  1 -1 -5 
-M -1 -2 -3 -4 -2  0 -2 -3 -2  1  2 -2  6  0 -3 -2 -1 -2 -2  1 -3 -2 -1 -5 
-F -3 -3 -4 -4 -2 -4 -4 -4 -2  0  0 -4  0  6 -4 -3 -2  1  3 -1 -4 -4 -2 -5 
-P -1 -2 -3 -2 -4 -2 -1 -3 -2 -3 -3 -1 -3 -4  8 -1 -1 -5 -4 -3 -2 -2 -2 -5 
-S  1 -1  0 -1 -1  0  0 -1 -1 -3 -3  0 -2 -3 -1  5  1 -3 -2 -2  0  0 -1 -5 
-T  0 -1  0 -1 -1 -1 -1 -2 -2 -1 -2 -1 -1 -2 -1  1  5 -3 -2  0 -1 -1 -1 -5 
-W -3 -3 -4 -5 -3 -2 -4 -3 -2 -3 -2 -4 -2  1 -5 -3 -3 11  2 -3 -5 -3 -3 -5 
-Y -2 -2 -3 -4 -3 -2 -3 -4  2 -2 -1 -2 -2  3 -4 -2 -2  2  7 -2 -3 -3 -2 -5 
-V  0 -3 -3 -4 -1 -2 -3 -4 -4  3  1 -3  1 -1 -3 -2  0 -3 -2  4 -4 -3 -1 -5 
-B -2 -1  3  4 -4  0  1 -1 -1 -4 -4 -1 -3 -4 -2  0 -1 -5 -3 -4  4  0 -2 -5 
-Z -1  0  0  1 -4  3  4 -2  0 -4 -3  1 -2 -4 -2  0 -1 -3 -3 -3  0  4 -1 -5 
-X -1 -1 -1 -2 -2 -1 -1 -2 -1 -2 -1 -1 -1 -2 -2 -1 -1 -3 -2 -1 -2 -1 -1 -5 
-* -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM80 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM80
deleted file mode 100644
index 78172a3..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM80
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum80_3.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/3 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 80
-#  Entropy =   0.9868, Expected =  -0.7442
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  7 -3 -3 -3 -1 -2 -2  0 -3 -3 -3 -1 -2 -4 -1  2  0 -5 -4 -1 -3 -2 -1 -8 
-R -3  9 -1 -3 -6  1 -1 -4  0 -5 -4  3 -3 -5 -3 -2 -2 -5 -4 -4 -2  0 -2 -8 
-N -3 -1  9  2 -5  0 -1 -1  1 -6 -6  0 -4 -6 -4  1  0 -7 -4 -5  5 -1 -2 -8 
-D -3 -3  2 10 -7 -1  2 -3 -2 -7 -7 -2 -6 -6 -3 -1 -2 -8 -6 -6  6  1 -3 -8 
-C -1 -6 -5 -7 13 -5 -7 -6 -7 -2 -3 -6 -3 -4 -6 -2 -2 -5 -5 -2 -6 -7 -4 -8 
-Q -2  1  0 -1 -5  9  3 -4  1 -5 -4  2 -1 -5 -3 -1 -1 -4 -3 -4 -1  5 -2 -8 
-E -2 -1 -1  2 -7  3  8 -4  0 -6 -6  1 -4 -6 -2 -1 -2 -6 -5 -4  1  6 -2 -8 
-G  0 -4 -1 -3 -6 -4 -4  9 -4 -7 -7 -3 -5 -6 -5 -1 -3 -6 -6 -6 -2 -4 -3 -8 
-H -3  0  1 -2 -7  1  0 -4 12 -6 -5 -1 -4 -2 -4 -2 -3 -4  3 -5 -1  0 -2 -8 
-I -3 -5 -6 -7 -2 -5 -6 -7 -6  7  2 -5  2 -1 -5 -4 -2 -5 -3  4 -6 -6 -2 -8 
-L -3 -4 -6 -7 -3 -4 -6 -7 -5  2  6 -4  3  0 -5 -4 -3 -4 -2  1 -7 -5 -2 -8 
-K -1  3  0 -2 -6  2  1 -3 -1 -5 -4  8 -3 -5 -2 -1 -1 -6 -4 -4 -1  1 -2 -8 
-M -2 -3 -4 -6 -3 -1 -4 -5 -4  2  3 -3  9  0 -4 -3 -1 -3 -3  1 -5 -3 -2 -8 
-F -4 -5 -6 -6 -4 -5 -6 -6 -2 -1  0 -5  0 10 -6 -4 -4  0  4 -2 -6 -6 -3 -8 
-P -1 -3 -4 -3 -6 -3 -2 -5 -4 -5 -5 -2 -4 -6 12 -2 -3 -7 -6 -4 -4 -2 -3 -8 
-S  2 -2  1 -1 -2 -1 -1 -1 -2 -4 -4 -1 -3 -4 -2  7  2 -6 -3 -3  0 -1 -1 -8 
-T  0 -2  0 -2 -2 -1 -2 -3 -3 -2 -3 -1 -1 -4 -3  2  8 -5 -3  0 -1 -2 -1 -8 
-W -5 -5 -7 -8 -5 -4 -6 -6 -4 -5 -4 -6 -3  0 -7 -6 -5 16  3 -5 -8 -5 -5 -8 
-Y -4 -4 -4 -6 -5 -3 -5 -6  3 -3 -2 -4 -3  4 -6 -3 -3  3 11 -3 -5 -4 -3 -8 
-V -1 -4 -5 -6 -2 -4 -4 -6 -5  4  1 -4  1 -2 -4 -3  0 -5 -3  7 -6 -4 -2 -8 
-B -3 -2  5  6 -6 -1  1 -2 -1 -6 -7 -1 -5 -6 -4  0 -1 -8 -5 -6  6  0 -3 -8 
-Z -2  0 -1  1 -7  5  6 -4  0 -6 -5  1 -3 -6 -2 -1 -2 -5 -4 -4  0  6 -1 -8 
-X -1 -2 -2 -3 -4 -2 -2 -3 -2 -2 -2 -2 -2 -3 -3 -1 -1 -5 -3 -2 -3 -1 -2 -8 
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM85 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM85
deleted file mode 100644
index cb47fd2..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM85
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum85.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 85
-#  Entropy =   1.0805, Expected =  -0.8153
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -2 -2 -2 -1 -1 -1  0 -2 -2 -2 -1 -2 -3 -1  1  0 -3 -3 -1 -2 -1 -1 -6 
-R -2  6 -1 -2 -4  1 -1 -3  0 -4 -3  2 -2 -4 -2 -1 -2 -4 -3 -3 -2  0 -2 -6 
-N -2 -1  7  1 -4  0 -1 -1  0 -4 -4  0 -3 -4 -3  0  0 -5 -3 -4  4 -1 -2 -6 
-D -2 -2  1  7 -5 -1  1 -2 -2 -5 -5 -1 -4 -4 -2 -1 -2 -6 -4 -4  4  1 -2 -6 
-C -1 -4 -4 -5  9 -4 -5 -4 -5 -2 -2 -4 -2 -3 -4 -2 -2 -4 -3 -1 -4 -5 -3 -6 
-Q -1  1  0 -1 -4  6  2 -3  1 -4 -3  1  0 -4 -2 -1 -1 -3 -2 -3 -1  4 -1 -6 
-E -1 -1 -1  1 -5  2  6 -3 -1 -4 -4  0 -3 -4 -2 -1 -1 -4 -4 -3  0  4 -1 -6 
-G  0 -3 -1 -2 -4 -3 -3  6 -3 -5 -5 -2 -4 -4 -3 -1 -2 -4 -5 -4 -1 -3 -2 -6 
-H -2  0  0 -2 -5  1 -1 -3  8 -4 -3 -1 -3 -2 -3 -1 -2 -3  2 -4 -1  0 -2 -6 
-I -2 -4 -4 -5 -2 -4 -4 -5 -4  5  1 -3  1 -1 -4 -3 -1 -3 -2  3 -5 -4 -2 -6 
-L -2 -3 -4 -5 -2 -3 -4 -5 -3  1  4 -3  2  0 -4 -3 -2 -3 -2  0 -5 -4 -2 -6 
-K -1  2  0 -1 -4  1  0 -2 -1 -3 -3  6 -2 -4 -2 -1 -1 -5 -3 -3 -1  1 -1 -6 
-M -2 -2 -3 -4 -2  0 -3 -4 -3  1  2 -2  7 -1 -3 -2 -1 -2 -2  0 -4 -2 -1 -6 
-F -3 -4 -4 -4 -3 -4 -4 -4 -2 -1  0 -4 -1  7 -4 -3 -3  0  3 -1 -4 -4 -2 -6 
-P -1 -2 -3 -2 -4 -2 -2 -3 -3 -4 -4 -2 -3 -4  8 -1 -2 -5 -4 -3 -3 -2 -2 -6 
-S  1 -1  0 -1 -2 -1 -1 -1 -1 -3 -3 -1 -2 -3 -1  5  1 -4 -2 -2  0 -1 -1 -6 
-T  0 -2  0 -2 -2 -1 -1 -2 -2 -1 -2 -1 -1 -3 -2  1  5 -4 -2  0 -1 -1 -1 -6 
-W -3 -4 -5 -6 -4 -3 -4 -4 -3 -3 -3 -5 -2  0 -5 -4 -4 11  2 -3 -5 -4 -3 -6 
-Y -3 -3 -3 -4 -3 -2 -4 -5  2 -2 -2 -3 -2  3 -4 -2 -2  2  7 -2 -4 -3 -2 -6 
-V -1 -3 -4 -4 -1 -3 -3 -4 -4  3  0 -3  0 -1 -3 -2  0 -3 -2  5 -4 -3 -1 -6 
-B -2 -2  4  4 -4 -1  0 -1 -1 -5 -5 -1 -4 -4 -3  0 -1 -5 -4 -4  4  0 -2 -6 
-Z -1  0 -1  1 -5  4  4 -3  0 -4 -4  1 -2 -4 -2 -1 -1 -4 -3 -3  0  4 -1 -6 
-X -1 -2 -2 -2 -3 -1 -1 -2 -2 -2 -2 -1 -1 -2 -2 -1 -1 -3 -2 -1 -2 -1 -2 -6 
-* -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM90 b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM90
deleted file mode 100644
index 71441b5..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUM90
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosum90.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= 90
-#  Entropy =   1.1806, Expected =  -0.8887
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  5 -2 -2 -3 -1 -1 -1  0 -2 -2 -2 -1 -2 -3 -1  1  0 -4 -3 -1 -2 -1 -1 -6 
-R -2  6 -1 -3 -5  1 -1 -3  0 -4 -3  2 -2 -4 -3 -1 -2 -4 -3 -3 -2  0 -2 -6 
-N -2 -1  7  1 -4  0 -1 -1  0 -4 -4  0 -3 -4 -3  0  0 -5 -3 -4  4 -1 -2 -6 
-D -3 -3  1  7 -5 -1  1 -2 -2 -5 -5 -1 -4 -5 -3 -1 -2 -6 -4 -5  4  0 -2 -6 
-C -1 -5 -4 -5  9 -4 -6 -4 -5 -2 -2 -4 -2 -3 -4 -2 -2 -4 -4 -2 -4 -5 -3 -6 
-Q -1  1  0 -1 -4  7  2 -3  1 -4 -3  1  0 -4 -2 -1 -1 -3 -3 -3 -1  4 -1 -6 
-E -1 -1 -1  1 -6  2  6 -3 -1 -4 -4  0 -3 -5 -2 -1 -1 -5 -4 -3  0  4 -2 -6 
-G  0 -3 -1 -2 -4 -3 -3  6 -3 -5 -5 -2 -4 -5 -3 -1 -3 -4 -5 -5 -2 -3 -2 -6 
-H -2  0  0 -2 -5  1 -1 -3  8 -4 -4 -1 -3 -2 -3 -2 -2 -3  1 -4 -1  0 -2 -6 
-I -2 -4 -4 -5 -2 -4 -4 -5 -4  5  1 -4  1 -1 -4 -3 -1 -4 -2  3 -5 -4 -2 -6 
-L -2 -3 -4 -5 -2 -3 -4 -5 -4  1  5 -3  2  0 -4 -3 -2 -3 -2  0 -5 -4 -2 -6 
-K -1  2  0 -1 -4  1  0 -2 -1 -4 -3  6 -2 -4 -2 -1 -1 -5 -3 -3 -1  1 -1 -6 
-M -2 -2 -3 -4 -2  0 -3 -4 -3  1  2 -2  7 -1 -3 -2 -1 -2 -2  0 -4 -2 -1 -6 
-F -3 -4 -4 -5 -3 -4 -5 -5 -2 -1  0 -4 -1  7 -4 -3 -3  0  3 -2 -4 -4 -2 -6 
-P -1 -3 -3 -3 -4 -2 -2 -3 -3 -4 -4 -2 -3 -4  8 -2 -2 -5 -4 -3 -3 -2 -2 -6 
-S  1 -1  0 -1 -2 -1 -1 -1 -2 -3 -3 -1 -2 -3 -2  5  1 -4 -3 -2  0 -1 -1 -6 
-T  0 -2  0 -2 -2 -1 -1 -3 -2 -1 -2 -1 -1 -3 -2  1  6 -4 -2 -1 -1 -1 -1 -6 
-W -4 -4 -5 -6 -4 -3 -5 -4 -3 -4 -3 -5 -2  0 -5 -4 -4 11  2 -3 -6 -4 -3 -6 
-Y -3 -3 -3 -4 -4 -3 -4 -5  1 -2 -2 -3 -2  3 -4 -3 -2  2  8 -3 -4 -3 -2 -6 
-V -1 -3 -4 -5 -2 -3 -3 -5 -4  3  0 -3  0 -2 -3 -2 -1 -3 -3  5 -4 -3 -2 -6 
-B -2 -2  4  4 -4 -1  0 -2 -1 -5 -5 -1 -4 -4 -3  0 -1 -6 -4 -4  4  0 -2 -6 
-Z -1  0 -1  0 -5  4  4 -3  0 -4 -4  1 -2 -4 -2 -1 -1 -4 -3 -3  0  4 -1 -6 
-X -1 -2 -2 -2 -3 -1 -2 -2 -2 -2 -2 -1 -1 -2 -2 -1 -1 -3 -2 -2 -2 -1 -2 -6 
-* -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6 -6  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUMN b/Butterfly/src/src/jaligner/matrix/matrices/BLOSUMN
deleted file mode 100644
index df064c8..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/BLOSUMN
+++ /dev/null
@@ -1,31 +0,0 @@
-#  Matrix made by matblas from blosumn.iij
-#  * column uses minimum score
-#  BLOSUM Clustered Scoring Matrix in 1/2 Bit Units
-#  Blocks Database = /data/blocks_5.0/blocks.dat
-#  Cluster Percentage: >= -2
-#  Entropy =   1.5172, Expected =  -1.1484
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  6 -2 -2 -3 -2 -1 -2 -1 -3 -3 -3 -2 -2 -4 -1  1 -1 -4 -4 -1 -3 -2 -1 -7 
-R -2  7 -1 -3 -6  0 -2 -4 -1 -5 -4  2 -3 -4 -3 -2 -2 -5 -4 -4 -2 -1 -2 -7 
-N -2 -1  7  1 -4 -1 -1 -2  0 -5 -5 -1 -4 -5 -4  0 -1 -6 -4 -4  4 -1 -2 -7 
-D -3 -3  1  7 -6 -2  1 -3 -2 -6 -6 -2 -5 -5 -3 -2 -2 -7 -5 -5  4  0 -3 -7 
-C -2 -6 -4 -6  9 -5 -7 -5 -6 -2 -3 -5 -3 -3 -5 -2 -2 -5 -4 -2 -5 -6 -4 -7 
-Q -1  0 -1 -2 -5  7  1 -4  0 -4 -3  1 -1 -4 -2 -1 -2 -4 -3 -4 -1  4 -2 -7 
-E -2 -2 -1  1 -7  1  6 -4 -1 -5 -5  0 -4 -5 -3 -1 -2 -5 -4 -4  0  5 -2 -7 
-G -1 -4 -2 -3 -5 -4 -4  6 -4 -6 -6 -3 -5 -5 -4 -1 -3 -5 -6 -5 -2 -4 -3 -7 
-H -3 -1  0 -2 -6  0 -1 -4  9 -5 -4 -2 -3 -3 -4 -2 -3 -4  1 -5 -1 -1 -3 -7 
-I -3 -5 -5 -6 -2 -4 -5 -6 -5  6  1 -4  1 -1 -5 -4 -2 -4 -3  2 -5 -5 -2 -7 
-L -3 -4 -5 -6 -3 -3 -5 -6 -4  1  5 -4  2  0 -5 -4 -3 -4 -3  0 -5 -4 -2 -7 
-K -2  2 -1 -2 -5  1  0 -3 -2 -4 -4  6 -2 -4 -2 -1 -2 -6 -4 -4 -1  0 -2 -7 
-M -2 -3 -4 -5 -3 -1 -4 -5 -3  1  2 -2  8 -1 -4 -3 -2 -2 -3  0 -5 -3 -2 -7 
-F -4 -4 -5 -5 -3 -4 -5 -5 -3 -1  0 -4 -1  7 -5 -4 -3  0  3 -2 -5 -5 -3 -7 
-P -1 -3 -4 -3 -5 -2 -3 -4 -4 -5 -5 -2 -4 -5  8 -2 -3 -5 -5 -4 -4 -3 -3 -7 
-S  1 -2  0 -2 -2 -1 -1 -1 -2 -4 -4 -1 -3 -4 -2  6  1 -4 -3 -3 -1 -1 -1 -7 
-T -1 -2 -1 -2 -2 -2 -2 -3 -3 -2 -3 -2 -2 -3 -3  1  6 -5 -3 -1 -2 -2 -1 -7 
-W -4 -5 -6 -7 -5 -4 -5 -5 -4 -4 -4 -6 -2  0 -5 -4 -5 11  1 -3 -6 -4 -4 -7 
-Y -4 -4 -4 -5 -4 -3 -4 -6  1 -3 -3 -4 -3  3 -5 -3 -3  1  8 -3 -4 -4 -3 -7 
-V -1 -4 -4 -5 -2 -4 -4 -5 -5  2  0 -4  0 -2 -4 -3 -1 -3 -3  5 -5 -4 -2 -7 
-B -3 -2  4  4 -5 -1  0 -2 -1 -5 -5 -1 -5 -5 -4 -1 -2 -6 -4 -5  4  1 -2 -7 
-Z -2 -1 -1  0 -6  4  5 -4 -1 -5 -4  0 -3 -5 -3 -1 -2 -4 -4 -4  1  4 -2 -7 
-X -1 -2 -2 -3 -4 -2 -2 -3 -3 -2 -2 -2 -2 -3 -3 -1 -1 -4 -3 -2 -2 -2 -2 -7 
-* -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7  1 
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/DAYHOFF b/Butterfly/src/src/jaligner/matrix/matrices/DAYHOFF
deleted file mode 100644
index e287ed0..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/DAYHOFF
+++ /dev/null
@@ -1,32 +0,0 @@
-#Date: Wed, 18 Sep 91 17:36:51 EDT
-#From: altschul at ray.nlm.nih.gov (Stephen Altschul)
-#To: gish at ray.nlm.nih.gov
-#Subject: Vanilla-flavored PAM-250
-#
-# substitution scores for B, Z, X, and * were obtained with "pam" version 1.0.5
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2  0  0  1 -1 -1 -2 -1 -1 -4  1  1  1 -6 -3  0  0  0  0 -8
-R -2  6  0 -1 -4  1 -1 -3  2 -2 -3  3  0 -4  0  0 -1  2 -4 -2 -1  0 -1 -8
-N  0  0  2  2 -4  1  1  0  2 -2 -3  1 -2 -4 -1  1  0 -4 -2 -2  2  1  0 -8
-D  0 -1  2  4 -5  2  3  1  1 -2 -4  0 -3 -6 -1  0  0 -7 -4 -2  3  3 -1 -8
-C -2 -4 -4 -5 12 -5 -5 -3 -3 -2 -6 -5 -5 -4 -3  0 -2 -8  0 -2 -4 -5 -3 -8
-Q  0  1  1  2 -5  4  2 -1  3 -2 -2  1 -1 -5  0 -1 -1 -5 -4 -2  1  3 -1 -8
-E  0 -1  1  3 -5  2  4  0  1 -2 -3  0 -2 -5 -1  0  0 -7 -4 -2  3  3 -1 -8
-G  1 -3  0  1 -3 -1  0  5 -2 -3 -4 -2 -3 -5 -1  1  0 -7 -5 -1  0  0 -1 -8
-H -1  2  2  1 -3  3  1 -2  6 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2 -1 -8
-I -1 -2 -2 -2 -2 -2 -2 -3 -2  5  2 -2  2  1 -2 -1  0 -5 -1  4 -2 -2 -1 -8
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  2  6 -3  4  2 -3 -3 -2 -2 -1  2 -3 -3 -1 -8
-K -1  3  1  0 -5  1  0 -2  0 -2 -3  5  0 -5 -1  0  0 -3 -4 -2  1  0 -1 -8
-M -1  0 -2 -3 -5 -1 -2 -3 -2  2  4  0  6  0 -2 -2 -1 -4 -2  2 -2 -2 -1 -8
-F -4 -4 -4 -6 -4 -5 -5 -5 -2  1  2 -5  0  9 -5 -3 -3  0  7 -1 -4 -5 -2 -8
-P  1  0 -1 -1 -3  0 -1 -1  0 -2 -3 -1 -2 -5  6  1  0 -6 -5 -1 -1  0 -1 -8
-S  1  0  1  0  0 -1  0  1 -1 -1 -3  0 -2 -3  1  2  1 -2 -3 -1  0  0  0 -8
-T  1 -1  0  0 -2 -1  0  0 -1  0 -2  0 -1 -3  0  1  3 -5 -3  0  0 -1  0 -8
-W -6  2 -4 -7 -8 -5 -7 -7 -3 -5 -2 -3 -4  0 -6 -2 -5 17  0 -6 -5 -6 -4 -8
-Y -3 -4 -2 -4  0 -4 -4 -5  0 -1 -1 -4 -2  7 -5 -3 -3  0 10 -2 -3 -4 -2 -8
-V  0 -2 -2 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -6 -2  4 -2 -2 -1 -8
-B  0 -1  2  3 -4  1  3  0  1 -2 -3  1 -2 -4 -1  0  0 -5 -3 -2  3  2 -1 -8
-Z  0  0  1  3 -5  3  3  0  2 -2 -3  0 -2 -5  0  0 -1 -6 -4 -2  2  3 -1 -8
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -1 -1 -1 -2 -1  0  0 -4 -2 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/EDNAFULL b/Butterfly/src/src/jaligner/matrix/matrices/EDNAFULL
deleted file mode 100644
index bfec6d9..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/EDNAFULL
+++ /dev/null
@@ -1,25 +0,0 @@
-#
-# This matrix was created by Todd Lowe   12/10/92
-#
-# Uses ambiguous nucleotide codes, probabilities rounded to
-#  nearest integer
-#
-# Lowest score = -4, Highest score = 5
-#
-    A   T   G   C   S   W   R   Y   K   M   B   V   H   D   N   U
-A   5  -4  -4  -4  -4   1   1  -4  -4   1  -4  -1  -1  -1  -2  -4
-T  -4   5  -4  -4  -4   1  -4   1   1  -4  -1  -4  -1  -1  -2   5
-G  -4  -4   5  -4   1  -4   1  -4   1  -4  -1  -1  -4  -1  -2  -4
-C  -4  -4  -4   5   1  -4  -4   1  -4   1  -1  -1  -1  -4  -2  -4
-S  -4  -4   1   1  -1  -4  -2  -2  -2  -2  -1  -1  -3  -3  -1  -4
-W   1   1  -4  -4  -4  -1  -2  -2  -2  -2  -3  -3  -1  -1  -1   1
-R   1  -4   1  -4  -2  -2  -1  -4  -2  -2  -3  -1  -3  -1  -1  -4
-Y  -4   1  -4   1  -2  -2  -4  -1  -2  -2  -1  -3  -1  -3  -1   1
-K  -4   1   1  -4  -2  -2  -2  -2  -1  -4  -1  -3  -3  -1  -1   1
-M   1  -4  -4   1  -2  -2  -2  -2  -4  -1  -3  -1  -1  -3  -1  -4
-B  -4  -1  -1  -1  -1  -3  -3  -1  -1  -3  -1  -2  -2  -2  -1  -1
-V  -1  -4  -1  -1  -1  -3  -1  -3  -3  -1  -2  -1  -2  -2  -1  -4
-H  -1  -1  -4  -1  -3  -1  -3  -1  -3  -1  -2  -2  -1  -2  -1  -1
-D  -1  -1  -1  -4  -3  -1  -1  -3  -1  -3  -2  -2  -2  -1  -1  -1
-N  -2  -2  -2  -2  -1  -1  -1  -1  -1  -1  -1  -1  -1  -1  -1  -2
-U  -4   5  -4  -4  -4   1  -4   1   1  -4  -1  -4  -1  -1  -2   5
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/GONNET b/Butterfly/src/src/jaligner/matrix/matrices/GONNET
deleted file mode 100644
index d7bd4f4..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/GONNET
+++ /dev/null
@@ -1,26 +0,0 @@
-# PAM 250 matrix recommended by Gonnet, Cohen & Benner
-# Science June 5, 1992.
-# Values rounded to nearest integer
-   C  S  T  P  A  G  N  D  E  Q  H  R  K  M  I  L  V  F  Y  W  X  *
-C 12  0  0 -3  0 -2 -2 -3 -3 -2 -1 -2 -3 -1 -1 -2  0 -1  0 -1 -3 -8
-S  0  2  2  0  1  0  1  0  0  0  0  0  0 -1 -2 -2 -1 -3 -2 -3  0 -8
-T  0  2  2  0  1 -1  0  0  0  0  0  0  0 -1 -1 -1  0 -2 -2 -4  0 -8
-P -3  0  0  8  0 -2 -1 -1  0  0 -1 -1 -1 -2 -3 -2 -2 -4 -3 -5 -1 -8
-A  0  1  1  0  2  0  0  0  0  0 -1 -1  0 -1 -1 -1  0 -2 -2 -4  0 -8
-G -2  0 -1 -2  0  7  0  0 -1 -1 -1 -1 -1 -4 -4 -4 -3 -5 -4 -4 -1 -8
-N -2  1  0 -1  0  0  4  2  1  1  1  0  1 -2 -3 -3 -2 -3 -1 -4  0 -8
-D -3  0  0 -1  0  0  2  5  3  1  0  0  0 -3 -4 -4 -3 -4 -3 -5 -1 -8
-E -3  0  0  0  0 -1  1  3  4  2  0  0  1 -2 -3 -3 -2 -4 -3 -4 -1 -8
-Q -2  0  0  0  0 -1  1  1  2  3  1  2  2 -1 -2 -2 -2 -3 -2 -3 -1 -8
-H -1  0  0 -1 -1 -1  1  0  0  1  6  1  1 -1 -2 -2 -2  0  2 -1 -1 -8
-R -2  0  0 -1 -1 -1  0  0  0  2  1  5  3 -2 -2 -2 -2 -3 -2 -2 -1 -8
-K -3  0  0 -1  0 -1  1  0  1  2  1  3  3 -1 -2 -2 -2 -3 -2 -4 -1 -8
-M -1 -1 -1 -2 -1 -4 -2 -3 -2 -1 -1 -2 -1  4  2  3  2  2  0 -1 -1 -8
-I -1 -2 -1 -3 -1 -4 -3 -4 -3 -2 -2 -2 -2  2  4  3  3  1 -1 -2 -1 -8
-L -2 -2 -1 -2 -1 -4 -3 -4 -3 -2 -2 -2 -2  3  3  4  2  2  0 -1 -1 -8
-V  0 -1  0 -2  0 -3 -2 -3 -2 -2 -2 -2 -2  2  3  2  3  0 -1 -3 -1 -8
-F -1 -3 -2 -4 -2 -5 -3 -4 -4 -3  0 -3 -3  2  1  2  0  7  5  4 -2 -8
-Y  0 -2 -2 -3 -2 -4 -1 -3 -3 -2  2 -2 -2  0 -1  0 -1  5  8  4 -2 -8
-W -1 -3 -4 -5 -4 -4 -4 -5 -4 -3 -1 -2 -4 -1 -2 -1 -3  4  4 14 -4 -8
-X -3  0  0 -1  0 -1  0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -2 -2 -4 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/IDENTITY b/Butterfly/src/src/jaligner/matrix/matrices/IDENTITY
deleted file mode 100644
index 63913d5..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/IDENTITY
+++ /dev/null
@@ -1,25 +0,0 @@
-  A  R  N  B  D  C  Q  Z  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  X  *
-A  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-R -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-N -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-B -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-D -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-C -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-Q -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-Z -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-E -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-G -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-H -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-I -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-L -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-K -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-M -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-F -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-P -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000 -10000
-S -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000 -10000
-T -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000 -10000
-W -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000 -10000
-Y -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000 -10000
-V -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  1 -10000 -10000
-X -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  0 -10000
-* -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000 -10000  0
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/MATCH b/Butterfly/src/src/jaligner/matrix/matrices/MATCH
deleted file mode 100644
index cda9e49..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/MATCH
+++ /dev/null
@@ -1,25 +0,0 @@
-   A  R  N  B  D  C  Q  Z  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  X  *
-A  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-R -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-N -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-B -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-D -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-C -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-Q -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-Z -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-E -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-G -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-H -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-I -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-L -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-K -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-M -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1 -1
-F -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1 -1
-P -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1 -1
-S -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1 -1
-T -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1 -1
-W -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1 -1
-Y -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1 -1
-V -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  1 -1 -1
-X -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  0 -1
-* -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1  0
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM10 b/Butterfly/src/src/jaligner/matrix/matrices/PAM10
deleted file mode 100644
index c164b06..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM10
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 10 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -8.27, Entropy = 3.43 bits
-#
-# Lowest score = -23, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   7 -10  -7  -6 -10  -7  -5  -4 -11  -8  -9 -10  -8 -12  -4  -3  -3 -20 -11  -5  -6  -6  -6 -23
-R -10   9  -9 -17 -11  -4 -15 -13  -4  -8 -12  -2  -7 -12  -7  -6 -10  -5 -14 -11 -11  -7  -9 -23
-N  -7  -9   9  -1 -17  -7  -5  -6  -2  -8 -10  -4 -15 -12  -9  -2  -5 -11  -7 -12   7  -6  -6 -23
-D  -6 -17  -1   8 -21  -6   0  -6  -7 -11 -19  -8 -17 -21 -12  -7  -8 -21 -17 -11   7  -1  -9 -23
-C -10 -11 -17 -21  10 -20 -20 -13 -10  -9 -21 -20 -20 -19 -11  -6 -11 -22  -7  -9 -18 -20 -13 -23
-Q  -7  -4  -7  -6 -20   9  -1 -10  -2 -11  -8  -6  -7 -19  -6  -8  -9 -19 -18 -10  -6   7  -8 -23
-E  -5 -15  -5   0 -20  -1   8  -7  -9  -8 -13  -7 -10 -20  -9  -7  -9 -23 -11 -10  -1   7  -8 -23
-G  -4 -13  -6  -6 -13 -10  -7   7 -13 -17 -14 -10 -12 -12 -10  -4 -10 -21 -20  -9  -6  -8  -8 -23
-H -11  -4  -2  -7 -10  -2  -9 -13  10 -13  -9 -10 -17  -9  -7  -9 -11 -10  -6  -9  -4  -4  -8 -23
-I  -8  -8  -8 -11  -9 -11  -8 -17 -13   9  -4  -9  -3  -5 -12 -10  -5 -20  -9  -1  -9  -9  -8 -23
-L  -9 -12 -10 -19 -21  -8 -13 -14  -9  -4   7 -11  -2  -5 -10 -12 -10  -9 -10  -5 -12 -10  -9 -23
-K -10  -2  -4  -8 -20  -6  -7 -10 -10  -9 -11   7  -4 -20 -10  -7  -6 -18 -12 -13  -5  -6  -8 -23
-M  -8  -7 -15 -17 -20  -7 -10 -12 -17  -3  -2  -4  12  -7 -11  -8  -7 -19 -17  -4 -16  -8  -9 -23
-F -12 -12 -12 -21 -19 -19 -20 -12  -9  -5  -5 -20  -7   9 -13  -9 -12  -7  -1 -12 -14 -20 -12 -23
-P  -4  -7  -9 -12 -11  -6  -9 -10  -7 -12 -10 -10 -11 -13   8  -4  -7 -20 -20  -9 -10  -7  -8 -23
-S  -3  -6  -2  -7  -6  -8  -7  -4  -9 -10 -12  -7  -8  -9  -4   7  -2  -8 -10 -10  -4  -8  -6 -23
-T  -3 -10  -5  -8 -11  -9  -9 -10 -11  -5 -10  -6  -7 -12  -7  -2   8 -19  -9  -6  -6  -9  -7 -23
-W -20  -5 -11 -21 -22 -19 -23 -21 -10 -20  -9 -18 -19  -7 -20  -8 -19  13  -8 -22 -13 -21 -16 -23
-Y -11 -14  -7 -17  -7 -18 -11 -20  -6  -9 -10 -12 -17  -1 -20 -10  -9  -8  10 -10  -9 -13 -11 -23
-V  -5 -11 -12 -11  -9 -10 -10  -9  -9  -1  -5 -13  -4 -12  -9 -10  -6 -22 -10   8 -11 -10  -8 -23
-B  -6 -11   7   7 -18  -6  -1  -6  -4  -9 -12  -5 -16 -14 -10  -4  -6 -13  -9 -11   7  -3  -8 -23
-Z  -6  -7  -6  -1 -20   7   7  -8  -4  -9 -10  -6  -8 -20  -7  -8  -9 -21 -13 -10  -3   7  -8 -23
-X  -6  -9  -6  -9 -13  -8  -8  -8  -8  -8  -9  -8  -9 -12  -8  -6  -7 -16 -11  -8  -8  -8  -8 -23
-* -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23 -23   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM100 b/Butterfly/src/src/jaligner/matrix/matrices/PAM100
deleted file mode 100644
index 2e33dd3..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM100
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 100 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.99, Entropy = 1.18 bits
-#
-# Lowest score = -9, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  4 -3 -1 -1 -3 -2  0  1 -3 -2 -3 -3 -2 -5  1  1  1 -7 -4  0 -1 -1 -1 -9
-R -3  7 -2 -4 -5  1 -3 -5  1 -3 -5  2 -1 -6 -1 -1 -3  1 -6 -4 -3 -1 -2 -9
-N -1 -2  5  3 -5 -1  1 -1  2 -3 -4  1 -4 -5 -2  1  0 -5 -2 -3  4  0 -1 -9
-D -1 -4  3  5 -7  0  4 -1 -1 -4 -6 -1 -5 -8 -3 -1 -2 -9 -6 -4  4  3 -2 -9
-C -3 -5 -5 -7  9 -8 -8 -5 -4 -3 -8 -8 -7 -7 -4 -1 -4 -9 -1 -3 -6 -8 -5 -9
-Q -2  1 -1  0 -8  6  2 -3  3 -4 -2  0 -2 -7 -1 -2 -2 -7 -6 -3  0  5 -2 -9
-E  0 -3  1  4 -8  2  5 -1 -1 -3 -5 -1 -4 -8 -2 -1 -2 -9 -5 -3  3  4 -2 -9
-G  1 -5 -1 -1 -5 -3 -1  5 -4 -5 -6 -3 -4 -6 -2  0 -2 -9 -7 -3 -1 -2 -2 -9
-H -3  1  2 -1 -4  3 -1 -4  7 -4 -3 -2 -4 -3 -1 -2 -3 -4 -1 -3  1  1 -2 -9
-I -2 -3 -3 -4 -3 -4 -3 -5 -4  6  1 -3  1  0 -4 -3  0 -7 -3  3 -3 -3 -2 -9
-L -3 -5 -4 -6 -8 -2 -5 -6 -3  1  6 -4  3  0 -4 -4 -3 -3 -3  0 -5 -4 -3 -9
-K -3  2  1 -1 -8  0 -1 -3 -2 -3 -4  5  0 -7 -3 -1 -1 -6 -6 -4  0 -1 -2 -9
-M -2 -1 -4 -5 -7 -2 -4 -4 -4  1  3  0  9 -1 -4 -3 -1 -6 -5  1 -4 -2 -2 -9
-F -5 -6 -5 -8 -7 -7 -8 -6 -3  0  0 -7 -1  8 -6 -4 -5 -1  4 -3 -6 -7 -4 -9
-P  1 -1 -2 -3 -4 -1 -2 -2 -1 -4 -4 -3 -4 -6  7  0 -1 -7 -7 -3 -3 -1 -2 -9
-S  1 -1  1 -1 -1 -2 -1  0 -2 -3 -4 -1 -3 -4  0  4  2 -3 -4 -2  0 -2 -1 -9
-T  1 -3  0 -2 -4 -2 -2 -2 -3  0 -3 -1 -1 -5 -1  2  5 -7 -4  0 -1 -2 -1 -9
-W -7  1 -5 -9 -9 -7 -9 -9 -4 -7 -3 -6 -6 -1 -7 -3 -7 12 -2 -9 -6 -8 -6 -9
-Y -4 -6 -2 -6 -1 -6 -5 -7 -1 -3 -3 -6 -5  4 -7 -4 -4 -2  9 -4 -4 -6 -4 -9
-V  0 -4 -3 -4 -3 -3 -3 -3 -3  3  0 -4  1 -3 -3 -2  0 -9 -4  5 -4 -3 -2 -9
-B -1 -3  4  4 -6  0  3 -1  1 -3 -5  0 -4 -6 -3  0 -1 -6 -4 -4  4  2 -2 -9
-Z -1 -1  0  3 -8  5  4 -2  1 -3 -4 -1 -2 -7 -1 -2 -2 -8 -6 -3  2  5 -2 -9
-X -1 -2 -1 -2 -5 -2 -2 -2 -2 -2 -3 -2 -2 -4 -2 -1 -1 -6 -4 -2 -2 -2 -2 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM110 b/Butterfly/src/src/jaligner/matrix/matrices/PAM110
deleted file mode 100644
index 25b2c01..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM110
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 110 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.81, Entropy = 1.07 bits
-#
-# Lowest score = -9, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -3 -1 -1 -3 -1  0  1 -3 -1 -3 -3 -2 -4  1  1  1 -7 -4  0 -1 -1 -1 -9
-R -3  7 -1 -4 -4  1 -3 -4  1 -3 -4  2 -1 -5 -1 -1 -2  1 -5 -4 -2 -1 -2 -9
-N -1 -1  4  2 -5  0  1  0  2 -2 -4  1 -3 -4 -2  1  0 -5 -2 -3  3  0 -1 -9
-D -1 -4  2  5 -7  1  4  0  0 -3 -6 -1 -5 -7 -3 -1 -1 -8 -5 -4  4  3 -2 -9
-C -3 -4 -5 -7  9 -7 -7 -5 -4 -3 -8 -7 -7 -6 -4 -1 -3 -9 -1 -3 -6 -7 -4 -9
-Q -1  1  0  1 -7  6  2 -3  3 -3 -2  0 -1 -6  0 -2 -2 -6 -6 -3  0  4 -1 -9
-E  0 -3  1  4 -7  2  5 -1 -1 -3 -5 -1 -3 -7 -2 -1 -2 -9 -5 -3  3  4 -2 -9
-G  1 -4  0  0 -5 -3 -1  5 -4 -4 -6 -3 -4 -5 -2  0 -2 -8 -7 -2  0 -2 -2 -9
-H -3  1  2  0 -4  3 -1 -4  7 -4 -3 -2 -4 -3 -1 -2 -3 -4 -1 -3  1  1 -2 -9
-I -1 -3 -2 -3 -3 -3 -3 -4 -4  6  1 -3  1  0 -4 -3  0 -7 -2  3 -3 -3 -2 -9
-L -3 -4 -4 -6 -8 -2 -5 -6 -3  1  6 -4  3  0 -4 -4 -3 -3 -3  1 -5 -3 -2 -9
-K -3  2  1 -1 -7  0 -1 -3 -2 -3 -4  5  0 -7 -3 -1 -1 -5 -5 -4  0 -1 -2 -9
-M -2 -1 -3 -5 -7 -1 -3 -4 -4  1  3  0  8 -1 -4 -2 -1 -6 -5  1 -4 -2 -2 -9
-F -4 -5 -4 -7 -6 -6 -7 -5 -3  0  0 -7 -1  8 -6 -4 -4 -1  4 -3 -6 -7 -4 -9
-P  1 -1 -2 -3 -4  0 -2 -2 -1 -4 -4 -3 -4 -6  6  0 -1 -7 -7 -2 -2 -1 -2 -9
-S  1 -1  1 -1 -1 -2 -1  0 -2 -3 -4 -1 -2 -4  0  3  2 -3 -3 -2  0 -1 -1 -9
-T  1 -2  0 -1 -3 -2 -2 -2 -3  0 -3 -1 -1 -4 -1  2  5 -6 -3  0 -1 -2 -1 -9
-W -7  1 -5 -8 -9 -6 -9 -8 -4 -7 -3 -5 -6 -1 -7 -3 -6 12 -2 -8 -6 -7 -5 -9
-Y -4 -5 -2 -5 -1 -6 -5 -7 -1 -2 -3 -5 -5  4 -7 -3 -3 -2  8 -4 -3 -5 -3 -9
-V  0 -4 -3 -4 -3 -3 -3 -2 -3  3  1 -4  1 -3 -2 -2  0 -8 -4  5 -3 -3 -2 -9
-B -1 -2  3  4 -6  0  3  0  1 -3 -5  0 -4 -6 -2  0 -1 -6 -3 -3  4  2 -1 -9
-Z -1 -1  0  3 -7  4  4 -2  1 -3 -3 -1 -2 -7 -1 -1 -2 -7 -5 -3  2  4 -2 -9
-X -1 -2 -1 -2 -4 -1 -2 -2 -2 -2 -2 -2 -2 -4 -2 -1 -1 -5 -3 -2 -1 -2 -2 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM120 b/Butterfly/src/src/jaligner/matrix/matrices/PAM120
deleted file mode 100644
index 3cbb04b..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM120
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 120 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.64, Entropy = 0.979 bits
-#
-# Lowest score = -8, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -3 -1  0 -3 -1  0  1 -3 -1 -3 -2 -2 -4  1  1  1 -7 -4  0  0 -1 -1 -8
-R -3  6 -1 -3 -4  1 -3 -4  1 -2 -4  2 -1 -5 -1 -1 -2  1 -5 -3 -2 -1 -2 -8
-N -1 -1  4  2 -5  0  1  0  2 -2 -4  1 -3 -4 -2  1  0 -4 -2 -3  3  0 -1 -8
-D  0 -3  2  5 -7  1  3  0  0 -3 -5 -1 -4 -7 -3  0 -1 -8 -5 -3  4  3 -2 -8
-C -3 -4 -5 -7  9 -7 -7 -4 -4 -3 -7 -7 -6 -6 -4  0 -3 -8 -1 -3 -6 -7 -4 -8
-Q -1  1  0  1 -7  6  2 -3  3 -3 -2  0 -1 -6  0 -2 -2 -6 -5 -3  0  4 -1 -8
-E  0 -3  1  3 -7  2  5 -1 -1 -3 -4 -1 -3 -7 -2 -1 -2 -8 -5 -3  3  4 -1 -8
-G  1 -4  0  0 -4 -3 -1  5 -4 -4 -5 -3 -4 -5 -2  1 -1 -8 -6 -2  0 -2 -2 -8
-H -3  1  2  0 -4  3 -1 -4  7 -4 -3 -2 -4 -3 -1 -2 -3 -3 -1 -3  1  1 -2 -8
-I -1 -2 -2 -3 -3 -3 -3 -4 -4  6  1 -3  1  0 -3 -2  0 -6 -2  3 -3 -3 -1 -8
-L -3 -4 -4 -5 -7 -2 -4 -5 -3  1  5 -4  3  0 -3 -4 -3 -3 -2  1 -4 -3 -2 -8
-K -2  2  1 -1 -7  0 -1 -3 -2 -3 -4  5  0 -7 -2 -1 -1 -5 -5 -4  0 -1 -2 -8
-M -2 -1 -3 -4 -6 -1 -3 -4 -4  1  3  0  8 -1 -3 -2 -1 -6 -4  1 -4 -2 -2 -8
-F -4 -5 -4 -7 -6 -6 -7 -5 -3  0  0 -7 -1  8 -5 -3 -4 -1  4 -3 -5 -6 -3 -8
-P  1 -1 -2 -3 -4  0 -2 -2 -1 -3 -3 -2 -3 -5  6  1 -1 -7 -6 -2 -2 -1 -2 -8
-S  1 -1  1  0  0 -2 -1  1 -2 -2 -4 -1 -2 -3  1  3  2 -2 -3 -2  0 -1 -1 -8
-T  1 -2  0 -1 -3 -2 -2 -1 -3  0 -3 -1 -1 -4 -1  2  4 -6 -3  0  0 -2 -1 -8
-W -7  1 -4 -8 -8 -6 -8 -8 -3 -6 -3 -5 -6 -1 -7 -2 -6 12 -2 -8 -6 -7 -5 -8
-Y -4 -5 -2 -5 -1 -5 -5 -6 -1 -2 -2 -5 -4  4 -6 -3 -3 -2  8 -3 -3 -5 -3 -8
-V  0 -3 -3 -3 -3 -3 -3 -2 -3  3  1 -4  1 -3 -2 -2  0 -8 -3  5 -3 -3 -1 -8
-B  0 -2  3  4 -6  0  3  0  1 -3 -4  0 -4 -5 -2  0  0 -6 -3 -3  4  2 -1 -8
-Z -1 -1  0  3 -7  4  4 -2  1 -3 -3 -1 -2 -6 -1 -1 -2 -7 -5 -3  2  4 -1 -8
-X -1 -2 -1 -2 -4 -1 -1 -2 -2 -1 -2 -2 -2 -3 -2 -1 -1 -5 -3 -1 -1 -1 -2 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM130 b/Butterfly/src/src/jaligner/matrix/matrices/PAM130
deleted file mode 100644
index 0b47a5d..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM130
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 130 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.48, Entropy = 0.895 bits
-#
-# Lowest score = -8, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -3  0  0 -3 -1  0  1 -2 -1 -3 -2 -2 -4  1  1  1 -6 -4  0  0  0 -1 -8
-R -3  6 -1 -3 -4  1 -3 -4  1 -2 -4  2 -1 -5 -1 -1 -2  1 -5 -3 -2 -1 -2 -8
-N  0 -1  4  2 -4  0  1  0  2 -2 -3  1 -3 -4 -1  1  0 -4 -2 -3  3  0 -1 -8
-D  0 -3  2  5 -6  1  3  0  0 -3 -5 -1 -4 -7 -2  0 -1 -7 -5 -3  4  3 -1 -8
-C -3 -4 -4 -6  9 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -3 -8 -1 -2 -5 -6 -4 -8
-Q -1  1  0  1 -6  5  2 -2  3 -3 -2  0 -1 -6  0 -1 -2 -6 -5 -3  0  4 -1 -8
-E  0 -3  1  3 -6  2  5 -1  0 -2 -4 -1 -3 -6 -2 -1 -1 -8 -5 -3  2  4 -1 -8
-G  1 -4  0  0 -4 -2 -1  5 -3 -4 -5 -3 -4 -5 -2  1 -1 -7 -6 -2  0 -1 -2 -8
-H -2  1  2  0 -4  3  0 -3  7 -3 -3 -1 -3 -2 -1 -2 -2 -3  0 -3  1  1 -1 -8
-I -1 -2 -2 -3 -3 -3 -2 -4 -3  5  1 -2  2  0 -3 -2  0 -6 -2  3 -3 -3 -1 -8
-L -3 -4 -3 -5 -7 -2 -4 -5 -3  1  5 -4  3  1 -3 -4 -2 -2 -2  1 -4 -3 -2 -8
-K -2  2  1 -1 -6  0 -1 -3 -1 -2 -4  5  0 -6 -2 -1  0 -5 -5 -4  0  0 -1 -8
-M -2 -1 -3 -4 -6 -1 -3 -4 -3  2  3  0  8 -1 -3 -2 -1 -5 -4  1 -3 -2 -1 -8
-F -4 -5 -4 -7 -5 -6 -6 -5 -2  0  1 -6 -1  7 -5 -3 -4 -1  4 -2 -5 -6 -3 -8
-P  1 -1 -1 -2 -3  0 -2 -2 -1 -3 -3 -2 -3 -5  6  1 -1 -6 -6 -2 -2 -1 -1 -8
-S  1 -1  1  0  0 -1 -1  1 -2 -2 -4 -1 -2 -3  1  3  2 -2 -3 -2  0 -1 -1 -8
-T  1 -2  0 -1 -3 -2 -1 -1 -2  0 -2  0 -1 -4 -1  2  4 -6 -3  0  0 -2 -1 -8
-W -6  1 -4 -7 -8 -6 -8 -7 -3 -6 -2 -5 -5 -1 -6 -2 -6 12 -1 -7 -5 -7 -5 -8
-Y -4 -5 -2 -5 -1 -5 -5 -6  0 -2 -2 -5 -4  4 -6 -3 -3 -1  8 -3 -3 -5 -3 -8
-V  0 -3 -3 -3 -2 -3 -3 -2 -3  3  1 -4  1 -2 -2 -2  0 -7 -3  5 -3 -3 -1 -8
-B  0 -2  3  4 -5  0  2  0  1 -3 -4  0 -3 -5 -2  0  0 -5 -3 -3  3  2 -1 -8
-Z  0 -1  0  3 -6  4  4 -1  1 -3 -3  0 -2 -6 -1 -1 -2 -7 -5 -3  2  4 -1 -8
-X -1 -2 -1 -1 -4 -1 -1 -2 -1 -1 -2 -1 -1 -3 -1 -1 -1 -5 -3 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM140 b/Butterfly/src/src/jaligner/matrix/matrices/PAM140
deleted file mode 100644
index 022c61b..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM140
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 140 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.35, Entropy = 0.820 bits
-#
-# Lowest score = -8, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -2  0  0 -2 -1  0  1 -2 -1 -2 -2 -2 -4  1  1  1 -6 -4  0  0  0 -1 -8
-R -2  6 -1 -3 -4  1 -2 -4  1 -2 -4  3 -1 -5 -1 -1 -2  1 -5 -3 -2 -1 -1 -8
-N  0 -1  3  2 -4  0  1  0  2 -2 -3  1 -2 -4 -1  1  0 -4 -2 -2  3  1 -1 -8
-D  0 -3  2  4 -6  1  3  0  0 -3 -5 -1 -4 -6 -2  0 -1 -7 -5 -3  4  3 -1 -8
-C -2 -4 -4 -6  9 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -3 -8 -1 -2 -5 -6 -4 -8
-Q -1  1  0  1 -6  5  2 -2  3 -3 -2  0 -1 -5  0 -1 -2 -5 -5 -2  1  4 -1 -8
-E  0 -2  1  3 -6  2  4 -1  0 -2 -4 -1 -3 -6 -1 -1 -1 -8 -4 -2  2  4 -1 -8
-G  1 -4  0  0 -4 -2 -1  5 -3 -4 -5 -3 -3 -5 -1  1 -1 -7 -6 -2  0 -1 -1 -8
-H -2  1  2  0 -4  3  0 -3  6 -3 -2 -1 -3 -2 -1 -1 -2 -3  0 -3  1  1 -1 -8
-I -1 -2 -2 -3 -3 -3 -2 -4 -3  5  1 -2  2  0 -3 -2  0 -6 -2  3 -2 -2 -1 -8
-L -2 -4 -3 -5 -7 -2 -4 -5 -2  1  5 -3  3  1 -3 -3 -2 -2 -2  1 -4 -3 -2 -8
-K -2  3  1 -1 -6  0 -1 -3 -1 -2 -3  5  0 -6 -2 -1  0 -4 -5 -3  0  0 -1 -8
-M -2 -1 -2 -4 -6 -1 -3 -3 -3  2  3  0  7 -1 -3 -2 -1 -5 -4  1 -3 -2 -1 -8
-F -4 -5 -4 -6 -5 -5 -6 -5 -2  0  1 -6 -1  7 -5 -3 -4 -1  4 -2 -5 -6 -3 -8
-P  1 -1 -1 -2 -3  0 -1 -1 -1 -3 -3 -2 -3 -5  6  1  0 -6 -6 -2 -2 -1 -1 -8
-S  1 -1  1  0  0 -1 -1  1 -1 -2 -3 -1 -2 -3  1  3  2 -2 -3 -2  0 -1  0 -8
-T  1 -2  0 -1 -3 -2 -1 -1 -2  0 -2  0 -1 -4  0  2  4 -5 -3  0  0 -1 -1 -8
-W -6  1 -4 -7 -8 -5 -8 -7 -3 -6 -2 -4 -5 -1 -6 -2 -5 12 -1 -7 -5 -6 -5 -8
-Y -4 -5 -2 -5 -1 -5 -4 -6  0 -2 -2 -5 -4  4 -6 -3 -3 -1  8 -3 -3 -4 -3 -8
-V  0 -3 -2 -3 -2 -2 -2 -2 -3  3  1 -3  1 -2 -2 -2  0 -7 -3  5 -3 -2 -1 -8
-B  0 -2  3  4 -5  1  2  0  1 -2 -4  0 -3 -5 -2  0  0 -5 -3 -3  3  2 -1 -8
-Z  0 -1  1  3 -6  4  4 -1  1 -2 -3  0 -2 -6 -1 -1 -1 -6 -4 -2  2  4 -1 -8
-X -1 -1 -1 -1 -4 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0 -1 -5 -3 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM150 b/Butterfly/src/src/jaligner/matrix/matrices/PAM150
deleted file mode 100644
index c010eef..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM150
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 150 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.25, Entropy = 0.754 bits
-#
-# Lowest score = -7, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -2  0  0 -2 -1  0  1 -2 -1 -2 -2 -1 -4  1  1  1 -6 -3  0  0  0 -1 -7
-R -2  6 -1 -2 -4  1 -2 -3  1 -2 -3  3 -1 -4 -1 -1 -2  1 -4 -3 -2  0 -1 -7
-N  0 -1  3  2 -4  0  1  0  2 -2 -3  1 -2 -4 -1  1  0 -4 -2 -2  3  1 -1 -7
-D  0 -2  2  4 -6  1  3  0  0 -3 -5 -1 -3 -6 -2  0 -1 -7 -4 -3  3  2 -1 -7
-C -2 -4 -4 -6  9 -6 -6 -4 -3 -2 -6 -6 -5 -5 -3  0 -3 -7  0 -2 -5 -6 -3 -7
-Q -1  1  0  1 -6  5  2 -2  3 -3 -2  0 -1 -5  0 -1 -1 -5 -4 -2  1  4 -1 -7
-E  0 -2  1  3 -6  2  4 -1  0 -2 -4 -1 -2 -6 -1 -1 -1 -7 -4 -2  2  4 -1 -7
-G  1 -3  0  0 -4 -2 -1  4 -3 -3 -4 -2 -3 -5 -1  1 -1 -7 -5 -2  0 -1 -1 -7
-H -2  1  2  0 -3  3  0 -3  6 -3 -2 -1 -3 -2 -1 -1 -2 -3  0 -3  1  1 -1 -7
-I -1 -2 -2 -3 -2 -3 -2 -3 -3  5  1 -2  2  0 -3 -2  0 -5 -2  3 -2 -2 -1 -7
-L -2 -3 -3 -5 -6 -2 -4 -4 -2  1  5 -3  3  1 -3 -3 -2 -2 -2  1 -4 -3 -2 -7
-K -2  3  1 -1 -6  0 -1 -2 -1 -2 -3  4  0 -6 -2 -1  0 -4 -4 -3  0  0 -1 -7
-M -1 -1 -2 -3 -5 -1 -2 -3 -3  2  3  0  7 -1 -3 -2 -1 -5 -3  1 -3 -2 -1 -7
-F -4 -4 -4 -6 -5 -5 -6 -5 -2  0  1 -6 -1  7 -5 -3 -3 -1  5 -2 -5 -5 -3 -7
-P  1 -1 -1 -2 -3  0 -1 -1 -1 -3 -3 -2 -3 -5  6  1  0 -6 -5 -2 -2 -1 -1 -7
-S  1 -1  1  0  0 -1 -1  1 -1 -2 -3 -1 -2 -3  1  2  1 -2 -3 -1  0 -1  0 -7
-T  1 -2  0 -1 -3 -1 -1 -1 -2  0 -2  0 -1 -3  0  1  4 -5 -3  0  0 -1 -1 -7
-W -6  1 -4 -7 -7 -5 -7 -7 -3 -5 -2 -4 -5 -1 -6 -2 -5 12 -1 -6 -5 -6 -4 -7
-Y -3 -4 -2 -4  0 -4 -4 -5  0 -2 -2 -4 -3  5 -5 -3 -3 -1  8 -3 -3 -4 -3 -7
-V  0 -3 -2 -3 -2 -2 -2 -2 -3  3  1 -3  1 -2 -2 -1  0 -6 -3  4 -2 -2 -1 -7
-B  0 -2  3  3 -5  1  2  0  1 -2 -4  0 -3 -5 -2  0  0 -5 -3 -2  3  2 -1 -7
-Z  0  0  1  2 -6  4  4 -1  1 -2 -3  0 -2 -5 -1 -1 -1 -6 -4 -2  2  4 -1 -7
-X -1 -1 -1 -1 -3 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0 -1 -4 -3 -1 -1 -1 -1 -7
-* -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM160 b/Butterfly/src/src/jaligner/matrix/matrices/PAM160
deleted file mode 100644
index f30d717..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM160
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 160 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -1.14, Entropy = 0.694 bits
-#
-# Lowest score = -7, Highest score = 12
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2 -1  0  1 -2 -1 -2 -2 -1 -3  1  1  1 -5 -3  0  0  0  0 -7
-R -2  6 -1 -2 -3  1 -2 -3  1 -2 -3  3 -1 -4 -1 -1 -1  1 -4 -3 -1  0 -1 -7
-N  0 -1  3  2 -4  0  1  0  2 -2 -3  1 -2 -3 -1  1  0 -4 -2 -2  2  1  0 -7
-D  0 -2  2  4 -5  1  3  0  0 -3 -4  0 -3 -6 -2  0 -1 -6 -4 -3  3  2 -1 -7
-C -2 -3 -4 -5  9 -5 -5 -3 -3 -2 -6 -5 -5 -5 -3  0 -2 -7  0 -2 -4 -5 -3 -7
-Q -1  1  0  1 -5  5  2 -2  2 -2 -2  0 -1 -5  0 -1 -1 -5 -4 -2  1  3 -1 -7
-E  0 -2  1  3 -5  2  4  0  0 -2 -3 -1 -2 -5 -1  0 -1 -7 -4 -2  2  3 -1 -7
-G  1 -3  0  0 -3 -2  0  4 -3 -3 -4 -2 -3 -4 -1  1 -1 -7 -5 -2  0 -1 -1 -7
-H -2  1  2  0 -3  2  0 -3  6 -3 -2 -1 -3 -2 -1 -1 -2 -3  0 -2  1  1 -1 -7
-I -1 -2 -2 -3 -2 -2 -2 -3 -3  5  2 -2  2  0 -2 -2  0 -5 -2  3 -2 -2 -1 -7
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  2  5 -3  3  1 -3 -3 -2 -2 -2  1 -4 -3 -2 -7
-K -2  3  1  0 -5  0 -1 -2 -1 -2 -3  4  0 -5 -2 -1  0 -4 -4 -3  0  0 -1 -7
-M -1 -1 -2 -3 -5 -1 -2 -3 -3  2  3  0  7  0 -2 -2 -1 -4 -3  1 -3 -2 -1 -7
-F -3 -4 -3 -6 -5 -5 -5 -4 -2  0  1 -5  0  7 -4 -3 -3 -1  5 -2 -4 -5 -3 -7
-P  1 -1 -1 -2 -3  0 -1 -1 -1 -2 -3 -2 -2 -4  5  1  0 -5 -5 -2 -1 -1 -1 -7
-S  1 -1  1  0  0 -1  0  1 -1 -2 -3 -1 -2 -3  1  2  1 -2 -3 -1  0 -1  0 -7
-T  1 -1  0 -1 -2 -1 -1 -1 -2  0 -2  0 -1 -3  0  1  3 -5 -3  0  0 -1  0 -7
-W -5  1 -4 -6 -7 -5 -7 -7 -3 -5 -2 -4 -4 -1 -5 -2 -5 12 -1 -6 -5 -6 -4 -7
-Y -3 -4 -2 -4  0 -4 -4 -5  0 -2 -2 -4 -3  5 -5 -3 -3 -1  8 -3 -3 -4 -3 -7
-V  0 -3 -2 -3 -2 -2 -2 -2 -2  3  1 -3  1 -2 -2 -1  0 -6 -3  4 -2 -2 -1 -7
-B  0 -1  2  3 -4  1  2  0  1 -2 -4  0 -3 -4 -1  0  0 -5 -3 -2  3  2 -1 -7
-Z  0  0  1  2 -5  3  3 -1  1 -2 -3  0 -2 -5 -1 -1 -1 -6 -4 -2  2  3 -1 -7
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0  0 -4 -3 -1 -1 -1 -1 -7
-* -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM170 b/Butterfly/src/src/jaligner/matrix/matrices/PAM170
deleted file mode 100644
index ca090d6..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM170
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 170 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -1.57, Entropy = 0.640 bits
-#
-# Lowest score = -10, Highest score = 18
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   3  -3   0   0  -3  -1   0   1  -3  -1  -3  -2  -2  -5   1   2   2  -8  -5   0   0   0  -1 -10
-R  -3   8  -1  -3  -5   1  -2  -4   2  -3  -4   4  -1  -6  -1  -1  -2   2  -6  -4  -2   0  -2 -10
-N   0  -1   4   3  -5   0   2   0   2  -3  -4   1  -3  -5  -1   1   0  -5  -3  -3   3   1  -1 -10
-D   0  -3   3   6  -7   2   5   0   0  -4  -6  -1  -4  -8  -2   0  -1  -9  -6  -4   5   4  -1 -10
-C  -3  -5  -5  -7  13  -8  -8  -5  -5  -3  -9  -8  -7  -6  -4   0  -3 -10   0  -3  -6  -8  -4 -10
-Q  -1   1   0   2  -8   6   3  -2   4  -3  -2   0  -1  -7   0  -1  -2  -7  -6  -3   1   5  -1 -10
-E   0  -2   2   5  -8   3   6   0   0  -3  -5  -1  -3  -8  -1  -1  -1 -10  -6  -3   3   5  -1 -10
-G   1  -4   0   0  -5  -2   0   6  -4  -4  -6  -3  -4  -6  -2   1  -1  -9  -7  -2   0  -1  -2 -10
-H  -3   2   2   0  -5   4   0  -4   9  -4  -3  -1  -4  -3  -1  -2  -2  -4   0  -3   1   2  -1 -10
-I  -1  -3  -3  -4  -3  -3  -3  -4  -4   7   2  -3   2   1  -3  -2   0  -7  -2   5  -3  -3  -1 -10
-L  -3  -4  -4  -6  -9  -2  -5  -6  -3   2   7  -4   4   1  -4  -4  -3  -3  -2   2  -5  -4  -2 -10
-K  -2   4   1  -1  -8   0  -1  -3  -1  -3  -4   6   1  -8  -2  -1   0  -5  -6  -4   0   0  -2 -10
-M  -2  -1  -3  -4  -7  -1  -3  -4  -4   2   4   1  10   0  -3  -2  -1  -6  -4   2  -4  -2  -1 -10
-F  -5  -6  -5  -8  -6  -7  -8  -6  -3   1   1  -8   0  10  -6  -4  -5  -1   7  -2  -6  -7  -4 -10
-P   1  -1  -1  -2  -4   0  -1  -2  -1  -3  -4  -2  -3  -6   8   1   0  -8  -7  -2  -2  -1  -1 -10
-S   2  -1   1   0   0  -1  -1   1  -2  -2  -4  -1  -2  -4   1   3   2  -3  -4  -2   1  -1   0 -10
-T   2  -2   0  -1  -3  -2  -1  -1  -2   0  -3   0  -1  -5   0   2   5  -7  -4   0   0  -1  -1 -10
-W  -8   2  -5  -9 -10  -7 -10  -9  -4  -7  -3  -5  -6  -1  -8  -3  -7  18  -1  -9  -7  -8  -6 -10
-Y  -5  -6  -3  -6   0  -6  -6  -7   0  -2  -2  -6  -4   7  -7  -4  -4  -1  12  -4  -4  -6  -4 -10
-V   0  -4  -3  -4  -3  -3  -3  -2  -3   5   2  -4   2  -2  -2  -2   0  -9  -4   6  -3  -3  -1 -10
-B   0  -2   3   5  -6   1   3   0   1  -3  -5   0  -4  -6  -2   1   0  -7  -4  -3   4   3  -1 -10
-Z   0   0   1   4  -8   5   5  -1   2  -3  -4   0  -2  -7  -1  -1  -1  -8  -6  -3   3   5  -1 -10
-X  -1  -2  -1  -1  -4  -1  -1  -2  -1  -1  -2  -2  -1  -4  -1   0  -1  -6  -4  -1  -1  -1  -2 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM180 b/Butterfly/src/src/jaligner/matrix/matrices/PAM180
deleted file mode 100644
index 84addeb..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM180
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 180 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -1.51, Entropy = 0.591 bits
-#
-# Lowest score = -10, Highest score = 18
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   3  -3   0   0  -3  -1   0   1  -2  -1  -3  -2  -2  -5   1   1   2  -8  -5   0   0   0  -1 -10
-R  -3   8  -1  -3  -5   1  -2  -4   2  -3  -4   4  -1  -6  -1  -1  -2   2  -6  -4  -2   0  -2 -10
-N   0  -1   4   3  -5   0   2   0   2  -3  -4   1  -3  -5  -1   1   0  -5  -2  -3   3   1  -1 -10
-D   0  -3   3   5  -7   2   4   0   0  -3  -6   0  -4  -8  -2   0  -1  -9  -6  -3   4   3  -1 -10
-C  -3  -5  -5  -7  13  -7  -7  -5  -4  -3  -8  -7  -7  -6  -4   0  -3 -10   0  -3  -6  -7  -4 -10
-Q  -1   1   0   2  -7   6   3  -2   4  -3  -2   0  -1  -6   0  -1  -2  -6  -6  -3   1   5  -1 -10
-E   0  -2   2   4  -7   3   5   0   0  -3  -5  -1  -3  -7  -1  -1  -1  -9  -6  -3   3   5  -1 -10
-G   1  -4   0   0  -5  -2   0   6  -3  -4  -6  -3  -4  -6  -1   1  -1  -9  -7  -2   0  -1  -2 -10
-H  -2   2   2   0  -4   4   0  -3   8  -4  -3  -1  -3  -3  -1  -2  -2  -4   0  -3   1   2  -1 -10
-I  -1  -3  -3  -3  -3  -3  -3  -4  -4   6   2  -3   2   1  -3  -2   0  -7  -2   5  -3  -3  -1 -10
-L  -3  -4  -4  -6  -8  -2  -5  -6  -3   2   7  -4   4   1  -4  -4  -3  -3  -2   2  -5  -3  -2 -10
-K  -2   4   1   0  -7   0  -1  -3  -1  -3  -4   6   1  -7  -2  -1   0  -5  -6  -4   0   0  -1 -10
-M  -2  -1  -3  -4  -7  -1  -3  -4  -3   2   4   1   9   0  -3  -2  -1  -6  -4   2  -3  -2  -1 -10
-F  -5  -6  -5  -8  -6  -6  -7  -6  -3   1   1  -7   0  10  -6  -4  -4   0   7  -2  -6  -7  -3 -10
-P   1  -1  -1  -2  -4   0  -1  -1  -1  -3  -4  -2  -3  -6   8   1   0  -7  -7  -2  -2  -1  -1 -10
-S   1  -1   1   0   0  -1  -1   1  -2  -2  -4  -1  -2  -4   1   3   2  -3  -4  -2   1  -1   0 -10
-T   2  -2   0  -1  -3  -2  -1  -1  -2   0  -3   0  -1  -4   0   2   4  -7  -4   0   0  -1  -1 -10
-W  -8   2  -5  -9 -10  -6  -9  -9  -4  -7  -3  -5  -6   0  -7  -3  -7  18  -1  -8  -7  -8  -6 -10
-Y  -5  -6  -2  -6   0  -6  -6  -7   0  -2  -2  -6  -4   7  -7  -4  -4  -1  11  -4  -4  -6  -3 -10
-V   0  -4  -3  -3  -3  -3  -3  -2  -3   5   2  -4   2  -2  -2  -2   0  -8  -4   6  -3  -3  -1 -10
-B   0  -2   3   4  -6   1   3   0   1  -3  -5   0  -3  -6  -2   1   0  -7  -4  -3   4   3  -1 -10
-Z   0   0   1   3  -7   5   5  -1   2  -3  -3   0  -2  -7  -1  -1  -1  -8  -6  -3   3   5  -1 -10
-X  -1  -2  -1  -1  -4  -1  -1  -2  -1  -1  -2  -1  -1  -3  -1   0  -1  -6  -3  -1  -1  -1  -1 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM190 b/Butterfly/src/src/jaligner/matrix/matrices/PAM190
deleted file mode 100644
index 6840cc4..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM190
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 190 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -1.35, Entropy = 0.547 bits
-#
-# Lowest score = -9, Highest score = 18
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -2  0  0 -3 -1  0  1 -2 -1 -3 -2 -2 -5  1  1  2 -7 -4  0  0  0  0 -9
-R -2  8 -1 -2 -5  1 -2 -4  2 -3 -4  4 -1 -6  0 -1 -2  2 -5 -3 -1  0 -1 -9
-N  0 -1  3  3 -5  1  2  0  2 -2 -4  1 -3 -4 -1  1  0 -5 -2 -3  3  1 -1 -9
-D  0 -2  3  5 -7  2  4  0  0 -3 -5  0 -4 -7 -2  0 -1 -8 -5 -3  4  3 -1 -9
-C -3 -5 -5 -7 13 -7 -7 -4 -4 -3 -8 -7 -7 -6 -4  0 -3 -9  0 -3 -6 -7 -4 -9
-Q -1  1  1  2 -7  6  3 -2  3 -3 -2  1 -1 -6  0 -1 -1 -6 -5 -3  1  4 -1 -9
-E  0 -2  2  4 -7  3  5  0  0 -3 -4 -1 -3 -7 -1  0 -1 -9 -5 -3  3  4 -1 -9
-G  1 -4  0  0 -4 -2  0  6 -3 -4 -5 -3 -4 -6 -1  1 -1 -9 -7 -2  0 -1 -1 -9
-H -2  2  2  0 -4  3  0 -3  8 -3 -3 -1 -3 -2 -1 -1 -2 -3  0 -3  1  2 -1 -9
-I -1 -3 -2 -3 -3 -3 -3 -4 -3  6  2 -3  2  1 -3 -2  0 -7 -2  4 -3 -3 -1 -9
-L -3 -4 -4 -5 -8 -2 -4 -5 -3  2  7 -4  4  2 -3 -4 -2 -3 -2  2 -5 -3 -2 -9
-K -2  4  1  0 -7  1 -1 -3 -1 -3 -4  6  1 -7 -2  0  0 -5 -6 -3  0  0 -1 -9
-M -2 -1 -3 -4 -7 -1 -3 -4 -3  2  4  1  9  0 -3 -2 -1 -6 -4  2 -3 -2 -1 -9
-F -5 -6 -4 -7 -6 -6 -7 -6 -2  1  2 -7  0 10 -6 -4 -4  0  7 -2 -6 -7 -3 -9
-P  1  0 -1 -2 -4  0 -1 -1 -1 -3 -3 -2 -3 -6  7  1  0 -7 -6 -2 -1 -1 -1 -9
-S  1 -1  1  0  0 -1  0  1 -1 -2 -4  0 -2 -4  1  3  2 -3 -4 -2  1 -1  0 -9
-T  2 -2  0 -1 -3 -1 -1 -1 -2  0 -2  0 -1 -4  0  2  4 -6 -3  0  0 -1  0 -9
-W -7  2 -5 -8 -9 -6 -9 -9 -3 -7 -3 -5 -6  0 -7 -3 -6 18 -1 -8 -6 -7 -5 -9
-Y -4 -5 -2 -5  0 -5 -5 -7  0 -2 -2 -6 -4  7 -6 -4 -3 -1 11 -3 -4 -5 -3 -9
-V  0 -3 -3 -3 -3 -3 -3 -2 -3  4  2 -3  2 -2 -2 -2  0 -8 -3  6 -3 -3 -1 -9
-B  0 -1  3  4 -6  1  3  0  1 -3 -5  0 -3 -6 -1  1  0 -6 -4 -3  4  2 -1 -9
-Z  0  0  1  3 -7  4  4 -1  2 -3 -3  0 -2 -7 -1 -1 -1 -7 -5 -3  2  4 -1 -9
-X  0 -1 -1 -1 -4 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0  0 -5 -3 -1 -1 -1 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM20 b/Butterfly/src/src/jaligner/matrix/matrices/PAM20
deleted file mode 100644
index 58cc98c..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM20
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 20 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -6.18, Entropy = 2.95 bits
-#
-# Lowest score = -19, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   6  -8  -5  -4  -8  -5  -3  -3  -8  -6  -7  -8  -6  -9  -2  -1  -1 -16  -9  -3  -5  -4  -4 -19
-R  -8   9  -7 -12  -9  -2 -11 -11  -3  -6 -10  -1  -5 -10  -5  -4  -8  -3 -11  -9  -9  -5  -7 -19
-N  -5  -7   8   1 -13  -5  -3  -4  -1  -6  -8  -2 -11 -10  -7  -1  -3  -9  -5  -9   6  -4  -4 -19
-D  -4 -12   1   8 -16  -4   2  -4  -5  -9 -15  -6 -13 -17  -9  -5  -6 -17 -13  -9   6   0  -7 -19
-C  -8  -9 -13 -16  10 -16 -16 -11  -8  -7 -17 -16 -16 -15  -9  -4  -9 -18  -5  -7 -14 -16 -11 -19
-Q  -5  -2  -5  -4 -16   9   0  -8   0  -9  -6  -4  -5 -15  -4  -6  -7 -15 -14  -8  -4   7  -6 -19
-E  -3 -11  -3   2 -16   0   8  -5  -6  -6 -10  -5  -8 -16  -7  -5  -7 -19  -9  -8   0   6  -6 -19
-G  -3 -11  -4  -4 -11  -8  -5   7 -10 -13 -12  -8 -10 -10  -7  -3  -7 -17 -16  -7  -4  -6  -6 -19
-H  -8  -3  -1  -5  -8   0  -6 -10   9 -11  -7  -8 -13  -7  -5  -7  -8  -8  -4  -7  -2  -2  -6 -19
-I  -6  -6  -6  -9  -7  -9  -6 -13 -11   9  -2  -7  -2  -3 -10  -8  -3 -16  -7   1  -7  -7  -6 -19
-L  -7 -10  -8 -15 -17  -6 -10 -12  -7  -2   7  -9   0  -4  -8  -9  -8  -7  -8  -3 -10  -8  -7 -19
-K  -8  -1  -2  -6 -16  -4  -5  -8  -8  -7  -9   7  -3 -16  -8  -5  -4 -14 -10 -10  -3  -5  -6 -19
-M  -6  -5 -11 -13 -16  -5  -8 -10 -13  -2   0  -3  11  -5  -9  -6  -5 -15 -13  -2 -12  -6  -6 -19
-F  -9 -10 -10 -17 -15 -15 -16 -10  -7  -3  -4 -16  -5   9 -11  -7 -10  -6   1  -9 -12 -16  -9 -19
-P  -2  -5  -7  -9  -9  -4  -7  -7  -5 -10  -8  -8  -9 -11   8  -3  -5 -16 -16  -7  -8  -5  -6 -19
-S  -1  -4  -1  -5  -4  -6  -5  -3  -7  -8  -9  -5  -6  -7  -3   7   0  -6  -8  -8  -2  -6  -4 -19
-T  -1  -8  -3  -6  -9  -7  -7  -7  -8  -3  -8  -4  -5 -10  -5   0   7 -15  -7  -4  -4  -7  -5 -19
-W -16  -3  -9 -17 -18 -15 -19 -17  -8 -16  -7 -14 -15  -6 -16  -6 -15  13  -6 -18 -11 -17 -13 -19
-Y  -9 -11  -5 -13  -5 -14  -9 -16  -4  -7  -8 -10 -13   1 -16  -8  -7  -6  10  -8  -7 -11  -9 -19
-V  -3  -9  -9  -9  -7  -8  -8  -7  -7   1  -3 -10  -2  -9  -7  -8  -4 -18  -8   7  -9  -8  -6 -19
-B  -5  -9   6   6 -14  -4   0  -4  -2  -7 -10  -3 -12 -12  -8  -2  -4 -11  -7  -9   6  -1  -6 -19
-Z  -4  -5  -4   0 -16   7   6  -6  -2  -7  -8  -5  -6 -16  -5  -6  -7 -17 -11  -8  -1   6  -6 -19
-X  -4  -7  -4  -7 -11  -6  -6  -6  -6  -6  -7  -6  -6  -9  -6  -4  -5 -13  -9  -6  -6  -6  -6 -19
-* -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19 -19   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM200 b/Butterfly/src/src/jaligner/matrix/matrices/PAM200
deleted file mode 100644
index d4edff2..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM200
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 200 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -1.23, Entropy = 0.507 bits
-#
-# Lowest score = -9, Highest score = 18
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  3 -2  0  0 -3 -1  0  1 -2 -1 -2 -2 -2 -4  1  1  1 -7 -4  0  0  0  0 -9
-R -2  7  0 -2 -4  1 -2 -4  2 -2 -4  4 -1 -5  0 -1 -1  2 -5 -3 -1  0 -1 -9
-N  0  0  3  3 -5  1  2  0  2 -2 -4  1 -2 -4 -1  1  0 -5 -2 -2  3  1  0 -9
-D  0 -2  3  5 -6  2  4  0  0 -3 -5  0 -4 -7 -2  0  0 -8 -5 -3  4  3 -1 -9
-C -3 -4 -5 -6 12 -7 -7 -4 -4 -3 -7 -7 -6 -6 -4  0 -3 -9  0 -2 -5 -7 -4 -9
-Q -1  1  1  2 -7  5  3 -2  3 -3 -2  1 -1 -6  0 -1 -1 -6 -5 -3  1  4 -1 -9
-E  0 -2  2  4 -7  3  5  0  0 -3 -4  0 -3 -7 -1  0 -1 -9 -5 -2  3  4 -1 -9
-G  1 -4  0  0 -4 -2  0  6 -3 -3 -5 -2 -4 -6 -1  1  0 -8 -6 -2  0 -1 -1 -9
-H -2  2  2  0 -4  3  0 -3  8 -3 -3 -1 -3 -2 -1 -1 -2 -3  0 -3  1  2 -1 -9
-I -1 -2 -2 -3 -3 -3 -3 -3 -3  6  2 -2  2  1 -3 -2  0 -6 -2  4 -3 -3 -1 -9
-L -2 -4 -4 -5 -7 -2 -4 -5 -3  2  7 -4  4  2 -3 -4 -2 -2 -2  2 -4 -3 -2 -9
-K -2  4  1  0 -7  1  0 -2 -1 -2 -4  6  1 -7 -2  0  0 -4 -5 -3  0  0 -1 -9
-M -2 -1 -2 -4 -6 -1 -3 -4 -3  2  4  1  8  0 -3 -2 -1 -5 -3  2 -3 -2 -1 -9
-F -4 -5 -4 -7 -6 -6 -7 -6 -2  1  2 -7  0 10 -6 -4 -4  0  7 -2 -6 -6 -3 -9
-P  1  0 -1 -2 -4  0 -1 -1 -1 -3 -3 -2 -3 -6  7  1  0 -7 -6 -2 -1 -1 -1 -9
-S  1 -1  1  0  0 -1  0  1 -1 -2 -4  0 -2 -4  1  2  2 -3 -3 -1  1 -1  0 -9
-T  1 -1  0  0 -3 -1 -1  0 -2  0 -2  0 -1 -4  0  2  4 -6 -3  0  0 -1  0 -9
-W -7  2 -5 -8 -9 -6 -9 -8 -3 -6 -2 -4 -5  0 -7 -3 -6 18 -1 -8 -6 -7 -5 -9
-Y -4 -5 -2 -5  0 -5 -5 -6  0 -2 -2 -5 -3  7 -6 -3 -3 -1 11 -3 -4 -5 -3 -9
-V  0 -3 -2 -3 -2 -3 -2 -2 -3  4  2 -3  2 -2 -2 -1  0 -8 -3  5 -3 -2 -1 -9
-B  0 -1  3  4 -5  1  3  0  1 -3 -4  0 -3 -6 -1  1  0 -6 -4 -3  3  2 -1 -9
-Z  0  0  1  3 -7  4  4 -1  2 -3 -3  0 -2 -6 -1 -1 -1 -7 -5 -2  2  4 -1 -9
-X  0 -1  0 -1 -4 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0  0 -5 -3 -1 -1 -1 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM210 b/Butterfly/src/src/jaligner/matrix/matrices/PAM210
deleted file mode 100644
index 0b49af5..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM210
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 210 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -1.12, Entropy = 0.470 bits
-#
-# Lowest score = -9, Highest score = 18
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2 -1  0  1 -2 -1 -2 -2 -1 -4  1  1  1 -7 -4  0  0  0  0 -9
-R -2  7  0 -2 -4  1 -2 -3  2 -2 -4  4 -1 -5  0  0 -1  2 -5 -3 -1  0 -1 -9
-N  0  0  3  2 -4  1  2  0  2 -2 -3  1 -2 -4 -1  1  0 -5 -2 -2  3  1  0 -9
-D  0 -2  2  5 -6  2  4  0  1 -3 -5  0 -3 -7 -1  0  0 -8 -5 -3  4  3 -1 -9
-C -2 -4 -4 -6 12 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -3 -9  0 -2 -5 -6 -4 -9
-Q -1  1  1  2 -6  5  3 -2  3 -3 -2  1 -1 -6  0 -1 -1 -6 -5 -2  1  4 -1 -9
-E  0 -2  2  4 -6  3  5  0  0 -2 -4  0 -3 -6 -1  0 -1 -8 -5 -2  3  4 -1 -9
-G  1 -3  0  0 -4 -2  0  5 -3 -3 -5 -2 -3 -5 -1  1  0 -8 -6 -2  0 -1 -1 -9
-H -2  2  2  1 -4  3  0 -3  8 -3 -2  0 -3 -2  0 -1 -2 -3  0 -3  1  2 -1 -9
-I -1 -2 -2 -3 -3 -3 -2 -3 -3  5  2 -2  2  1 -3 -2  0 -6 -1  4 -3 -3 -1 -9
-L -2 -4 -3 -5 -7 -2 -4 -5 -2  2  7 -3  4  2 -3 -3 -2 -2 -1  2 -4 -3 -2 -9
-K -2  4  1  0 -6  1  0 -2  0 -2 -3  5  1 -6 -2  0  0 -4 -5 -3  0  0 -1 -9
-M -1 -1 -2 -3 -6 -1 -3 -3 -3  2  4  1  8  0 -3 -2 -1 -5 -3  2 -3 -2 -1 -9
-F -4 -5 -4 -7 -5 -6 -6 -5 -2  1  2 -6  0 10 -5 -4 -4  0  7 -2 -5 -6 -3 -9
-P  1  0 -1 -1 -3  0 -1 -1  0 -3 -3 -2 -3 -5  7  1  0 -7 -6 -2 -1  0 -1 -9
-S  1  0  1  0  0 -1  0  1 -1 -2 -3  0 -2 -4  1  2  2 -3 -3 -1  1  0  0 -9
-T  1 -1  0  0 -3 -1 -1  0 -2  0 -2  0 -1 -4  0  2  3 -6 -3  0  0 -1  0 -9
-W -7  2 -5 -8 -9 -6 -8 -8 -3 -6 -2 -4 -5  0 -7 -3 -6 18 -1 -7 -6 -7 -5 -9
-Y -4 -5 -2 -5  0 -5 -5 -6  0 -1 -1 -5 -3  7 -6 -3 -3 -1 11 -3 -4 -5 -3 -9
-V  0 -3 -2 -3 -2 -2 -2 -2 -3  4  2 -3  2 -2 -2 -1  0 -7 -3  5 -2 -2 -1 -9
-B  0 -1  3  4 -5  1  3  0  1 -3 -4  0 -3 -5 -1  1  0 -6 -4 -2  3  2 -1 -9
-Z  0  0  1  3 -6  4  4 -1  2 -3 -3  0 -2 -6  0  0 -1 -7 -5 -2  2  4 -1 -9
-X  0 -1  0 -1 -4 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0  0 -5 -3 -1 -1 -1 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM220 b/Butterfly/src/src/jaligner/matrix/matrices/PAM220
deleted file mode 100644
index 0834a92..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM220
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 220 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -1.06, Entropy = 0.437 bits
-#
-# Lowest score = -8, Highest score = 17
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2 -1  0  1 -2 -1 -2 -1 -1 -4  1  1  1 -6 -4  0  0  0  0 -8
-R -2  7  0 -2 -4  1 -1 -3  2 -2 -3  4 -1 -5  0  0 -1  2 -5 -3 -1  0 -1 -8
-N  0  0  3  2 -4  1  2  0  2 -2 -3  1 -2 -4 -1  1  0 -4 -2 -2  2  1  0 -8
-D  0 -2  2  4 -6  2  4  0  1 -3 -5  0 -3 -6 -1  0  0 -8 -5 -3  4  3 -1 -8
-C -2 -4 -4 -6 12 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -3 -8  0 -2 -5 -6 -3 -8
-Q -1  1  1  2 -6  5  3 -2  3 -2 -2  1 -1 -5  0 -1 -1 -5 -5 -2  1  4 -1 -8
-E  0 -1  2  4 -6  3  4  0  1 -2 -4  0 -2 -6 -1  0 -1 -8 -5 -2  3  4 -1 -8
-G  1 -3  0  0 -4 -2  0  5 -3 -3 -5 -2 -3 -5 -1  1  0 -8 -6 -2  0 -1 -1 -8
-H -2  2  2  1 -4  3  1 -3  7 -3 -2  0 -3 -2  0 -1 -2 -3  0 -3  1  2 -1 -8
-I -1 -2 -2 -3 -3 -2 -2 -3 -3  5  2 -2  2  1 -2 -2  0 -6 -1  4 -2 -2 -1 -8
-L -2 -3 -3 -5 -7 -2 -4 -5 -2  2  6 -3  4  2 -3 -3 -2 -2 -1  2 -4 -3 -2 -8
-K -1  4  1  0 -6  1  0 -2  0 -2 -3  5  1 -6 -1  0  0 -4 -5 -3  0  0 -1 -8
-M -1 -1 -2 -3 -6 -1 -2 -3 -3  2  4  1  8  0 -2 -2 -1 -5 -3  2 -3 -2 -1 -8
-F -4 -5 -4 -6 -5 -5 -6 -5 -2  1  2 -6  0 10 -5 -4 -4  0  7 -2 -5 -6 -3 -8
-P  1  0 -1 -1 -3  0 -1 -1  0 -2 -3 -1 -2 -5  7  1  0 -6 -6 -1 -1  0 -1 -8
-S  1  0  1  0  0 -1  0  1 -1 -2 -3  0 -2 -4  1  2  2 -3 -3 -1  0  0  0 -8
-T  1 -1  0  0 -3 -1 -1  0 -2  0 -2  0 -1 -4  0  2  3 -6 -3  0  0 -1  0 -8
-W -6  2 -4 -8 -8 -5 -8 -8 -3 -6 -2 -4 -5  0 -6 -3 -6 17  0 -7 -6 -7 -5 -8
-Y -4 -5 -2 -5  0 -5 -5 -6  0 -1 -1 -5 -3  7 -6 -3 -3  0 11 -3 -3 -5 -3 -8
-V  0 -3 -2 -3 -2 -2 -2 -2 -3  4  2 -3  2 -2 -1 -1  0 -7 -3  5 -2 -2 -1 -8
-B  0 -1  2  4 -5  1  3  0  1 -2 -4  0 -3 -5 -1  0  0 -6 -3 -2  3  2 -1 -8
-Z  0  0  1  3 -6  4  4 -1  2 -2 -3  0 -2 -6  0  0 -1 -7 -5 -2  2  4 -1 -8
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0  0 -5 -3 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM230 b/Butterfly/src/src/jaligner/matrix/matrices/PAM230
deleted file mode 100644
index c9ff6db..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM230
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 230 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -0.991, Entropy = 0.407 bits
-#
-# Lowest score = -8, Highest score = 17
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2 -1  0  1 -2 -1 -2 -1 -1 -4  1  1  1 -6 -4  0  0  0  0 -8
-R -2  7  0 -2 -4  1 -1 -3  2 -2 -3  4 -1 -5  0  0 -1  2 -5 -3 -1  0 -1 -8
-N  0  0  2  2 -4  1  1  0  2 -2 -3  1 -2 -4 -1  1  0 -4 -2 -2  2  1  0 -8
-D  0 -2  2  4 -6  2  4  1  1 -3 -4  0 -3 -6 -1  0  0 -7 -5 -2  3  3 -1 -8
-C -2 -4 -4 -6 12 -6 -6 -4 -4 -2 -7 -6 -6 -5 -3  0 -2 -8  0 -2 -5 -6 -3 -8
-Q -1  1  1  2 -6  5  3 -1  3 -2 -2  1 -1 -5  0 -1 -1 -5 -4 -2  1  4 -1 -8
-E  0 -1  1  4 -6  3  4  0  1 -2 -4  0 -2 -6 -1  0 -1 -8 -5 -2  3  4 -1 -8
-G  1 -3  0  1 -4 -1  0  5 -2 -3 -4 -2 -3 -5 -1  1  0 -7 -6 -2  0 -1 -1 -8
-H -2  2  2  1 -4  3  1 -2  7 -3 -2  0 -2 -2  0 -1 -2 -3  0 -2  1  2 -1 -8
-I -1 -2 -2 -3 -2 -2 -2 -3 -3  5  2 -2  2  1 -2 -2  0 -6 -1  4 -2 -2 -1 -8
-L -2 -3 -3 -4 -7 -2 -4 -4 -2  2  6 -3  4  2 -3 -3 -2 -2 -1  2 -4 -3 -2 -8
-K -1  4  1  0 -6  1  0 -2  0 -2 -3  5  0 -6 -1  0  0 -4 -5 -3  1  0 -1 -8
-M -1 -1 -2 -3 -6 -1 -2 -3 -2  2  4  0  7  0 -2 -2 -1 -5 -3  2 -2 -2 -1 -8
-F -4 -5 -4 -6 -5 -5 -6 -5 -2  1  2 -6  0  9 -5 -3 -3  0  7 -1 -5 -6 -3 -8
-P  1  0 -1 -1 -3  0 -1 -1  0 -2 -3 -1 -2 -5  6  1  0 -6 -5 -1 -1  0 -1 -8
-S  1  0  1  0  0 -1  0  1 -1 -2 -3  0 -2 -3  1  2  2 -3 -3 -1  0  0  0 -8
-T  1 -1  0  0 -2 -1 -1  0 -2  0 -2  0 -1 -3  0  2  3 -6 -3  0  0 -1  0 -8
-W -6  2 -4 -7 -8 -5 -8 -7 -3 -6 -2 -4 -5  0 -6 -3 -6 17  0 -7 -6 -6 -4 -8
-Y -4 -5 -2 -5  0 -4 -5 -6  0 -1 -1 -5 -3  7 -5 -3 -3  0 10 -3 -3 -5 -3 -8
-V  0 -3 -2 -2 -2 -2 -2 -2 -2  4  2 -3  2 -1 -1 -1  0 -7 -3  5 -2 -2 -1 -8
-B  0 -1  2  3 -5  1  3  0  1 -2 -4  1 -2 -5 -1  0  0 -6 -3 -2  3  2 -1 -8
-Z  0  0  1  3 -6  4  4 -1  2 -2 -3  0 -2 -6  0  0 -1 -6 -5 -2  2  4 -1 -8
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -2 -1 -1 -3 -1  0  0 -4 -3 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM240 b/Butterfly/src/src/jaligner/matrix/matrices/PAM240
deleted file mode 100644
index c17cdf8..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM240
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 240 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -0.923, Entropy = 0.379 bits
-#
-# Lowest score = -8, Highest score = 17
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2  0  0  1 -1 -1 -2 -1 -1 -4  1  1  1 -6 -4  0  0  0  0 -8
-R -2  6  0 -1 -4  1 -1 -3  2 -2 -3  3  0 -5  0  0 -1  2 -4 -3 -1  0 -1 -8
-N  0  0  2  2 -4  1  1  0  2 -2 -3  1 -2 -4 -1  1  0 -4 -2 -2  2  1  0 -8
-D  0 -1  2  4 -5  2  4  1  1 -2 -4  0 -3 -6 -1  0  0 -7 -4 -2  3  3 -1 -8
-C -2 -4 -4 -5 12 -6 -6 -4 -4 -2 -6 -6 -5 -5 -3  0 -2 -8  0 -2 -5 -6 -3 -8
-Q  0  1  1  2 -6  4  3 -1  3 -2 -2  1 -1 -5  0 -1 -1 -5 -4 -2  1  3 -1 -8
-E  0 -1  1  4 -6  3  4  0  1 -2 -3  0 -2 -6 -1  0  0 -7 -4 -2  3  3 -1 -8
-G  1 -3  0  1 -4 -1  0  5 -2 -3 -4 -2 -3 -5 -1  1  0 -7 -5 -1  0  0 -1 -8
-H -1  2  2  1 -4  3  1 -2  7 -3 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2 -1 -8
-I -1 -2 -2 -2 -2 -2 -2 -3 -3  5  2 -2  2  1 -2 -1  0 -5 -1  4 -2 -2 -1 -8
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  2  6 -3  4  2 -3 -3 -2 -2 -1  2 -4 -3 -1 -8
-K -1  3  1  0 -6  1  0 -2  0 -2 -3  5  0 -5 -1  0  0 -4 -5 -3  1  0 -1 -8
-M -1  0 -2 -3 -5 -1 -2 -3 -2  2  4  0  7  0 -2 -2 -1 -4 -3  2 -2 -2 -1 -8
-F -4 -5 -4 -6 -5 -5 -6 -5 -2  1  2 -5  0  9 -5 -3 -3  0  7 -1 -5 -5 -2 -8
-P  1  0 -1 -1 -3  0 -1 -1  0 -2 -3 -1 -2 -5  6  1  0 -6 -5 -1 -1  0 -1 -8
-S  1  0  1  0  0 -1  0  1 -1 -1 -3  0 -2 -3  1  2  1 -3 -3 -1  0  0  0 -8
-T  1 -1  0  0 -2 -1  0  0 -1  0 -2  0 -1 -3  0  1  3 -5 -3  0  0 -1  0 -8
-W -6  2 -4 -7 -8 -5 -7 -7 -3 -5 -2 -4 -4  0 -6 -3 -5 17  0 -6 -5 -6 -4 -8
-Y -4 -4 -2 -4  0 -4 -4 -5  0 -1 -1 -5 -3  7 -5 -3 -3  0 10 -3 -3 -4 -2 -8
-V  0 -3 -2 -2 -2 -2 -2 -1 -2  4  2 -3  2 -1 -1 -1  0 -6 -3  4 -2 -2 -1 -8
-B  0 -1  2  3 -5  1  3  0  1 -2 -4  1 -2 -5 -1  0  0 -5 -3 -2  3  2 -1 -8
-Z  0  0  1  3 -6  3  3  0  2 -2 -3  0 -2 -5  0  0 -1 -6 -4 -2  2  3 -1 -8
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -1 -1 -1 -2 -1  0  0 -4 -2 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM250 b/Butterfly/src/src/jaligner/matrix/matrices/PAM250
deleted file mode 100644
index 17e9e60..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM250
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 250 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -0.844, Entropy = 0.354 bits
-#
-# Lowest score = -8, Highest score = 17
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2  0  0  1 -1 -1 -2 -1 -1 -3  1  1  1 -6 -3  0  0  0  0 -8
-R -2  6  0 -1 -4  1 -1 -3  2 -2 -3  3  0 -4  0  0 -1  2 -4 -2 -1  0 -1 -8
-N  0  0  2  2 -4  1  1  0  2 -2 -3  1 -2 -3  0  1  0 -4 -2 -2  2  1  0 -8
-D  0 -1  2  4 -5  2  3  1  1 -2 -4  0 -3 -6 -1  0  0 -7 -4 -2  3  3 -1 -8
-C -2 -4 -4 -5 12 -5 -5 -3 -3 -2 -6 -5 -5 -4 -3  0 -2 -8  0 -2 -4 -5 -3 -8
-Q  0  1  1  2 -5  4  2 -1  3 -2 -2  1 -1 -5  0 -1 -1 -5 -4 -2  1  3 -1 -8
-E  0 -1  1  3 -5  2  4  0  1 -2 -3  0 -2 -5 -1  0  0 -7 -4 -2  3  3 -1 -8
-G  1 -3  0  1 -3 -1  0  5 -2 -3 -4 -2 -3 -5  0  1  0 -7 -5 -1  0  0 -1 -8
-H -1  2  2  1 -3  3  1 -2  6 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2 -1 -8
-I -1 -2 -2 -2 -2 -2 -2 -3 -2  5  2 -2  2  1 -2 -1  0 -5 -1  4 -2 -2 -1 -8
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  2  6 -3  4  2 -3 -3 -2 -2 -1  2 -3 -3 -1 -8
-K -1  3  1  0 -5  1  0 -2  0 -2 -3  5  0 -5 -1  0  0 -3 -4 -2  1  0 -1 -8
-M -1  0 -2 -3 -5 -1 -2 -3 -2  2  4  0  6  0 -2 -2 -1 -4 -2  2 -2 -2 -1 -8
-F -3 -4 -3 -6 -4 -5 -5 -5 -2  1  2 -5  0  9 -5 -3 -3  0  7 -1 -4 -5 -2 -8
-P  1  0  0 -1 -3  0 -1  0  0 -2 -3 -1 -2 -5  6  1  0 -6 -5 -1 -1  0 -1 -8
-S  1  0  1  0  0 -1  0  1 -1 -1 -3  0 -2 -3  1  2  1 -2 -3 -1  0  0  0 -8
-T  1 -1  0  0 -2 -1  0  0 -1  0 -2  0 -1 -3  0  1  3 -5 -3  0  0 -1  0 -8
-W -6  2 -4 -7 -8 -5 -7 -7 -3 -5 -2 -3 -4  0 -6 -2 -5 17  0 -6 -5 -6 -4 -8
-Y -3 -4 -2 -4  0 -4 -4 -5  0 -1 -1 -4 -2  7 -5 -3 -3  0 10 -2 -3 -4 -2 -8
-V  0 -2 -2 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -6 -2  4 -2 -2 -1 -8
-B  0 -1  2  3 -4  1  3  0  1 -2 -3  1 -2 -4 -1  0  0 -5 -3 -2  3  2 -1 -8
-Z  0  0  1  3 -5  3  3  0  2 -2 -3  0 -2 -5  0  0 -1 -6 -4 -2  2  3 -1 -8
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -1 -1 -1 -2 -1  0  0 -4 -2 -1 -1 -1 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM260 b/Butterfly/src/src/jaligner/matrix/matrices/PAM260
deleted file mode 100644
index 5098eb4..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM260
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 260 substitution matrix, scale = ln(2)/3 = 0.231049
-#
-# Expected score = -0.794, Entropy = 0.330 bits
-#
-# Lowest score = -7, Highest score = 17
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -1  0  0 -2  0  0  1 -1  0 -2 -1 -1 -3  1  1  1 -6 -3  0  0  0  0 -7
-R -1  6  0 -1 -4  1 -1 -2  2 -2 -3  3  0 -4  0  0 -1  2 -4 -2 -1  0 -1 -7
-N  0  0  2  2 -3  1  1  0  2 -2 -3  1 -2 -3  0  1  0 -4 -2 -2  2  1  0 -7
-D  0 -1  2  4 -5  2  3  1  1 -2 -4  0 -2 -5 -1  0  0 -6 -4 -2  3  3 -1 -7
-C -2 -4 -3 -5 12 -5 -5 -3 -3 -2 -6 -5 -5 -4 -3  0 -2 -7  0 -2 -4 -5 -3 -7
-Q  0  1  1  2 -5  4  2 -1  3 -2 -2  1 -1 -4  0  0 -1 -5 -4 -2  1  3  0 -7
-E  0 -1  1  3 -5  2  4  0  1 -2 -3  0 -2 -5  0  0  0 -7 -4 -2  3  3 -1 -7
-G  1 -2  0  1 -3 -1  0  5 -2 -2 -4 -2 -3 -5  0  1  0 -7 -5 -1  1  0 -1 -7
-H -1  2  2  1 -3  3  1 -2  6 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2 -1 -7
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  2 -2  2  1 -2 -1  0 -5 -1  4 -2 -2 -1 -7
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  2  6 -3  4  2 -2 -3 -2 -2 -1  2 -3 -2 -1 -7
-K -1  3  1  0 -5  1  0 -2  0 -2 -3  4  0 -5 -1  0  0 -3 -4 -2  1  0 -1 -7
-M -1  0 -2 -2 -5 -1 -2 -3 -2  2  4  0  6  0 -2 -1 -1 -4 -2  2 -2 -2 -1 -7
-F -3 -4 -3 -5 -4 -4 -5 -5 -2  1  2 -5  0  9 -4 -3 -3  0  7 -1 -4 -5 -2 -7
-P  1  0  0 -1 -3  0  0  0  0 -2 -2 -1 -2 -4  6  1  0 -5 -5 -1 -1  0 -1 -7
-S  1  0  1  0  0  0  0  1 -1 -1 -3  0 -1 -3  1  1  1 -2 -3 -1  0  0  0 -7
-T  1 -1  0  0 -2 -1  0  0 -1  0 -2  0 -1 -3  0  1  2 -5 -3  0  0  0  0 -7
-W -6  2 -4 -6 -7 -5 -7 -7 -3 -5 -2 -3 -4  0 -5 -2 -5 17  0 -6 -5 -6 -4 -7
-Y -3 -4 -2 -4  0 -4 -4 -5  0 -1 -1 -4 -2  7 -5 -3 -3  0 10 -2 -3 -4 -2 -7
-V  0 -2 -2 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -6 -2  4 -2 -2 -1 -7
-B  0 -1  2  3 -4  1  3  1  1 -2 -3  1 -2 -4 -1  0  0 -5 -3 -2  3  2  0 -7
-Z  0  0  1  3 -5  3  3  0  2 -2 -2  0 -2 -5  0  0  0 -6 -4 -2  2  3 -1 -7
-X  0 -1  0 -1 -3  0 -1 -1 -1 -1 -1 -1 -1 -2 -1  0  0 -4 -2 -1  0 -1 -1 -7
-* -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7 -7  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM270 b/Butterfly/src/src/jaligner/matrix/matrices/PAM270
deleted file mode 100644
index 322fcdb..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM270
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 270 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.969, Entropy = 0.309 bits
-#
-# Lowest score = -10, Highest score = 23
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   2  -2   0   0  -2   0   0   2  -2  -1  -2  -1  -1  -4   1   1   1  -7  -4   0   0   0   0 -10
-R  -2   8   0  -1  -5   2  -1  -3   2  -2  -4   4  -1  -5   0   0  -1   3  -5  -3  -1   0  -1 -10
-N   0   0   2   2  -4   1   2   1   2  -2  -3   1  -2  -4   0   1   1  -5  -3  -2   2   2   0 -10
-D   0  -1   2   5  -6   2   4   1   1  -3  -5   0  -3  -7  -1   0   0  -8  -5  -3   4   3  -1 -10
-C  -2  -5  -4  -6  16  -7  -6  -4  -4  -3  -7  -7  -6  -5  -3   0  -3 -10   1  -2  -5  -7  -4 -10
-Q   0   2   1   2  -7   5   3  -1   4  -2  -2   1  -1  -6   0  -1  -1  -6  -5  -2   2   4  -1 -10
-E   0  -1   2   4  -6   3   5   0   1  -2  -4   0  -3  -7  -1   0   0  -9  -5  -2   3   4  -1 -10
-G   2  -3   1   1  -4  -1   0   6  -2  -3  -5  -2  -3  -6   0   1   0  -9  -6  -2   1   0  -1 -10
-H  -2   2   2   1  -4   4   1  -2   8  -3  -3   0  -3  -2   0  -1  -1  -3   0  -3   1   2  -1 -10
-I  -1  -2  -2  -3  -3  -2  -2  -3  -3   5   3  -2   3   1  -2  -2   0  -6  -1   5  -3  -2  -1 -10
-L  -2  -4  -3  -5  -7  -2  -4  -5  -3   3   8  -3   5   2  -3  -3  -2  -2  -1   2  -4  -3  -2 -10
-K  -1   4   1   0  -7   1   0  -2   0  -2  -3   6   0  -6  -1   0   0  -4  -5  -3   1   0  -1 -10
-M  -1  -1  -2  -3  -6  -1  -3  -3  -3   3   5   0   8   0  -2  -2  -1  -5  -3   2  -3  -2  -1 -10
-F  -4  -5  -4  -7  -5  -6  -7  -6  -2   1   2  -6   0  12  -6  -4  -4   1   9  -1  -6  -6  -3 -10
-P   1   0   0  -1  -3   0  -1   0   0  -2  -3  -1  -2  -6   7   1   0  -7  -6  -1  -1   0  -1 -10
-S   1   0   1   0   0  -1   0   1  -1  -2  -3   0  -2  -4   1   2   2  -3  -4  -1   1   0   0 -10
-T   1  -1   1   0  -3  -1   0   0  -1   0  -2   0  -1  -4   0   2   3  -6  -3   0   0  -1   0 -10
-W  -7   3  -5  -8 -10  -6  -9  -9  -3  -6  -2  -4  -5   1  -7  -3  -6  23   0  -8  -7  -7  -5 -10
-Y  -4  -5  -3  -5   1  -5  -5  -6   0  -1  -1  -5  -3   9  -6  -4  -3   0  13  -3  -4  -5  -3 -10
-V   0  -3  -2  -3  -2  -2  -2  -2  -3   5   2  -3   2  -1  -1  -1   0  -8  -3   5  -2  -2  -1 -10
-B   0  -1   2   4  -5   2   3   1   1  -3  -4   1  -3  -6  -1   1   0  -7  -4  -2   3   3  -1 -10
-Z   0   0   2   3  -7   4   4   0   2  -2  -3   0  -2  -6   0   0  -1  -7  -5  -2   3   4  -1 -10
-X   0  -1   0  -1  -4  -1  -1  -1  -1  -1  -2  -1  -1  -3  -1   0   0  -5  -3  -1  -1  -1  -1 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM280 b/Butterfly/src/src/jaligner/matrix/matrices/PAM280
deleted file mode 100644
index 2b09bca..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM280
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 280 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.916, Entropy = 0.289 bits
-#
-# Lowest score = -9, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2  0  0  2 -1 -1 -2 -1 -1 -4  1  1  1 -7 -4  0  0  0  0 -9
-R -2  7  0 -1 -4  2 -1 -3  2 -2 -3  4  0 -5  0  0 -1  3 -5 -3 -1  0 -1 -9
-N  0  0  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  1 -5 -3 -2  2  1  0 -9
-D  0 -1  2  4 -6  2  4  1  1 -3 -5  0 -3 -7 -1  0  0 -8 -5 -2  4  3 -1 -9
-C -2 -4 -4 -6 15 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -3 -9  1 -2 -5 -6 -3 -9
-Q  0  2  1  2 -6  4  3 -1  3 -2 -2  1 -1 -5  0  0 -1 -6 -5 -2  2  4 -1 -9
-E  0 -1  2  4 -6  3  4  0  1 -2 -4  0 -2 -6  0  0  0 -8 -5 -2  3  4 -1 -9
-G  2 -3  1  1 -4 -1  0  6 -2 -3 -5 -2 -3 -6  0  1  0 -8 -6 -1  1  0 -1 -9
-H -1  2  2  1 -4  3  1 -2  8 -3 -2  0 -2 -2  0 -1 -1 -3  0 -3  1  2 -1 -9
-I -1 -2 -2 -3 -3 -2 -2 -3 -3  5  3 -2  3  1 -2 -2  0 -6 -1  4 -2 -2 -1 -9
-L -2 -3 -3 -5 -7 -2 -4 -5 -2  3  7 -3  5  2 -3 -3 -2 -2 -1  2 -4 -3 -1 -9
-K -1  4  1  0 -6  1  0 -2  0 -2 -3  6  0 -6 -1  0  0 -4 -5 -3  1  1 -1 -9
-M -1  0 -2 -3 -6 -1 -2 -3 -2  3  5  0  7  0 -2 -2 -1 -5 -3  2 -2 -2 -1 -9
-F -4 -5 -4 -7 -5 -5 -6 -6 -2  1  2 -6  0 11 -5 -4 -4  1  9 -1 -5 -6 -3 -9
-P  1  0  0 -1 -3  0  0  0  0 -2 -3 -1 -2 -5  7  1  1 -7 -6 -1 -1  0 -1 -9
-S  1  0  1  0  0  0  0  1 -1 -2 -3  0 -2 -4  1  2  1 -3 -3 -1  1  0  0 -9
-T  1 -1  1  0 -3 -1  0  0 -1  0 -2  0 -1 -4  1  1  3 -6 -3  0  0  0  0 -9
-W -7  3 -5 -8 -9 -6 -8 -8 -3 -6 -2 -4 -5  1 -7 -3 -6 22  0 -7 -6 -7 -5 -9
-Y -4 -5 -3 -5  1 -5 -5 -6  0 -1 -1 -5 -3  9 -6 -3 -3  0 13 -3 -4 -5 -3 -9
-V  0 -3 -2 -2 -2 -2 -2 -1 -3  4  2 -3  2 -1 -1 -1  0 -7 -3  5 -2 -2 -1 -9
-B  0 -1  2  4 -5  2  3  1  1 -2 -4  1 -2 -5 -1  1  0 -6 -4 -2  3  2 -1 -9
-Z  0  0  1  3 -6  4  4  0  2 -2 -3  1 -2 -6  0  0  0 -7 -5 -2  2  4 -1 -9
-X  0 -1  0 -1 -3 -1 -1 -1 -1 -1 -1 -1 -1 -3 -1  0  0 -5 -3 -1 -1 -1 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM290 b/Butterfly/src/src/jaligner/matrix/matrices/PAM290
deleted file mode 100644
index 6852c6a..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM290
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 290 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.877, Entropy = 0.271 bits
-#
-# Lowest score = -9, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -2  0  0 -2  0  0  2 -1 -1 -2 -1 -1 -4  1  1  1 -7 -4  0  0  0  0 -9
-R -2  7  0 -1 -4  2 -1 -3  2 -2 -3  4  0 -5  0  0 -1  3 -5 -3  0  0 -1 -9
-N  0  0  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  1 -5 -3 -2  2  1  0 -9
-D  0 -1  2  4 -6  2  4  1  1 -3 -4  0 -3 -6 -1  0  0 -8 -5 -2  3  3 -1 -9
-C -2 -4 -4 -6 15 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -2 -9  1 -2 -5 -6 -3 -9
-Q  0  2  1  2 -6  4  3 -1  3 -2 -2  1 -1 -5  0  0 -1 -5 -5 -2  2  3  0 -9
-E  0 -1  2  4 -6  3  4  0  1 -2 -4  0 -2 -6  0  0  0 -8 -5 -2  3  4 -1 -9
-G  2 -3  1  1 -4 -1  0  5 -2 -3 -4 -2 -3 -6  0  1  0 -8 -6 -1  1  0 -1 -9
-H -1  2  2  1 -4  3  1 -2  7 -3 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2 -1 -9
-I -1 -2 -2 -3 -3 -2 -2 -3 -3  5  3 -2  3  1 -2 -1  0 -6 -1  4 -2 -2 -1 -9
-L -2 -3 -3 -4 -7 -2 -4 -4 -2  3  7 -3  5  3 -3 -3 -2 -2 -1  2 -4 -3 -1 -9
-K -1  4  1  0 -6  1  0 -2  0 -2 -3  5  0 -6 -1  0  0 -4 -5 -3  1  1 -1 -9
-M -1  0 -2 -3 -6 -1 -2 -3 -2  3  5  0  7  0 -2 -2 -1 -5 -2  2 -2 -2 -1 -9
-F -4 -5 -4 -6 -5 -5 -6 -6 -2  1  3 -6  0 11 -5 -4 -3  1  9 -1 -5 -6 -3 -9
-P  1  0  0 -1 -3  0  0  0  0 -2 -3 -1 -2 -5  7  1  1 -6 -6 -1 -1  0 -1 -9
-S  1  0  1  0  0  0  0  1 -1 -1 -3  0 -2 -4  1  2  1 -3 -3 -1  1  0  0 -9
-T  1 -1  1  0 -2 -1  0  0 -1  0 -2  0 -1 -3  1  1  3 -6 -3  0  0  0  0 -9
-W -7  3 -5 -8 -9 -5 -8 -8 -3 -6 -2 -4 -5  1 -6 -3 -6 22  0 -7 -6 -7 -5 -9
-Y -4 -5 -3 -5  1 -5 -5 -6  0 -1 -1 -5 -2  9 -6 -3 -3  0 13 -3 -4 -5 -2 -9
-V  0 -3 -2 -2 -2 -2 -2 -1 -2  4  2 -3  2 -1 -1 -1  0 -7 -3  5 -2 -2 -1 -9
-B  0  0  2  3 -5  2  3  1  1 -2 -4  1 -2 -5 -1  1  0 -6 -4 -2  3  2  0 -9
-Z  0  0  1  3 -6  3  4  0  2 -2 -3  1 -2 -6  0  0  0 -7 -5 -2  2  4 -1 -9
-X  0 -1  0 -1 -3  0 -1 -1 -1 -1 -1 -1 -1 -3 -1  0  0 -5 -2 -1  0 -1 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM30 b/Butterfly/src/src/jaligner/matrix/matrices/PAM30
deleted file mode 100644
index 8a01c88..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM30
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 30 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -5.06, Entropy = 2.57 bits
-#
-# Lowest score = -17, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   6  -7  -4  -3  -6  -4  -2  -2  -7  -5  -6  -7  -5  -8  -2   0  -1 -13  -8  -2  -3  -3  -3 -17
-R  -7   8  -6 -10  -8  -2  -9  -9  -2  -5  -8   0  -4  -9  -4  -3  -6  -2 -10  -8  -7  -4  -6 -17
-N  -4  -6   8   2 -11  -3  -2  -3   0  -5  -7  -1  -9  -9  -6   0  -2  -8  -4  -8   6  -3  -3 -17
-D  -3 -10   2   8 -14  -2   2  -3  -4  -7 -12  -4 -11 -15  -8  -4  -5 -15 -11  -8   6   1  -5 -17
-C  -6  -8 -11 -14  10 -14 -14  -9  -7  -6 -15 -14 -13 -13  -8  -3  -8 -15  -4  -6 -12 -14  -9 -17
-Q  -4  -2  -3  -2 -14   8   1  -7   1  -8  -5  -3  -4 -13  -3  -5  -5 -13 -12  -7  -3   6  -5 -17
-E  -2  -9  -2   2 -14   1   8  -4  -5  -5  -9  -4  -7 -14  -5  -4  -6 -17  -8  -6   1   6  -5 -17
-G  -2  -9  -3  -3  -9  -7  -4   6  -9 -11 -10  -7  -8  -9  -6  -2  -6 -15 -14  -5  -3  -5  -5 -17
-H  -7  -2   0  -4  -7   1  -5  -9   9  -9  -6  -6 -10  -6  -4  -6  -7  -7  -3  -6  -1  -1  -5 -17
-I  -5  -5  -5  -7  -6  -8  -5 -11  -9   8  -1  -6  -1  -2  -8  -7  -2 -14  -6   2  -6  -6  -5 -17
-L  -6  -8  -7 -12 -15  -5  -9 -10  -6  -1   7  -8   1  -3  -7  -8  -7  -6  -7  -2  -9  -7  -6 -17
-K  -7   0  -1  -4 -14  -3  -4  -7  -6  -6  -8   7  -2 -14  -6  -4  -3 -12  -9  -9  -2  -4  -5 -17
-M  -5  -4  -9 -11 -13  -4  -7  -8 -10  -1   1  -2  11  -4  -8  -5  -4 -13 -11  -1 -10  -5  -5 -17
-F  -8  -9  -9 -15 -13 -13 -14  -9  -6  -2  -3 -14  -4   9 -10  -6  -9  -4   2  -8 -10 -13  -8 -17
-P  -2  -4  -6  -8  -8  -3  -5  -6  -4  -8  -7  -6  -8 -10   8  -2  -4 -14 -13  -6  -7  -4  -5 -17
-S   0  -3   0  -4  -3  -5  -4  -2  -6  -7  -8  -4  -5  -6  -2   6   0  -5  -7  -6  -1  -5  -3 -17
-T  -1  -6  -2  -5  -8  -5  -6  -6  -7  -2  -7  -3  -4  -9  -4   0   7 -13  -6  -3  -3  -6  -4 -17
-W -13  -2  -8 -15 -15 -13 -17 -15  -7 -14  -6 -12 -13  -4 -14  -5 -13  13  -5 -15 -10 -14 -11 -17
-Y  -8 -10  -4 -11  -4 -12  -8 -14  -3  -6  -7  -9 -11   2 -13  -7  -6  -5  10  -7  -6  -9  -7 -17
-V  -2  -8  -8  -8  -6  -7  -6  -5  -6   2  -2  -9  -1  -8  -6  -6  -3 -15  -7   7  -8  -6  -5 -17
-B  -3  -7   6   6 -12  -3   1  -3  -1  -6  -9  -2 -10 -10  -7  -1  -3 -10  -6  -8   6   0  -5 -17
-Z  -3  -4  -3   1 -14   6   6  -5  -1  -6  -7  -4  -5 -13  -4  -5  -6 -14  -9  -6   0   6  -5 -17
-X  -3  -6  -3  -5  -9  -5  -5  -5  -5  -5  -6  -5  -5  -8  -5  -3  -4 -11  -7  -5  -5  -5  -5 -17
-* -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17 -17   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM300 b/Butterfly/src/src/jaligner/matrix/matrices/PAM300
deleted file mode 100644
index 5d1a5a8..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM300
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 300 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.835, Entropy = 0.254 bits
-#
-# Lowest score = -9, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -1  0  0 -2  0  0  2 -1  0 -2 -1 -1 -4  1  1  1 -6 -4  0  0  0  0 -9
-R -1  7  0 -1 -4  2 -1 -2  2 -2 -3  4  0 -5  0  0 -1  3 -5 -3  0  0 -1 -9
-N  0  0  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  0 -5 -2 -2  2  1  0 -9
-D  0 -1  2  4 -6  2  4  1  1 -2 -4  0 -3 -6 -1  0  0 -7 -5 -2  3  3 -1 -9
-C -2 -4 -4 -6 15 -6 -6 -4 -4 -3 -7 -6 -6 -5 -3  0 -2 -9  1 -2 -5 -6 -3 -9
-Q  0  2  1  2 -6  4  3 -1  3 -2 -2  1 -1 -5  0  0 -1 -5 -4 -2  2  3  0 -9
-E  0 -1  2  4 -6  3  4  0  1 -2 -4  0 -2 -6  0  0  0 -8 -5 -2  3  3 -1 -9
-G  2 -2  1  1 -4 -1  0  5 -2 -3 -4 -2 -3 -5  0  1  0 -8 -6 -1  1  0 -1 -9
-H -1  2  2  1 -4  3  1 -2  7 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -3 -2 -2 -3 -2  5  3 -2  3  1 -2 -1  0 -6 -1  4 -2 -2 -1 -9
-L -2 -3 -3 -4 -7 -2 -4 -4 -2  3  7 -3  4  3 -3 -3 -2 -2  0  2 -4 -3 -1 -9
-K -1  4  1  0 -6  1  0 -2  0 -2 -3  5  0 -6 -1  0  0 -4 -5 -2  1  1 -1 -9
-M -1  0 -2 -3 -6 -1 -2 -3 -2  3  4  0  6  1 -2 -2 -1 -5 -2  2 -2 -2 -1 -9
-F -4 -5 -4 -6 -5 -5 -6 -5 -2  1  3 -6  1 11 -5 -4 -3  1  9 -1 -5 -5 -2 -9
-P  1  0  0 -1 -3  0  0  0  0 -2 -3 -1 -2 -5  6  1  1 -6 -5 -1  0  0 -1 -9
-S  1  0  1  0  0  0  0  1 -1 -1 -3  0 -2 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1 -1  0  0 -2 -1  0  0 -1  0 -2  0 -1 -3  1  1  2 -6 -3  0  0  0  0 -9
-W -6  3 -5 -7 -9 -5 -8 -8 -3 -6 -2 -4 -5  1 -6 -3 -6 22  0 -7 -6 -6 -4 -9
-Y -4 -5 -2 -5  1 -4 -5 -6  0 -1  0 -5 -2  9 -5 -3 -3  0 12 -3 -4 -5 -2 -9
-V  0 -3 -2 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -7 -3  5 -2 -2  0 -9
-B  0  0  2  3 -5  2  3  1  1 -2 -4  1 -2 -5  0  1  0 -6 -4 -2  3  2  0 -9
-Z  0  0  1  3 -6  3  3  0  2 -2 -3  1 -2 -5  0  0  0 -6 -5 -2  2  3 -1 -9
-X  0 -1  0 -1 -3  0 -1 -1  0 -1 -1 -1 -1 -2 -1  0  0 -4 -2  0  0 -1 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM310 b/Butterfly/src/src/jaligner/matrix/matrices/PAM310
deleted file mode 100644
index cd0e5b0..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM310
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 310 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.779, Entropy = 0.238 bits
-#
-# Lowest score = -9, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  2 -1  0  0 -2  0  0  1 -1  0 -2 -1 -1 -4  1  1  1 -6 -4  0  0  0  0 -9
-R -1  6  0 -1 -4  1 -1 -2  2 -2 -3  4  0 -5  0  0 -1  3 -4 -2  0  0 -1 -9
-N  0  0  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  0 -4 -2 -2  2  1  0 -9
-D  0 -1  2  4 -5  2  4  1  1 -2 -4  0 -2 -6 -1  0  0 -7 -5 -2  3  3 -1 -9
-C -2 -4 -4 -5 15 -6 -6 -3 -4 -2 -6 -6 -6 -4 -3  0 -2 -9  1 -2 -5 -6 -3 -9
-Q  0  1  1  2 -6  4  3 -1  3 -2 -2  1 -1 -5  0  0 -1 -5 -4 -2  2  3  0 -9
-E  0 -1  2  4 -6  3  4  1  1 -2 -3  0 -2 -6  0  0  0 -7 -5 -2  3  3 -1 -9
-G  1 -2  1  1 -3 -1  1  5 -2 -2 -4 -1 -3 -5  0  1  0 -8 -6 -1  1  0 -1 -9
-H -1  2  2  1 -4  3  1 -2  7 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  3  1 -2 -1  0 -5 -1  4 -2 -2 -1 -9
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  7 -3  4  3 -3 -3 -2 -2  0  2 -3 -3 -1 -9
-K -1  4  1  0 -6  1  0 -1  0 -2 -3  5  0 -5 -1  0  0 -3 -5 -2  1  1 -1 -9
-M -1  0 -2 -2 -6 -1 -2 -3 -2  3  4  0  6  1 -2 -2 -1 -4 -2  2 -2 -2 -1 -9
-F -4 -5 -4 -6 -4 -5 -6 -5 -2  1  3 -5  1 11 -5 -4 -3  1  9 -1 -5 -5 -2 -9
-P  1  0  0 -1 -3  0  0  0  0 -2 -3 -1 -2 -5  6  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  0  0  0  0  1 -1 -1 -3  0 -2 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1 -1  0  0 -2 -1  0  0 -1  0 -2  0 -1 -3  1  1  2 -6 -3  0  0  0  0 -9
-W -6  3 -4 -7 -9 -5 -7 -8 -3 -5 -2 -3 -4  1 -6 -3 -6 22  0 -7 -6 -6 -4 -9
-Y -4 -4 -2 -5  1 -4 -5 -6  0 -1  0 -5 -2  9 -5 -3 -3  0 12 -2 -4 -4 -2 -9
-V  0 -2 -2 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -7 -2  4 -2 -2  0 -9
-B  0  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -2  3  2  0 -9
-Z  0  0  1  3 -6  3  3  0  2 -2 -3  1 -2 -5  0  0  0 -6 -4 -2  2  3  0 -9
-X  0 -1  0 -1 -3  0 -1 -1  0 -1 -1 -1 -1 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM320 b/Butterfly/src/src/jaligner/matrix/matrices/PAM320
deleted file mode 100644
index d7fbbd2..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM320
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 320 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.741, Entropy = 0.224 bits
-#
-# Lowest score = -8, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  0  1 -1  0 -2 -1 -1 -4  1  1  1 -6 -4  0  0  0  0 -8
-R -1  6  0 -1 -4  1 -1 -2  2 -2 -3  4  0 -5  0  0 -1  3 -4 -2  0  0 -1 -8
-N  0  0  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  0 -4 -2 -2  2  1  0 -8
-D  1 -1  2  4 -5  2  3  1  1 -2 -4  0 -2 -6  0  0  0 -7 -5 -2  3  3 -1 -8
-C -2 -4 -4 -5 15 -5 -5 -3 -4 -2 -6 -6 -5 -4 -3  0 -2 -8  1 -2 -4 -5 -3 -8
-Q  0  1  1  2 -5  4  2 -1  3 -2 -2  1 -1 -5  0  0  0 -5 -4 -2  2  3  0 -8
-E  0 -1  2  3 -5  2  4  1  1 -2 -3  0 -2 -5  0  0  0 -7 -5 -2  3  3  0 -8
-G  1 -2  1  1 -3 -1  1  5 -2 -2 -4 -1 -3 -5  0  1  0 -7 -5 -1  1  0 -1 -8
-H -1  2  2  1 -4  3  1 -2  6 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2  0 -8
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  2  1 -2 -1  0 -5 -1  4 -2 -2  0 -8
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  7 -3  4  3 -2 -3 -2 -2  0  2 -3 -3 -1 -8
-K -1  4  1  0 -6  1  0 -1  0 -2 -3  5  0 -5 -1  0  0 -3 -5 -2  1  1 -1 -8
-M -1  0 -2 -2 -5 -1 -2 -3 -2  2  4  0  6  1 -2 -1 -1 -4 -2  2 -2 -2  0 -8
-F -4 -5 -4 -6 -4 -5 -5 -5 -2  1  3 -5  1 11 -5 -3 -3  1  9 -1 -5 -5 -2 -8
-P  1  0  0  0 -3  0  0  0  0 -2 -2 -1 -2 -5  6  1  1 -6 -5 -1  0  0  0 -8
-S  1  0  1  0  0  0  0  1 -1 -1 -3  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -8
-T  1 -1  0  0 -2  0  0  0 -1  0 -2  0 -1 -3  1  1  2 -5 -3  0  0  0  0 -8
-W -6  3 -4 -7 -8 -5 -7 -7 -3 -5 -2 -3 -4  1 -6 -3 -5 22  1 -6 -6 -6 -4 -8
-Y -4 -4 -2 -5  1 -4 -5 -5  0 -1  0 -5 -2  9 -5 -3 -3  1 12 -2 -3 -4 -2 -8
-V  0 -2 -2 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -6 -2  4 -2 -2  0 -8
-B  0  0  2  3 -4  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -6 -3 -2  2  2  0 -8
-Z  0  0  1  3 -5  3  3  0  2 -2 -3  1 -2 -5  0  0  0 -6 -4 -2  2  3  0 -8
-X  0 -1  0 -1 -3  0  0 -1  0  0 -1 -1  0 -2  0  0  0 -4 -2  0  0  0 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM330 b/Butterfly/src/src/jaligner/matrix/matrices/PAM330
deleted file mode 100644
index 77db35e..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM330
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 330 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.693, Entropy = 0.210 bits
-#
-# Lowest score = -8, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  0  1 -1  0 -2 -1 -1 -3  1  1  1 -6 -3  0  0  0  0 -8
-R -1  6  0 -1 -4  1 -1 -2  2 -2 -3  4  0 -4  0  0 -1  3 -4 -2  0  0 -1 -8
-N  0  0  2  2 -4  1  2  1  1 -2 -3  1 -1 -3  0  1  0 -4 -2 -1  2  1  0 -8
-D  1 -1  2  3 -5  2  3  1  1 -2 -4  0 -2 -5  0  0  0 -7 -4 -2  3  3  0 -8
-C -2 -4 -4 -5 15 -5 -5 -3 -3 -2 -6 -5 -5 -4 -3  0 -2 -8  1 -2 -4 -5 -3 -8
-Q  0  1  1  2 -5  3  2 -1  3 -2 -2  1 -1 -4  0  0  0 -5 -4 -2  1  3  0 -8
-E  0 -1  2  3 -5  2  3  1  1 -2 -3  0 -2 -5  0  0  0 -7 -4 -2  2  3  0 -8
-G  1 -2  1  1 -3 -1  1  5 -2 -2 -4 -1 -2 -5  0  1  0 -7 -5 -1  1  0 -1 -8
-H -1  2  1  1 -3  3  1 -2  6 -2 -2  0 -2 -2  0 -1 -1 -3  0 -2  1  2  0 -8
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  2  1 -2 -1  0 -5  0  4 -2 -2  0 -8
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  6 -3  4  3 -2 -3 -1 -2  0  2 -3 -2 -1 -8
-K -1  4  1  0 -5  1  0 -1  0 -2 -3  5  0 -5 -1  0  0 -3 -4 -2  1  1 -1 -8
-M -1  0 -1 -2 -5 -1 -2 -2 -2  2  4  0  5  1 -2 -1  0 -4 -2  2 -2 -1  0 -8
-F -3 -4 -3 -5 -4 -4 -5 -5 -2  1  3 -5  1 10 -5 -3 -3  1  9 -1 -4 -5 -2 -8
-P  1  0  0  0 -3  0  0  0  0 -2 -2 -1 -2 -5  6  1  1 -6 -5 -1  0  0  0 -8
-S  1  0  1  0  0  0  0  1 -1 -1 -3  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -8
-T  1 -1  0  0 -2  0  0  0 -1  0 -1  0  0 -3  1  1  2 -5 -3  0  0  0  0 -8
-W -6  3 -4 -7 -8 -5 -7 -7 -3 -5 -2 -3 -4  1 -6 -3 -5 22  1 -6 -5 -6 -4 -8
-Y -3 -4 -2 -4  1 -4 -4 -5  0  0  0 -4 -2  9 -5 -3 -3  1 12 -2 -3 -4 -2 -8
-V  0 -2 -1 -2 -2 -2 -2 -1 -2  4  2 -2  2 -1 -1 -1  0 -6 -2  4 -2 -2  0 -8
-B  0  0  2  3 -4  1  2  1  1 -2 -3  1 -2 -4  0  1  0 -5 -3 -2  2  2  0 -8
-Z  0  0  1  3 -5  3  3  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -2  2  3  0 -8
-X  0 -1  0  0 -3  0  0 -1  0  0 -1 -1  0 -2  0  0  0 -4 -2  0  0  0 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM340 b/Butterfly/src/src/jaligner/matrix/matrices/PAM340
deleted file mode 100644
index 02c8540..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM340
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 340 substitution matrix, scale = ln(2)/4 = 0.173287
-#
-# Expected score = -0.680, Entropy = 0.198 bits
-#
-# Lowest score = -8, Highest score = 22
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  0  1 -1  0 -2 -1 -1 -3  1  1  1 -6 -3  0  0  0  0 -8
-R -1  6  0 -1 -4  1  0 -2  2 -2 -3  4  0 -4  0  0  0  3 -4 -2  0  0 -1 -8
-N  0  0  1  2 -3  1  1  1  1 -2 -3  1 -1 -3  0  1  0 -4 -2 -1  2  1  0 -8
-D  1 -1  2  3 -5  2  3  1  1 -2 -4  0 -2 -5  0  0  0 -7 -4 -2  3  3  0 -8
-C -2 -4 -3 -5 15 -5 -5 -3 -3 -2 -6 -5 -5 -4 -3  0 -2 -8  1 -2 -4 -5 -3 -8
-Q  0  1  1  2 -5  3  2 -1  3 -2 -2  1 -1 -4  0  0  0 -5 -4 -2  1  3  0 -8
-E  0  0  1  3 -5  2  3  1  1 -2 -3  0 -2 -5  0  0  0 -7 -4 -1  2  3  0 -8
-G  1 -2  1  1 -3 -1  1  4 -2 -2 -4 -1 -2 -5  0  1  0 -7 -5 -1  1  0 -1 -8
-H -1  2  1  1 -3  3  1 -2  6 -2 -2  0 -2 -2  0  0 -1 -2  0 -2  1  2  0 -8
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  2  1 -2 -1  0 -5  0  3 -2 -2  0 -8
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  6 -3  4  3 -2 -2 -1 -2  0  2 -3 -2 -1 -8
-K -1  4  1  0 -5  1  0 -1  0 -2 -3  4  0 -5 -1  0  0 -3 -4 -2  1  1  0 -8
-M -1  0 -1 -2 -5 -1 -2 -2 -2  2  4  0  5  1 -2 -1  0 -4 -2  2 -2 -1  0 -8
-F -3 -4 -3 -5 -4 -4 -5 -5 -2  1  3 -5  1 10 -4 -3 -3  1  9 -1 -4 -5 -2 -8
-P  1  0  0  0 -3  0  0  0  0 -2 -2 -1 -2 -4  5  1  1 -5 -5 -1  0  0  0 -8
-S  1  0  1  0  0  0  0  1  0 -1 -2  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -8
-T  1  0  0  0 -2  0  0  0 -1  0 -1  0  0 -3  1  1  2 -5 -3  0  0  0  0 -8
-W -6  3 -4 -7 -8 -5 -7 -7 -2 -5 -2 -3 -4  1 -5 -3 -5 22  1 -6 -5 -6 -4 -8
-Y -3 -4 -2 -4  1 -4 -4 -5  0  0  0 -4 -2  9 -5 -3 -3  1 12 -2 -3 -4 -2 -8
-V  0 -2 -1 -2 -2 -2 -1 -1 -2  3  2 -2  2 -1 -1 -1  0 -6 -2  4 -2 -2  0 -8
-B  0  0  2  3 -4  1  2  1  1 -2 -3  1 -2 -4  0  1  0 -5 -3 -2  2  2  0 -8
-Z  0  0  1  3 -5  3  3  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -2  2  3  0 -8
-X  0 -1  0  0 -3  0  0 -1  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM350 b/Butterfly/src/src/jaligner/matrix/matrices/PAM350
deleted file mode 100644
index 140a6f2..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM350
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 350 substitution matrix, scale = ln(2)/5 = 0.138629
-#
-# Expected score = -0.701, Entropy = 0.186 bits
-#
-# Lowest score = -10, Highest score = 27
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   2  -1   0   1  -2   0   1   2  -1   0  -2  -1  -1  -4   1   1   1  -7  -4   0   1   0   0 -10
-R  -1   7   1  -1  -4   2   0  -2   2  -2  -3   4   0  -5   0   0  -1   4  -5  -3   0   1  -1 -10
-N   0   1   2   2  -4   1   2   1   2  -2  -3   1  -2  -4   0   1   1  -5  -3  -2   2   2   0 -10
-D   1  -1   2   4  -6   2   4   1   1  -2  -4   1  -3  -6   0   1   0  -8  -5  -2   3   3  -1 -10
-C  -2  -4  -4  -6  18  -6  -6  -4  -4  -3  -7  -6  -6  -5  -3   0  -2 -10   1  -2  -5  -6  -3 -10
-Q   0   2   1   2  -6   4   3  -1   3  -2  -2   1  -1  -5   1   0   0  -5  -5  -2   2   3   0 -10
-E   1   0   2   4  -6   3   4   1   1  -2  -4   0  -2  -6   0   0   0  -8  -5  -2   3   3   0 -10
-G   2  -2   1   1  -4  -1   1   5  -2  -2  -4  -1  -3  -6   0   1   1  -8  -6  -1   1   0  -1 -10
-H  -1   2   2   1  -4   3   1  -2   7  -2  -2   1  -2  -2   0  -1  -1  -3   0  -2   1   2   0 -10
-I   0  -2  -2  -2  -3  -2  -2  -2  -2   5   4  -2   3   2  -2  -1   0  -6   0   4  -2  -2   0 -10
-L  -2  -3  -3  -4  -7  -2  -4  -4  -2   4   8  -3   5   3  -3  -3  -2  -2   0   3  -4  -3  -1 -10
-K  -1   4   1   1  -6   1   0  -1   1  -2  -3   5   0  -6  -1   0   0  -4  -5  -2   1   1  -1 -10
-M  -1   0  -2  -3  -6  -1  -2  -3  -2   3   5   0   6   1  -2  -2  -1  -5  -2   2  -2  -2   0 -10
-F  -4  -5  -4  -6  -5  -5  -6  -6  -2   2   3  -6   1  13  -5  -4  -3   1  11  -1  -5  -6  -2 -10
-P   1   0   0   0  -3   1   0   0   0  -2  -3  -1  -2  -5   6   1   1  -7  -6  -1   0   0   0 -10
-S   1   0   1   1   0   0   0   1  -1  -1  -3   0  -2  -4   1   1   1  -3  -3  -1   1   0   0 -10
-T   1  -1   1   0  -2   0   0   1  -1   0  -2   0  -1  -3   1   1   2  -6  -3   0   0   0   0 -10
-W  -7   4  -5  -8 -10  -5  -8  -8  -3  -6  -2  -4  -5   1  -7  -3  -6  27   1  -7  -6  -7  -5 -10
-Y  -4  -5  -3  -5   1  -5  -5  -6   0   0   0  -5  -2  11  -6  -3  -3   1  14  -2  -4  -5  -2 -10
-V   0  -3  -2  -2  -2  -2  -2  -1  -2   4   3  -2   2  -1  -1  -1   0  -7  -2   5  -2  -2   0 -10
-B   1   0   2   3  -5   2   3   1   1  -2  -4   1  -2  -5   0   1   0  -6  -4  -2   3   2   0 -10
-Z   0   1   2   3  -6   3   3   0   2  -2  -3   1  -2  -6   0   0   0  -7  -5  -2   2   3   0 -10
-X   0  -1   0  -1  -3   0   0  -1   0   0  -1  -1   0  -2   0   0   0  -5  -2   0   0   0  -1 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM360 b/Butterfly/src/src/jaligner/matrix/matrices/PAM360
deleted file mode 100644
index 5f6cd46..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM360
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 360 substitution matrix, scale = ln(2)/5 = 0.138629
-#
-# Expected score = -0.697, Entropy = 0.175 bits
-#
-# Lowest score = -9, Highest score = 27
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  2 -1  0 -2 -1 -1 -4  1  1  1 -7 -4  0  1  0  0 -9
-R -1  6  1 -1 -4  2  0 -2  2 -2 -3  4  0 -5  0  0  0  4 -5 -2  0  1 -1 -9
-N  0  1  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  1 -5 -3 -2  2  2  0 -9
-D  1 -1  2  4 -6  2  4  1  1 -2 -4  1 -2 -6  0  1  0 -8 -5 -2  3  3  0 -9
-C -2 -4 -4 -6 18 -6 -6 -4 -4 -3 -7 -6 -6 -4 -3  0 -2 -9  1 -2 -5 -6 -3 -9
-Q  0  2  1  2 -6  3  3 -1  3 -2 -2  1 -1 -5  1  0  0 -5 -4 -2  2  3  0 -9
-E  1  0  2  4 -6  3  4  1  1 -2 -3  0 -2 -6  0  0  0 -8 -5 -2  3  3  0 -9
-G  2 -2  1  1 -4 -1  1  5 -2 -2 -4 -1 -3 -6  0  1  1 -8 -6 -1  1  0 -1 -9
-H -1  2  2  1 -4  3  1 -2  7 -2 -2  1 -2 -2  0  0 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -3 -2 -2 -2 -2  4  3 -2  3  2 -2 -1  0 -6  0  4 -2 -2  0 -9
-L -2 -3 -3 -4 -7 -2 -3 -4 -2  3  7 -3  5  3 -3 -3 -2 -2  0  3 -4 -3 -1 -9
-K -1  4  1  1 -6  1  0 -1  1 -2 -3  5  0 -6 -1  0  0 -4 -5 -2  1  1 -1 -9
-M -1  0 -2 -2 -6 -1 -2 -3 -2  3  5  0  6  1 -2 -2 -1 -4 -2  2 -2 -2  0 -9
-F -4 -5 -4 -6 -4 -5 -6 -6 -2  2  3 -6  1 12 -5 -4 -3  2 11 -1 -5 -5 -2 -9
-P  1  0  0  0 -3  1  0  0  0 -2 -3 -1 -2 -5  6  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  0  1  0 -1 -3  0 -2 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  1  0 -2  0  0  1 -1  0 -2  0 -1 -3  1  1  2 -6 -3  0  0  0  0 -9
-W -7  4 -5 -8 -9 -5 -8 -8 -3 -6 -2 -4 -4  2 -6 -3 -6 27  1 -7 -6 -7 -4 -9
-Y -4 -5 -3 -5  1 -4 -5 -6  0  0  0 -5 -2 11 -5 -3 -3  1 14 -2 -4 -5 -2 -9
-V  0 -2 -2 -2 -2 -2 -2 -1 -2  4  3 -2  2 -1 -1 -1  0 -7 -2  4 -2 -2  0 -9
-B  1  0  2  3 -5  2  3  1  1 -2 -4  1 -2 -5  0  1  0 -6 -4 -2  2  2  0 -9
-Z  0  1  2  3 -6  3  3  0  2 -2 -3  1 -2 -5  0  0  0 -7 -5 -2  2  3  0 -9
-X  0 -1  0  0 -3  0  0 -1  0  0 -1 -1  0 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM370 b/Butterfly/src/src/jaligner/matrix/matrices/PAM370
deleted file mode 100644
index f72261f..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM370
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 370 substitution matrix, scale = ln(2)/5 = 0.138629
-#
-# Expected score = -0.649, Entropy = 0.165 bits
-#
-# Lowest score = -9, Highest score = 27
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  2 -1  0 -2 -1 -1 -4  1  1  1 -7 -4  0  1  0  0 -9
-R -1  6  1  0 -4  2  0 -2  2 -2 -3  4  0 -5  0  0  0  3 -4 -2  0  1 -1 -9
-N  0  1  2  2 -4  1  2  1  2 -2 -3  1 -2 -4  0  1  0 -5 -3 -1  2  1  0 -9
-D  1  0  2  4 -5  2  3  1  1 -2 -4  1 -2 -6  0  1  0 -7 -5 -2  3  3  0 -9
-C -2 -4 -4 -5 18 -6 -6 -3 -4 -2 -6 -6 -6 -4 -3  0 -2 -9  1 -2 -5 -6 -3 -9
-Q  0  2  1  2 -6  3  2 -1  3 -2 -2  1 -1 -5  1  0  0 -5 -4 -2  2  3  0 -9
-E  1  0  2  3 -6  2  3  1  1 -2 -3  1 -2 -6  0  0  0 -8 -5 -2  3  3  0 -9
-G  2 -2  1  1 -3 -1  1  5 -2 -2 -4 -1 -3 -5  0  1  1 -8 -6 -1  1  0 -1 -9
-H -1  2  2  1 -4  3  1 -2  6 -2 -2  1 -2 -2  0  0 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  3  2 -2 -1  0 -5  0  4 -2 -2  0 -9
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  7 -3  5  3 -3 -3 -1 -2  0  3 -3 -3 -1 -9
-K -1  4  1  1 -6  1  1 -1  1 -2 -3  5  0 -6 -1  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -2 -2 -6 -1 -2 -3 -2  3  5  0  5  1 -2 -1  0 -4 -2  2 -2 -2  0 -9
-F -4 -5 -4 -6 -4 -5 -6 -5 -2  2  3 -6  1 12 -5 -4 -3  2 11  0 -5 -5 -2 -9
-P  1  0  0  0 -3  1  0  0  0 -2 -3 -1 -2 -5  6  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  0  1  0 -1 -3  0 -1 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  2 -6 -3  0  0  0  0 -9
-W -7  3 -5 -7 -9 -5 -8 -8 -3 -5 -2 -3 -4  2 -6 -3 -6 27  1 -7 -6 -6 -4 -9
-Y -4 -4 -3 -5  1 -4 -5 -6  0  0  0 -5 -2 11 -5 -3 -3  1 14 -2 -4 -5 -2 -9
-V  0 -2 -1 -2 -2 -2 -2 -1 -2  4  3 -2  2  0 -1 -1  0 -7 -2  4 -2 -2  0 -9
-B  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -2  2  2  0 -9
-Z  0  1  1  3 -6  3  3  0  2 -2 -3  1 -2 -5  0  0  0 -6 -5 -2  2  3  0 -9
-X  0 -1  0  0 -3  0  0 -1  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM380 b/Butterfly/src/src/jaligner/matrix/matrices/PAM380
deleted file mode 100644
index cbcf063..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM380
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 380 substitution matrix, scale = ln(2)/5 = 0.138629
-#
-# Expected score = -0.612, Entropy = 0.156 bits
-#
-# Lowest score = -9, Highest score = 26
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  2 -1  0 -2 -1 -1 -4  1  1  1 -6 -4  0  1  0  0 -9
-R -1  6  1  0 -4  2  0 -2  2 -2 -3  4  0 -5  0  0  0  3 -4 -2  0  1  0 -9
-N  0  1  1  2 -4  1  2  1  1 -2 -3  1 -1 -4  0  1  0 -5 -3 -1  2  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -4  1 -2 -6  0  1  0 -7 -5 -2  3  3  0 -9
-C -2 -4 -4 -5 17 -5 -5 -3 -4 -2 -6 -6 -5 -4 -3  0 -2 -9  1 -2 -4 -5 -3 -9
-Q  0  2  1  2 -5  3  2 -1  3 -2 -2  1 -1 -5  1  0  0 -5 -4 -2  2  3  0 -9
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  0  0 -7 -5 -2  3  3  0 -9
-G  2 -2  1  1 -3 -1  1  5 -1 -2 -4 -1 -2 -5  0  1  1 -8 -5 -1  1  0  0 -9
-H -1  2  1  1 -4  3  1 -1  6 -2 -2  1 -2 -2  0  0 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  3  2 -2 -1  0 -5  0  4 -2 -2  0 -9
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  7 -3  4  3 -2 -3 -1 -2  0  3 -3 -3 -1 -9
-K -1  4  1  1 -6  1  1 -1  1 -2 -3  5  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -2  3  4  0  5  1 -2 -1  0 -4 -2  2 -2 -1  0 -9
-F -4 -5 -4 -6 -4 -5 -5 -5 -2  2  3 -5  1 12 -5 -4 -3  2 10  0 -5 -5 -2 -9
-P  1  0  0  0 -3  1  0  0  0 -2 -2  0 -2 -5  5  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  0  1  0 -1 -3  0 -1 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  2 -6 -3  0  0  0  0 -9
-W -6  3 -5 -7 -9 -5 -7 -8 -3 -5 -2 -3 -4  2 -6 -3 -6 26  1 -6 -6 -6 -4 -9
-Y -4 -4 -3 -5  1 -4 -5 -5  0  0  0 -5 -2 10 -5 -3 -3  1 13 -2 -4 -4 -2 -9
-V  0 -2 -1 -2 -2 -2 -2 -1 -2  4  3 -2  2  0 -1 -1  0 -6 -2  4 -2 -2  0 -9
-B  1  0  2  3 -4  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -2  2  2  0 -9
-Z  0  1  1  3 -5  3  3  0  2 -2 -3  1 -1 -5  0  0  0 -6 -4 -2  2  3  0 -9
-X  0  0  0  0 -3  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM390 b/Butterfly/src/src/jaligner/matrix/matrices/PAM390
deleted file mode 100644
index 8206530..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM390
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 390 substitution matrix, scale = ln(2)/5 = 0.138629
-#
-# Expected score = -0.581, Entropy = 0.147 bits
-#
-# Lowest score = -9, Highest score = 26
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  1 -1  0 -2 -1 -1 -3  1  1  1 -6 -4  0  1  0  0 -9
-R -1  6  1  0 -4  1  0 -2  2 -2 -3  4  0 -5  0  0  0  3 -4 -2  0  1  0 -9
-N  0  1  1  2 -4  1  2  1  1 -2 -3  1 -1 -4  0  1  0 -4 -3 -1  2  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -4  1 -2 -5  0  1  0 -7 -5 -2  3  3  0 -9
-C -2 -4 -4 -5 17 -5 -5 -3 -4 -2 -6 -5 -5 -4 -3  0 -2 -9  1 -2 -4 -5 -3 -9
-Q  0  1  1  2 -5  3  2  0  3 -2 -2  1 -1 -4  0  0  0 -5 -4 -1  2  3  0 -9
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  0  0 -7 -5 -1  2  3  0 -9
-G  1 -2  1  1 -3  0  1  5 -1 -2 -4 -1 -2 -5  0  1  1 -7 -5 -1  1  0  0 -9
-H -1  2  1  1 -4  3  1 -1  6 -2 -2  1 -2 -2  0  0 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  3 -2  3  2 -1 -1  0 -5  0  4 -2 -2  0 -9
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  3  7 -3  4  3 -2 -2 -1 -2  0  3 -3 -2 -1 -9
-K -1  4  1  1 -5  1  1 -1  1 -2 -3  4  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -2  3  4  0  5  1 -2 -1  0 -4 -1  2 -2 -1  0 -9
-F -3 -5 -4 -5 -4 -4 -5 -5 -2  2  3 -5  1 12 -5 -3 -3  2 10  0 -5 -5 -2 -9
-P  1  0  0  0 -3  0  0  0  0 -1 -2  0 -2 -5  5  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  0  1  0 -1 -2  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  1 -5 -3  0  0  0  0 -9
-W -6  3 -4 -7 -9 -5 -7 -7 -3 -5 -2 -3 -4  2 -6 -3 -5 26  1 -6 -6 -6 -4 -9
-Y -4 -4 -3 -5  1 -4 -5 -5  0  0  0 -5 -1 10 -5 -3 -3  1 13 -2 -4 -4 -2 -9
-V  0 -2 -1 -2 -2 -1 -1 -1 -2  4  3 -2  2  0 -1 -1  0 -6 -2  4 -2 -1  0 -9
-B  1  0  2  3 -4  2  2  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -2  2  2  0 -9
-Z  0  1  1  3 -5  3  3  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -1  2  3  0 -9
-X  0  0  0  0 -3  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM40 b/Butterfly/src/src/jaligner/matrix/matrices/PAM40
deleted file mode 100644
index e0df4f6..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM40
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 40 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -4.27, Entropy = 2.26 bits
-#
-# Lowest score = -15, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   6  -6  -3  -3  -6  -3  -2  -1  -6  -4  -5  -6  -4  -7  -1   0   0 -12  -7  -2  -3  -2  -3 -15
-R  -6   8  -5  -9  -7  -1  -8  -8  -1  -5  -8   1  -3  -8  -3  -2  -5  -1  -9  -7  -6  -3  -5 -15
-N  -3  -5   7   2  -9  -3  -1  -2   1  -4  -6   0  -7  -8  -5   0  -1  -7  -4  -7   6  -2  -3 -15
-D  -3  -9   2   7 -12  -2   3  -3  -3  -6 -11  -4  -9 -13  -7  -3  -4 -13 -10  -7   6   2  -5 -15
-C  -6  -7  -9 -12   9 -12 -12  -8  -7  -5 -13 -12 -12 -11  -7  -2  -7 -14  -3  -5 -11 -12  -8 -15
-Q  -3  -1  -3  -2 -12   8   2  -6   1  -7  -4  -2  -3 -11  -2  -4  -5 -11 -10  -6  -2   6  -4 -15
-E  -2  -8  -1   3 -12   2   7  -3  -4  -5  -8  -4  -6 -12  -5  -4  -5 -15  -8  -6   2   6  -4 -15
-G  -1  -8  -2  -3  -8  -6  -3   6  -8  -9  -9  -6  -7  -8  -5  -1  -5 -13 -12  -5  -2  -4  -4 -15
-H  -6  -1   1  -3  -7   1  -4  -8   9  -8  -5  -5  -9  -5  -3  -5  -6  -6  -3  -6  -1   0  -4 -15
-I  -4  -5  -4  -6  -5  -7  -5  -9  -8   8  -1  -5   0  -2  -7  -6  -2 -12  -5   2  -5  -5  -4 -15
-L  -5  -8  -6 -11 -13  -4  -8  -9  -5  -1   7  -7   1  -2  -6  -7  -6  -5  -6  -2  -8  -6  -5 -15
-K  -6   1   0  -4 -12  -2  -4  -6  -5  -5  -7   6  -1 -12  -6  -3  -2 -10  -8  -8  -2  -3  -4 -15
-M  -4  -3  -7  -9 -12  -3  -6  -7  -9   0   1  -1  11  -3  -7  -5  -3 -11 -10  -1  -8  -4  -4 -15
-F  -7  -8  -8 -13 -11 -11 -12  -8  -5  -2  -2 -12  -3   9  -9  -6  -8  -4   2  -7  -9 -12  -7 -15
-P  -1  -3  -5  -7  -7  -2  -5  -5  -3  -7  -6  -6  -7  -9   8  -1  -3 -12 -12  -5  -6  -3  -4 -15
-S   0  -2   0  -3  -2  -4  -4  -1  -5  -6  -7  -3  -5  -6  -1   6   1  -4  -6  -5  -1  -4  -2 -15
-T   0  -5  -1  -4  -7  -5  -5  -5  -6  -2  -6  -2  -3  -8  -3   1   7 -11  -6  -2  -2  -5  -3 -15
-W -12  -1  -7 -13 -14 -11 -15 -13  -6 -12  -5 -10 -11  -4 -12  -4 -11  13  -4 -14  -9 -13  -9 -15
-Y  -7  -9  -4 -10  -3 -10  -8 -12  -3  -5  -6  -8 -10   2 -12  -6  -6  -4  10  -6  -6  -8  -7 -15
-V  -2  -7  -7  -7  -5  -6  -6  -5  -6   2  -2  -8  -1  -7  -5  -5  -2 -14  -6   7  -7  -6  -4 -15
-B  -3  -6   6   6 -11  -2   2  -2  -1  -5  -8  -2  -8  -9  -6  -1  -2  -9  -6  -7   6   1  -4 -15
-Z  -2  -3  -2   2 -12   6   6  -4   0  -5  -6  -3  -4 -12  -3  -4  -5 -13  -8  -6   1   6  -4 -15
-X  -3  -5  -3  -5  -8  -4  -4  -4  -4  -4  -5  -4  -4  -7  -4  -2  -3  -9  -7  -4  -4  -4  -4 -15
-* -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15 -15   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM400 b/Butterfly/src/src/jaligner/matrix/matrices/PAM400
deleted file mode 100644
index 4d99c84..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM400
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 400 substitution matrix, scale = ln(2)/5 = 0.138629
-#
-# Expected score = -0.521, Entropy = 0.139 bits
-#
-# Lowest score = -8, Highest score = 26
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  1 -1  0 -2 -1 -1 -3  1  1  1 -6 -3  0  1  0  0 -8
-R -1  5  1  0 -4  1  0 -2  2 -2 -3  4  0 -4  0  0  0  3 -4 -2  0  1  0 -8
-N  0  1  1  2 -3  1  2  1  1 -1 -3  1 -1 -3  0  1  0 -4 -3 -1  2  1  0 -8
-D  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -4 -2  2  2  0 -8
-C -2 -4 -3 -5 17 -5 -5 -3 -3 -2 -6 -5 -5 -4 -2  0 -2 -8  1 -2 -4 -5 -3 -8
-Q  0  1  1  2 -5  3  2  0  3 -2 -2  1 -1 -4  0  0  0 -5 -4 -1  2  2  0 -8
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  0  0 -7 -4 -1  2  3  0 -8
-G  1 -2  1  1 -3  0  1  4 -1 -2 -3 -1 -2 -5  0  1  1 -7 -5 -1  1  0  0 -8
-H -1  2  1  1 -3  3  1 -1  5 -2 -2  1 -1 -2  0  0 -1 -2  0 -2  1  2  0 -8
-I  0 -2 -1 -2 -2 -2 -2 -2 -2  4  3 -2  2  2 -1 -1  0 -5  0  3 -2 -2  0 -8
-L -2 -3 -3 -3 -6 -2 -3 -3 -2  3  7 -2  4  3 -2 -2 -1 -2  0  3 -3 -2 -1 -8
-K -1  4  1  1 -5  1  1 -1  1 -2 -2  4  0 -5  0  0  0 -3 -4 -2  1  1  0 -8
-M -1  0 -1 -2 -5 -1 -2 -2 -1  2  4  0  5  1 -1 -1  0 -4 -1  2 -2 -1  0 -8
-F -3 -4 -3 -5 -4 -4 -5 -5 -2  2  3 -5  1 11 -4 -3 -3  2 10  0 -4 -5 -2 -8
-P  1  0  0  0 -2  0  0  0  0 -1 -2  0 -1 -4  5  1  1 -6 -5 -1  0  0  0 -8
-S  1  0  1  1  0  0  0  1  0 -1 -2  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -8
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  1 -5 -3  0  0  0  0 -8
-W -6  3 -4 -7 -8 -5 -7 -7 -2 -5 -2 -3 -4  2 -6 -3 -5 26  1 -6 -5 -6 -4 -8
-Y -3 -4 -3 -4  1 -4 -4 -5  0  0  0 -4 -1 10 -5 -3 -3  1 13 -2 -3 -4 -2 -8
-V  0 -2 -1 -2 -2 -1 -1 -1 -2  3  3 -2  2  0 -1 -1  0 -6 -2  4 -1 -1  0 -8
-B  1  0  2  2 -4  2  2  1  1 -2 -3  1 -2 -4  0  1  0 -5 -3 -1  2  2  0 -8
-Z  0  1  1  2 -5  2  3  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -1  2  3  0 -8
-X  0  0  0  0 -3  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -8
-* -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8 -8  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM410 b/Butterfly/src/src/jaligner/matrix/matrices/PAM410
deleted file mode 100644
index b7c9bfd..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM410
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 410 substitution matrix, scale = ln(2)/6 = 0.115525
-#
-# Expected score = -0.617, Entropy = 0.131 bits
-#
-# Lowest score = -10, Highest score = 31
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   1  -1   0   1  -2   0   1   2  -1   0  -2  -1  -1  -4   1   1   1  -7  -4   0   1   0   0 -10
-R  -1   6   1   0  -4   2   0  -2   2  -2  -3   4   0  -5   0   0   0   4  -5  -2   0   1   0 -10
-N   0   1   1   2  -4   1   2   1   1  -2  -3   1  -2  -4   0   1   1  -5  -3  -1   2   2   0 -10
-D   1   0   2   3  -6   2   3   1   1  -2  -4   1  -2  -6   0   1   0  -8  -5  -2   3   3   0 -10
-C  -2  -4  -4  -6  20  -6  -6  -4  -4  -3  -7  -6  -6  -4  -3   0  -2 -10   1  -2  -5  -6  -3 -10
-Q   0   2   1   2  -6   3   2   0   3  -2  -2   1  -1  -5   1   0   0  -5  -4  -2   2   3   0 -10
-E   1   0   2   3  -6   2   3   1   1  -2  -3   1  -2  -6   0   1   0  -8  -5  -2   3   3   0 -10
-G   2  -2   1   1  -4   0   1   5  -1  -2  -4  -1  -3  -6   0   1   1  -8  -6  -1   1   0   0 -10
-H  -1   2   1   1  -4   3   1  -1   6  -2  -2   1  -2  -2   0   0  -1  -3   0  -2   1   2   0 -10
-I   0  -2  -2  -2  -3  -2  -2  -2  -2   4   4  -2   3   2  -2  -1   0  -6   0   4  -2  -2   0 -10
-L  -2  -3  -3  -4  -7  -2  -3  -4  -2   4   8  -3   5   4  -3  -3  -1  -2   1   3  -3  -3  -1 -10
-K  -1   4   1   1  -6   1   1  -1   1  -2  -3   5   0  -6   0   0   0  -3  -5  -2   1   1   0 -10
-M  -1   0  -2  -2  -6  -1  -2  -3  -2   3   5   0   5   1  -2  -1   0  -4  -2   2  -2  -2   0 -10
-F  -4  -5  -4  -6  -4  -5  -6  -6  -2   2   4  -6   1  14  -5  -4  -3   2  12   0  -5  -5  -2 -10
-P   1   0   0   0  -3   1   0   0   0  -2  -3   0  -2  -5   6   1   1  -7  -5  -1   0   0   0 -10
-S   1   0   1   1   0   0   1   1   0  -1  -3   0  -1  -4   1   1   1  -3  -3  -1   1   0   0 -10
-T   1   0   1   0  -2   0   0   1  -1   0  -1   0   0  -3   1   1   2  -6  -3   0   0   0   0 -10
-W  -7   4  -5  -8 -10  -5  -8  -8  -3  -6  -2  -3  -4   2  -7  -3  -6  31   2  -7  -6  -7  -4 -10
-Y  -4  -5  -3  -5   1  -4  -5  -6   0   0   1  -5  -2  12  -5  -3  -3   2  15  -2  -4  -5  -2 -10
-V   0  -2  -1  -2  -2  -2  -2  -1  -2   4   3  -2   2   0  -1  -1   0  -7  -2   4  -2  -2   0 -10
-B   1   0   2   3  -5   2   3   1   1  -2  -3   1  -2  -5   0   1   0  -6  -4  -2   2   2   0 -10
-Z   0   1   2   3  -6   3   3   0   2  -2  -3   1  -2  -5   0   0   0  -7  -5  -2   2   3   0 -10
-X   0   0   0   0  -3   0   0   0   0   0  -1   0   0  -2   0   0   0  -4  -2   0   0   0  -1 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM420 b/Butterfly/src/src/jaligner/matrix/matrices/PAM420
deleted file mode 100644
index 53e0caf..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM420
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 420 substitution matrix, scale = ln(2)/6 = 0.115525
-#
-# Expected score = -0.599, Entropy = 0.124 bits
-#
-# Lowest score = -10, Highest score = 31
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   1  -1   0   1  -2   0   1   2  -1   0  -2   0  -1  -4   1   1   1  -7  -4   0   1   0   0 -10
-R  -1   6   1   0  -4   2   0  -2   2  -2  -3   4   0  -5   0   0   0   4  -5  -2   0   1   0 -10
-N   0   1   1   2  -4   1   2   1   1  -2  -3   1  -1  -4   0   1   0  -5  -3  -1   2   2   0 -10
-D   1   0   2   3  -5   2   3   1   1  -2  -4   1  -2  -6   0   1   0  -8  -5  -2   3   3   0 -10
-C  -2  -4  -4  -5  20  -6  -6  -3  -4  -3  -7  -6  -6  -4  -3   0  -2 -10   1  -2  -5  -6  -3 -10
-Q   0   2   1   2  -6   3   2   0   3  -2  -2   1  -1  -5   1   0   0  -5  -4  -2   2   3   0 -10
-E   1   0   2   3  -6   2   3   1   1  -2  -3   1  -2  -6   0   1   0  -8  -5  -2   3   3   0 -10
-G   2  -2   1   1  -3   0   1   5  -1  -2  -4  -1  -2  -6   0   1   1  -8  -6  -1   1   0   0 -10
-H  -1   2   1   1  -4   3   1  -1   6  -2  -2   1  -2  -2   0   0  -1  -3   0  -2   1   2   0 -10
-I   0  -2  -2  -2  -3  -2  -2  -2  -2   4   4  -2   3   2  -2  -1   0  -6   0   4  -2  -2   0 -10
-L  -2  -3  -3  -4  -7  -2  -3  -4  -2   4   7  -3   5   4  -2  -3  -1  -2   1   3  -3  -3  -1 -10
-K   0   4   1   1  -6   1   1  -1   1  -2  -3   5   0  -6   0   0   0  -3  -5  -2   1   1   0 -10
-M  -1   0  -1  -2  -6  -1  -2  -2  -2   3   5   0   5   1  -2  -1   0  -4  -1   2  -2  -1   0 -10
-F  -4  -5  -4  -6  -4  -5  -6  -6  -2   2   4  -6   1  13  -5  -4  -3   2  12   0  -5  -5  -2 -10
-P   1   0   0   0  -3   1   0   0   0  -2  -2   0  -2  -5   5   1   1  -6  -5  -1   0   0   0 -10
-S   1   0   1   1   0   0   1   1   0  -1  -3   0  -1  -4   1   1   1  -3  -3  -1   1   0   0 -10
-T   1   0   0   0  -2   0   0   1  -1   0  -1   0   0  -3   1   1   1  -6  -3   0   0   0   0 -10
-W  -7   4  -5  -8 -10  -5  -8  -8  -3  -6  -2  -3  -4   2  -6  -3  -6  31   2  -7  -6  -7  -4 -10
-Y  -4  -5  -3  -5   1  -4  -5  -6   0   0   1  -5  -1  12  -5  -3  -3   2  15  -2  -4  -5  -2 -10
-V   0  -2  -1  -2  -2  -2  -2  -1  -2   4   3  -2   2   0  -1  -1   0  -7  -2   4  -2  -2   0 -10
-B   1   0   2   3  -5   2   3   1   1  -2  -3   1  -2  -5   0   1   0  -6  -4  -2   2   2   0 -10
-Z   0   1   2   3  -6   3   3   0   2  -2  -3   1  -1  -5   0   0   0  -7  -5  -2   2   3   0 -10
-X   0   0   0   0  -3   0   0   0   0   0  -1   0   0  -2   0   0   0  -4  -2   0   0   0  -1 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM430 b/Butterfly/src/src/jaligner/matrix/matrices/PAM430
deleted file mode 100644
index 2450215..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM430
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 430 substitution matrix, scale = ln(2)/6 = 0.115525
-#
-# Expected score = -0.543, Entropy = 0.117 bits
-#
-# Lowest score = -9, Highest score = 31
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  2 -1  0 -2  0 -1 -4  1  1  1 -7 -4  0  1  0  0 -9
-R -1  6  1  0 -4  2  0 -2  2 -2 -3  4  0 -5  0  0  0  4 -4 -2  0  1  0 -9
-N  0  1  1  2 -4  1  2  1  1 -2 -3  1 -1 -4  0  1  0 -5 -3 -1  2  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -4  1 -2 -6  0  1  0 -7 -5 -2  3  3  0 -9
-C -2 -4 -4 -5 20 -6 -5 -3 -4 -2 -6 -6 -5 -4 -3  0 -2 -9  1 -2 -4 -5 -3 -9
-Q  0  2  1  2 -6  3  2  0  3 -2 -2  1 -1 -5  1  0  0 -5 -4 -1  2  3  0 -9
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -6  0  1  0 -8 -5 -1  2  3  0 -9
-G  2 -2  1  1 -3  0  1  5 -1 -2 -4 -1 -2 -5  0  1  1 -8 -5 -1  1  0  0 -9
-H -1  2  1  1 -4  3  1 -1  5 -2 -2  1 -1 -2  0  0 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  4 -2  3  2 -1 -1  0 -5  0  4 -2 -2  0 -9
-L -2 -3 -3 -4 -6 -2 -3 -4 -2  4  7 -3  5  4 -2 -2 -1 -2  1  3 -3 -3 -1 -9
-K  0  4  1  1 -6  1  1 -1  1 -2 -3  4  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -1  3  5  0  5  1 -2 -1  0 -4 -1  2 -2 -1  0 -9
-F -4 -5 -4 -6 -4 -5 -6 -5 -2  2  4 -5  1 13 -5 -4 -3  2 12  0 -5 -5 -2 -9
-P  1  0  0  0 -3  1  0  0  0 -1 -2  0 -2 -5  5  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  1  1  0 -1 -2  0 -1 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  1 -6 -3  0  0  0  0 -9
-W -7  4 -5 -7 -9 -5 -8 -8 -3 -5 -2 -3 -4  2 -6 -3 -6 31  2 -7 -6 -6 -4 -9
-Y -4 -4 -3 -5  1 -4 -5 -5  0  0  1 -5 -1 12 -5 -3 -3  2 15 -2 -4 -5 -2 -9
-V  0 -2 -1 -2 -2 -1 -1 -1 -2  4  3 -2  2  0 -1 -1  0 -7 -2  4 -1 -1  0 -9
-B  1  0  2  3 -4  2  2  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -1  2  2  0 -9
-Z  0  1  1  3 -5  3  3  0  2 -2 -3  1 -1 -5  0  0  0 -6 -5 -1  2  3  0 -9
-X  0  0  0  0 -3  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM440 b/Butterfly/src/src/jaligner/matrix/matrices/PAM440
deleted file mode 100644
index 0429e87..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM440
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 440 substitution matrix, scale = ln(2)/6 = 0.115525
-#
-# Expected score = -0.529, Entropy = 0.111 bits
-#
-# Lowest score = -9, Highest score = 30
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  2 -1  0 -2  0 -1 -4  1  1  1 -6 -4  0  1  0  0 -9
-R -1  5  1  0 -4  2  0 -2  2 -2 -3  4  0 -5  0  0  0  4 -4 -2  0  1  0 -9
-N  0  1  1  2 -4  1  2  1  1 -2 -3  1 -1 -4  0  1  0 -5 -3 -1  2  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -6  0  1  0 -7 -5 -2  2  2  0 -9
-C -2 -4 -4 -5 20 -5 -5 -3 -4 -2 -6 -5 -5 -4 -3  0 -2 -9  1 -2 -4 -5 -3 -9
-Q  0  2  1  2 -5  3  2  0  3 -2 -2  1 -1 -4  1  0  0 -5 -4 -1  2  2  0 -9
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -5 -1  2  3  0 -9
-G  2 -2  1  1 -3  0  1  4 -1 -2 -4 -1 -2 -5  0  1  1 -8 -5 -1  1  0  0 -9
-H -1  2  1  1 -4  3  1 -1  5 -2 -2  1 -1 -2  0  0 -1 -3  0 -2  1  2  0 -9
-I  0 -2 -2 -2 -2 -2 -2 -2 -2  4  4 -2  3  2 -1 -1  0 -5  0  3 -2 -2  0 -9
-L -2 -3 -3 -3 -6 -2 -3 -4 -2  4  7 -3  5  4 -2 -2 -1 -2  1  3 -3 -2 -1 -9
-K  0  4  1  1 -5  1  1 -1  1 -2 -3  4  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -1  3  5  0  4  1 -1 -1  0 -4 -1  2 -2 -1  0 -9
-F -4 -5 -4 -6 -4 -4 -5 -5 -2  2  4 -5  1 13 -5 -4 -3  2 12  0 -5 -5 -2 -9
-P  1  0  0  0 -3  1  0  0  0 -1 -2  0 -1 -5  5  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  1  1  0 -1 -2  0 -1 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  1 -6 -3  0  0  0  0 -9
-W -6  4 -5 -7 -9 -5 -7 -8 -3 -5 -2 -3 -4  2 -6 -3 -6 30  2 -6 -6 -6 -4 -9
-Y -4 -4 -3 -5  1 -4 -5 -5  0  0  1 -5 -1 12 -5 -3 -3  2 15 -2 -4 -4 -2 -9
-V  0 -2 -1 -2 -2 -1 -1 -1 -2  3  3 -2  2  0 -1 -1  0 -6 -2  4 -1 -1  0 -9
-B  1  0  2  2 -4  2  2  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -1  2  2  0 -9
-Z  0  1  1  2 -5  2  3  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -1  2  3  0 -9
-X  0  0  0  0 -3  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0 -1 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM450 b/Butterfly/src/src/jaligner/matrix/matrices/PAM450
deleted file mode 100644
index 30cc7a2..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM450
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 450 substitution matrix, scale = ln(2)/6 = 0.115525
-#
-# Expected score = -0.476, Entropy = 0.105 bits
-#
-# Lowest score = -9, Highest score = 30
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  1 -1  0 -2  0 -1 -3  1  1  1 -6 -4  0  1  0  0 -9
-R -1  5  1  0 -4  2  0 -1  2 -2 -3  4  0 -4  0  0  0  4 -4 -2  0  1  0 -9
-N  0  1  1  2 -4  1  2  1  1 -1 -2  1 -1 -4  0  1  0 -4 -3 -1  1  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -5 -1  2  2  0 -9
-C -2 -4 -4 -5 20 -5 -5 -3 -4 -2 -6 -5 -5 -4 -2  0 -2 -9  1 -2 -4 -5 -2 -9
-Q  0  2  1  2 -5  3  2  0  3 -1 -2  1 -1 -4  1  0  0 -5 -4 -1  2  2  0 -9
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -5 -1  2  3  0 -9
-G  1 -1  1  1 -3  0  1  4 -1 -2 -3 -1 -2 -5  0  1  1 -8 -5 -1  1  0  0 -9
-H -1  2  1  1 -4  3  1 -1  5 -2 -2  1 -1 -2  0  0 -1 -2  0 -2  1  2  0 -9
-I  0 -2 -1 -2 -2 -1 -2 -2 -2  4  3 -2  3  2 -1 -1  0 -5  0  3 -2 -2  0 -9
-L -2 -3 -2 -3 -6 -2 -3 -3 -2  3  7 -2  4  4 -2 -2 -1 -1  1  3 -3 -2 -1 -9
-K  0  4  1  1 -5  1  1 -1  1 -2 -2  4  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -1  3  4  0  4  1 -1 -1  0 -4 -1  2 -2 -1  0 -9
-F -3 -4 -4 -5 -4 -4 -5 -5 -2  2  4 -5  1 13 -5 -3 -3  2 12  0 -4 -5 -2 -9
-P  1  0  0  0 -2  1  0  0  0 -1 -2  0 -1 -5  5  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  1  1  0 -1 -2  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1 -1  0 -1  0  0 -3  1  1  1 -5 -3  0  0  0  0 -9
-W -6  4 -4 -7 -9 -5 -7 -8 -2 -5 -1 -3 -4  2 -6 -3 -5 30  2 -6 -6 -6 -4 -9
-Y -4 -4 -3 -5  1 -4 -5 -5  0  0  1 -5 -1 12 -5 -3 -3  2 14 -2 -4 -4 -2 -9
-V  0 -2 -1 -1 -2 -1 -1 -1 -2  3  3 -2  2  0 -1 -1  0 -6 -2  3 -1 -1  0 -9
-B  1  0  1  2 -4  2  2  1  1 -2 -3  1 -2 -4  0  1  0 -6 -4 -1  2  2  0 -9
-Z  0  1  1  2 -5  2  3  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -1  2  2  0 -9
-X  0  0  0  0 -2  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0  0 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM460 b/Butterfly/src/src/jaligner/matrix/matrices/PAM460
deleted file mode 100644
index 7491d6c..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM460
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 460 substitution matrix, scale = ln(2)/6 = 0.115525
-#
-# Expected score = -0.429, Entropy = 0.0994 bits
-#
-# Lowest score = -9, Highest score = 30
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  1  0  0 -1  0 -1 -3  1  1  1 -6 -3  0  1  0  0 -9
-R -1  5  1  0 -4  1  0 -1  2 -2 -2  4  0 -4  0  0  0  4 -4 -2  0  1  0 -9
-N  0  1  1  2 -3  1  1  1  1 -1 -2  1 -1 -3  0  1  0 -4 -3 -1  1  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -4 -1  2  2  0 -9
-C -2 -4 -3 -5 19 -5 -5 -3 -3 -2 -6 -5 -5 -3 -2  0 -2 -9  2 -2 -4 -5 -2 -9
-Q  0  1  1  2 -5  2  2  0  2 -1 -2  1 -1 -4  1  0  0 -5 -4 -1  1  2  0 -9
-E  1  0  1  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -4 -1  2  2  0 -9
-G  1 -1  1  1 -3  0  1  4 -1 -2 -3 -1 -2 -5  1  1  1 -7 -5 -1  1  0  0 -9
-H  0  2  1  1 -3  2  1 -1  5 -2 -2  1 -1 -2  0  0  0 -2  0 -2  1  2  0 -9
-I  0 -2 -1 -2 -2 -1 -2 -2 -2  3  3 -2  2  2 -1 -1  0 -5  0  3 -2 -2  0 -9
-L -1 -2 -2 -3 -6 -2 -3 -3 -2  3  7 -2  4  3 -2 -2 -1 -1  1  3 -3 -2 -1 -9
-K  0  4  1  1 -5  1  1 -1  1 -2 -2  4  0 -5  0  0  0 -3 -4 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -1  2  4  0  4  1 -1 -1  0 -4 -1  2 -2 -1  0 -9
-F -3 -4 -3 -5 -3 -4 -5 -5 -2  2  3 -5  1 12 -4 -3 -3  2 11  0 -4 -5 -2 -9
-P  1  0  0  0 -2  1  0  1  0 -1 -2  0 -1 -4  4  1  1 -6 -5 -1  0  0  0 -9
-S  1  0  1  1  0  0  1  1  0 -1 -2  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1  0  0 -1  0  0 -3  1  1  1 -5 -3  0  0  0  0 -9
-W -6  4 -4 -7 -9 -5 -7 -7 -2 -5 -1 -3 -4  2 -6 -3 -5 30  2 -6 -6 -6 -4 -9
-Y -3 -4 -3 -4  2 -4 -4 -5  0  0  1 -4 -1 11 -5 -3 -3  2 14 -2 -4 -4 -2 -9
-V  0 -2 -1 -1 -2 -1 -1 -1 -2  3  3 -2  2  0 -1 -1  0 -6 -2  3 -1 -1  0 -9
-B  1  0  1  2 -4  1  2  1  1 -2 -3  1 -2 -4  0  1  0 -6 -4 -1  2  2  0 -9
-Z  0  1  1  2 -5  2  2  0  2 -2 -2  1 -1 -5  0  0  0 -6 -4 -1  2  2  0 -9
-X  0  0  0  0 -2  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0  0 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM470 b/Butterfly/src/src/jaligner/matrix/matrices/PAM470
deleted file mode 100644
index 9d5e333..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM470
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 470 substitution matrix, scale = ln(2)/7 = 0.0990210
-#
-# Expected score = -0.520, Entropy = 0.0942 bits
-#
-# Lowest score = -10, Highest score = 35
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   1  -1   1   1  -2   0   1   2  -1   0  -2   0  -1  -4   1   1   1  -7  -4   0   1   0   0 -10
-R  -1   6   1   0  -4   2   0  -1   2  -2  -3   4   0  -5   0   0   0   4  -5  -2   0   1   0 -10
-N   1   1   1   2  -4   1   2   1   1  -2  -3   1  -1  -4   0   1   0  -5  -3  -1   2   1   0 -10
-D   1   0   2   3  -5   2   3   1   1  -2  -4   1  -2  -6   0   1   0  -8  -5  -2   3   3   0 -10
-C  -2  -4  -4  -5  22  -6  -5  -3  -4  -2  -6  -6  -6  -4  -3   0  -2 -10   2  -2  -5  -6  -3 -10
-Q   0   2   1   2  -6   3   2   0   3  -2  -2   1  -1  -5   1   0   0  -5  -4  -1   2   2   0 -10
-E   1   0   2   3  -5   2   3   1   1  -2  -3   1  -2  -6   0   1   0  -8  -5  -1   2   3   0 -10
-G   2  -1   1   1  -3   0   1   5  -1  -2  -4  -1  -2  -6   1   1   1  -8  -6  -1   1   1   0 -10
-H  -1   2   1   1  -4   3   1  -1   5  -2  -2   1  -1  -2   0   0   0  -3   0  -2   1   2   0 -10
-I   0  -2  -2  -2  -2  -2  -2  -2  -2   4   4  -2   3   2  -1  -1   0  -5   0   3  -2  -2   0 -10
-L  -2  -3  -3  -4  -6  -2  -3  -4  -2   4   8  -3   5   4  -2  -2  -1  -2   1   3  -3  -3  -1 -10
-K   0   4   1   1  -6   1   1  -1   1  -2  -3   4   0  -5   0   0   0  -3  -5  -2   1   1   0 -10
-M  -1   0  -1  -2  -6  -1  -2  -2  -1   3   5   0   4   1  -1  -1   0  -4  -1   2  -2  -1   0 -10
-F  -4  -5  -4  -6  -4  -5  -6  -6  -2   2   4  -5   1  14  -5  -4  -3   3  13   0  -5  -5  -2 -10
-P   1   0   0   0  -3   1   0   1   0  -1  -2   0  -1  -5   5   1   1  -6  -5  -1   0   1   0 -10
-S   1   0   1   1   0   0   1   1   0  -1  -2   0  -1  -4   1   1   1  -4  -3  -1   1   0   0 -10
-T   1   0   0   0  -2   0   0   1   0   0  -1   0   0  -3   1   1   1  -6  -3   0   0   0   0 -10
-W  -7   4  -5  -8 -10  -5  -8  -8  -3  -5  -2  -3  -4   3  -6  -4  -6  35   2  -7  -6  -7  -4 -10
-Y  -4  -5  -3  -5   2  -4  -5  -6   0   0   1  -5  -1  13  -5  -3  -3   2  16  -2  -4  -5  -2 -10
-V   0  -2  -1  -2  -2  -1  -1  -1  -2   3   3  -2   2   0  -1  -1   0  -7  -2   4  -1  -1   0 -10
-B   1   0   2   3  -5   2   2   1   1  -2  -3   1  -2  -5   0   1   0  -6  -4  -1   2   2   0 -10
-Z   0   1   1   3  -6   2   3   1   2  -2  -3   1  -1  -5   1   0   0  -7  -5  -1   2   3   0 -10
-X   0   0   0   0  -3   0   0   0   0   0  -1   0   0  -2   0   0   0  -4  -2   0   0   0   0 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM480 b/Butterfly/src/src/jaligner/matrix/matrices/PAM480
deleted file mode 100644
index c777c62..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM480
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 480 substitution matrix, scale = ln(2)/7 = 0.0990210
-#
-# Expected score = -0.494, Entropy = 0.0893 bits
-#
-# Lowest score = -10, Highest score = 35
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   1  -1   1   1  -2   0   1   2   0   0  -2   0  -1  -4   1   1   1  -7  -4   0   1   0   0 -10
-R  -1   5   1   0  -4   2   0  -1   2  -2  -3   4   0  -5   0   0   0   4  -4  -2   0   1   0 -10
-N   1   1   1   2  -4   1   2   1   1  -1  -3   1  -1  -4   0   1   0  -5  -3  -1   2   1   0 -10
-D   1   0   2   3  -5   2   3   1   1  -2  -3   1  -2  -6   0   1   0  -7  -5  -1   2   2   0 -10
-C  -2  -4  -4  -5  22  -5  -5  -3  -4  -2  -6  -6  -5  -4  -3   0  -2 -10   2  -2  -4  -5  -3 -10
-Q   0   2   1   2  -5   3   2   0   3  -2  -2   1  -1  -5   1   0   0  -5  -4  -1   2   2   0 -10
-E   1   0   2   3  -5   2   3   1   1  -2  -3   1  -2  -5   0   1   0  -8  -5  -1   2   3   0 -10
-G   2  -1   1   1  -3   0   1   4  -1  -2  -4  -1  -2  -5   1   1   1  -8  -5  -1   1   1   0 -10
-H   0   2   1   1  -4   3   1  -1   5  -2  -2   1  -1  -2   0   0   0  -3   0  -2   1   2   0 -10
-I   0  -2  -1  -2  -2  -2  -2  -2  -2   4   4  -2   3   2  -1  -1   0  -5   0   3  -2  -2   0 -10
-L  -2  -3  -3  -3  -6  -2  -3  -4  -2   4   7  -3   5   4  -2  -2  -1  -2   1   3  -3  -3  -1 -10
-K   0   4   1   1  -6   1   1  -1   1  -2  -3   4   0  -5   0   0   0  -3  -5  -2   1   1   0 -10
-M  -1   0  -1  -2  -5  -1  -2  -2  -1   3   5   0   4   1  -1  -1   0  -4  -1   2  -2  -1   0 -10
-F  -4  -5  -4  -6  -4  -5  -5  -5  -2   2   4  -5   1  14  -5  -4  -3   3  13   0  -5  -5  -2 -10
-P   1   0   0   0  -3   1   0   1   0  -1  -2   0  -1  -5   5   1   1  -6  -5  -1   0   1   0 -10
-S   1   0   1   1   0   0   1   1   0  -1  -2   0  -1  -4   1   1   1  -3  -3  -1   1   0   0 -10
-T   1   0   0   0  -2   0   0   1   0   0  -1   0   0  -3   1   1   1  -6  -3   0   0   0   0 -10
-W  -7   4  -5  -7 -10  -5  -8  -8  -3  -5  -2  -3  -4   3  -6  -3  -6  35   2  -7  -6  -6  -4 -10
-Y  -4  -4  -3  -5   2  -4  -5  -5   0   0   1  -5  -1  13  -5  -3  -3   2  16  -2  -4  -5  -2 -10
-V   0  -2  -1  -1  -2  -1  -1  -1  -2   3   3  -2   2   0  -1  -1   0  -7  -2   3  -1  -1   0 -10
-B   1   0   2   2  -4   2   2   1   1  -2  -3   1  -2  -5   0   1   0  -6  -4  -1   2   2   0 -10
-Z   0   1   1   2  -5   2   3   1   2  -2  -3   1  -1  -5   1   0   0  -6  -5  -1   2   2   0 -10
-X   0   0   0   0  -3   0   0   0   0   0  -1   0   0  -2   0   0   0  -4  -2   0   0   0   0 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM490 b/Butterfly/src/src/jaligner/matrix/matrices/PAM490
deleted file mode 100644
index 107a0c8..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM490
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 490 substitution matrix, scale = ln(2)/7 = 0.0990210
-#
-# Expected score = -0.431, Entropy = 0.0847 bits
-#
-# Lowest score = -9, Highest score = 34
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  2  0  0 -1  0 -1 -3  1  1  1 -6 -4  0  1  0  0 -9
-R -1  5  1  0 -4  2  0 -1  2 -2 -3  4  0 -5  0  0  0  4 -4 -2  0  1  0 -9
-N  0  1  1  2 -4  1  2  1  1 -1 -2  1 -1 -4  0  1  0 -5 -3 -1  1  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -5 -1  2  2  0 -9
-C -2 -4 -4 -5 22 -5 -5 -3 -4 -2 -6 -5 -5 -4 -3  0 -2 -9  2 -2 -4 -5 -2 -9
-Q  0  2  1  2 -5  2  2  0  2 -1 -2  1 -1 -4  1  0  0 -5 -4 -1  2  2  0 -9
-E  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -5 -1  2  2  0 -9
-G  2 -1  1  1 -3  0  1  4 -1 -2 -3 -1 -2 -5  1  1  1 -8 -5 -1  1  1  0 -9
-H  0  2  1  1 -4  2  1 -1  5 -2 -2  1 -1 -2  0  0  0 -3  0 -2  1  2  0 -9
-I  0 -2 -1 -2 -2 -1 -2 -2 -2  3  4 -2  3  2 -1 -1  0 -5  0  3 -2 -2  0 -9
-L -1 -3 -2 -3 -6 -2 -3 -3 -2  4  7 -2  5  4 -2 -2 -1 -1  1  3 -3 -2 -1 -9
-K  0  4  1  1 -5  1  1 -1  1 -2 -2  4  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -2 -2 -1  3  5  0  4  1 -1 -1  0 -4 -1  2 -2 -1  0 -9
-F -3 -5 -4 -5 -4 -4 -5 -5 -2  2  4 -5  1 14 -5 -4 -3  3 13  0 -5 -5 -2 -9
-P  1  0  0  0 -3  1  0  1  0 -1 -2  0 -1 -5  4  1  1 -6 -5 -1  0  1  0 -9
-S  1  0  1  1  0  0  1  1  0 -1 -2  0 -1 -4  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1  0  0 -1  0  0 -3  1  1  1 -6 -3  0  0  0  0 -9
-W -6  4 -5 -7 -9 -5 -7 -8 -3 -5 -1 -3 -4  3 -6 -3 -6 34  2 -6 -6 -6 -4 -9
-Y -4 -4 -3 -5  2 -4 -5 -5  0  0  1 -5 -1 13 -5 -3 -3  2 15 -2 -4 -4 -2 -9
-V  0 -2 -1 -1 -2 -1 -1 -1 -2  3  3 -2  2  0 -1 -1  0 -6 -2  3 -1 -1  0 -9
-B  1  0  1  2 -4  2  2  1  1 -2 -3  1 -2 -5  0  1  0 -6 -4 -1  2  2  0 -9
-Z  0  1  1  2 -5  2  2  1  2 -2 -2  1 -1 -5  1  0  0 -6 -4 -1  2  2  0 -9
-X  0  0  0  0 -2  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0  0 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM50 b/Butterfly/src/src/jaligner/matrix/matrices/PAM50
deleted file mode 100644
index 6d37d4b..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM50
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 50 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -3.70, Entropy = 2.00 bits
-#
-# Lowest score = -13, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   5  -5  -2  -2  -5  -3  -1  -1  -5  -3  -5  -5  -4  -7   0   0   0 -11  -6  -1  -2  -2  -2 -13
-R  -5   8  -4  -7  -6   0  -7  -7   0  -4  -7   1  -3  -8  -3  -2  -5  -1  -8  -6  -5  -2  -4 -13
-N  -2  -4   7   2  -8  -2  -1  -2   1  -4  -6   0  -6  -7  -4   1  -1  -7  -3  -6   5  -1  -2 -13
-D  -2  -7   2   7 -11  -1   3  -2  -2  -6 -10  -3  -8 -12  -6  -2  -3 -12  -9  -6   6   2  -4 -13
-C  -5  -6  -8 -11   9 -11 -11  -7  -6  -5 -12 -11 -11 -10  -6  -2  -6 -13  -3  -5  -9 -11  -7 -13
-Q  -3   0  -2  -1 -11   8   2  -5   2  -6  -4  -2  -3 -10  -2  -4  -4 -10  -9  -5  -2   6  -3 -13
-E  -1  -7  -1   3 -11   2   7  -3  -3  -4  -7  -3  -5 -11  -4  -3  -4 -13  -7  -5   2   6  -3 -13
-G  -1  -7  -2  -2  -7  -5  -3   6  -7  -8  -9  -6  -7  -8  -4  -1  -4 -12 -11  -4  -2  -4  -4 -13
-H  -5   0   1  -2  -6   2  -3  -7   9  -7  -5  -4  -8  -5  -3  -4  -5  -6  -2  -5   0   0  -4 -13
-I  -3  -4  -4  -6  -5  -6  -4  -8  -7   8   0  -5   0  -1  -7  -5  -1 -11  -5   3  -5  -5  -3 -13
-L  -5  -7  -6 -10 -12  -4  -7  -9  -5   0   6  -6   2  -1  -6  -7  -5  -5  -5  -1  -7  -5  -5 -13
-K  -5   1   0  -3 -11  -2  -3  -6  -4  -5  -6   6  -1 -11  -5  -3  -2  -9  -8  -7  -1  -2  -4 -13
-M  -4  -3  -6  -8 -11  -3  -5  -7  -8   0   2  -1  10  -3  -6  -4  -3 -10  -8   0  -7  -4  -4 -13
-F  -7  -8  -7 -12 -10 -10 -11  -8  -5  -1  -1 -11  -3   9  -8  -5  -7  -3   3  -6  -9 -11  -6 -13
-P   0  -3  -4  -6  -6  -2  -4  -4  -3  -7  -6  -5  -6  -8   8  -1  -3 -11 -11  -4  -5  -3  -4 -13
-S   0  -2   1  -2  -2  -4  -3  -1  -4  -5  -7  -3  -4  -5  -1   6   1  -4  -5  -4  -1  -3  -2 -13
-T   0  -5  -1  -3  -6  -4  -4  -4  -5  -1  -5  -2  -3  -7  -3   1   6 -10  -5  -2  -2  -4  -2 -13
-W -11  -1  -7 -12 -13 -10 -13 -12  -6 -11  -5  -9 -10  -3 -11  -4 -10  13  -4 -12  -8 -11  -9 -13
-Y  -6  -8  -3  -9  -3  -9  -7 -11  -2  -5  -5  -8  -8   3 -11  -5  -5  -4   9  -6  -5  -8  -6 -13
-V  -1  -6  -6  -6  -5  -5  -5  -4  -5   3  -1  -7   0  -6  -4  -4  -2 -12  -6   7  -6  -5  -3 -13
-B  -2  -5   5   6  -9  -2   2  -2   0  -5  -7  -1  -7  -9  -5  -1  -2  -8  -5  -6   5   1  -3 -13
-Z  -2  -2  -1   2 -11   6   6  -4   0  -5  -5  -2  -4 -11  -3  -3  -4 -11  -8  -5   1   6  -3 -13
-X  -2  -4  -2  -4  -7  -3  -3  -4  -4  -3  -5  -4  -4  -6  -4  -2  -2  -9  -6  -3  -3  -3  -4 -13
-* -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13 -13   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM500 b/Butterfly/src/src/jaligner/matrix/matrices/PAM500
deleted file mode 100644
index 617c3f1..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM500
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 500 substitution matrix, scale = ln(2)/7 = 0.0990210
-#
-# Expected score = -0.401, Entropy = 0.0803 bits
-#
-# Lowest score = -9, Highest score = 34
-#
-   A  R  N  D  C  Q  E  G  H  I  L  K  M  F  P  S  T  W  Y  V  B  Z  X  *
-A  1 -1  0  1 -2  0  1  1  0  0 -1  0 -1 -3  1  1  1 -6 -3  0  1  0  0 -9
-R -1  5  1  0 -4  2  0 -1  2 -2 -2  4  0 -4  0  0  0  4 -4 -2  0  1  0 -9
-N  0  1  1  2 -3  1  1  1  1 -1 -2  1 -1 -4  0  1  0 -5 -3 -1  1  1  0 -9
-D  1  0  2  3 -5  2  3  1  1 -2 -3  1 -2 -5  0  1  0 -7 -5 -1  2  2  0 -9
-C -2 -4 -3 -5 22 -5 -5 -3 -4 -2 -6 -5 -5 -3 -2  0 -2 -9  2 -2 -4 -5 -2 -9
-Q  0  2  1  2 -5  2  2  0  2 -1 -2  1 -1 -4  1  0  0 -5 -4 -1  2  2  0 -9
-E  1  0  1  3 -5  2  3  1  1 -2 -3  1 -1 -5  0  1  0 -7 -5 -1  2  2  0 -9
-G  1 -1  1  1 -3  0  1  4 -1 -2 -3  0 -2 -5  1  1  1 -8 -5 -1  1  1  0 -9
-H  0  2  1  1 -4  2  1 -1  4 -2 -2  1 -1 -2  0  0  0 -2  0 -2  1  2  0 -9
-I  0 -2 -1 -2 -2 -1 -2 -2 -2  3  4 -2  3  2 -1 -1  0 -5  0  3 -2 -2  0 -9
-L -1 -2 -2 -3 -6 -2 -3 -3 -2  4  7 -2  4  4 -2 -2 -1 -1  1  3 -3 -2 -1 -9
-K  0  4  1  1 -5  1  1  0  1 -2 -2  4  0 -5  0  0  0 -3 -5 -2  1  1  0 -9
-M -1  0 -1 -2 -5 -1 -1 -2 -1  3  4  0  4  1 -1 -1  0 -4 -1  2 -1 -1  0 -9
-F -3 -4 -4 -5 -3 -4 -5 -5 -2  2  4 -5  1 13 -4 -3 -3  3 13  0 -4 -5 -2 -9
-P  1  0  0  0 -2  1  0  1  0 -1 -2  0 -1 -4  4  1  1 -6 -5 -1  0  1  0 -9
-S  1  0  1  1  0  0  1  1  0 -1 -2  0 -1 -3  1  1  1 -3 -3 -1  1  0  0 -9
-T  1  0  0  0 -2  0  0  1  0  0 -1  0  0 -3  1  1  1 -6 -3  0  0  0  0 -9
-W -6  4 -5 -7 -9 -5 -7 -8 -2 -5 -1 -3 -4  3 -6 -3 -6 34  2 -6 -6 -6 -4 -9
-Y -3 -4 -3 -5  2 -4 -5 -5  0  0  1 -5 -1 13 -5 -3 -3  2 15 -1 -4 -4 -2 -9
-V  0 -2 -1 -1 -2 -1 -1 -1 -2  3  3 -2  2  0 -1 -1  0 -6 -1  3 -1 -1  0 -9
-B  1  0  1  2 -4  2  2  1  1 -2 -3  1 -1 -4  0  1  0 -6 -4 -1  2  2  0 -9
-Z  0  1  1  2 -5  2  2  1  2 -2 -2  1 -1 -5  1  0  0 -6 -4 -1  2  2  0 -9
-X  0  0  0  0 -2  0  0  0  0  0 -1  0  0 -2  0  0  0 -4 -2  0  0  0  0 -9
-* -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9 -9  1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM60 b/Butterfly/src/src/jaligner/matrix/matrices/PAM60
deleted file mode 100644
index fba70b9..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM60
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 60 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -3.21, Entropy = 1.79 bits
-#
-# Lowest score = -12, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   5  -5  -2  -2  -5  -3  -1   0  -5  -3  -4  -5  -3  -6   0   1   1 -10  -6  -1  -2  -2  -2 -12
-R  -5   8  -3  -6  -6   0  -6  -7   0  -4  -6   2  -2  -7  -2  -2  -4   0  -8  -5  -5  -2  -4 -12
-N  -2  -3   6   2  -7  -2   0  -1   1  -4  -5   0  -6  -6  -4   1  -1  -6  -3  -5   5  -1  -2 -12
-D  -2  -6   2   7 -10  -1   3  -2  -2  -5  -9  -2  -7 -11  -5  -2  -3 -11  -8  -6   5   2  -3 -12
-C  -5  -6  -7 -10   9 -10 -10  -7  -6  -4 -11 -10 -10  -9  -6  -1  -5 -12  -2  -4  -9 -10  -6 -12
-Q  -3   0  -2  -1 -10   7   2  -5   2  -5  -3  -1  -2  -9  -1  -3  -4  -9  -8  -5  -1   6  -3 -12
-E  -1  -6   0   3 -10   2   7  -2  -3  -4  -7  -3  -5 -10  -3  -2  -4 -12  -7  -4   2   5  -3 -12
-G   0  -7  -1  -2  -7  -5  -2   6  -6  -7  -8  -5  -6  -7  -4   0  -3 -11 -10  -4  -2  -3  -3 -12
-H  -5   0   1  -2  -6   2  -3  -6   8  -6  -4  -4  -7  -4  -2  -4  -5  -5  -2  -5   0   0  -3 -12
-I  -3  -4  -4  -5  -4  -5  -4  -7  -6   7   0  -4   1  -1  -6  -4  -1 -10  -4   3  -4  -4  -3 -12
-L  -4  -6  -5  -9 -11  -3  -7  -8  -4   0   6  -6   2  -1  -5  -6  -5  -4  -5  -1  -7  -5  -4 -12
-K  -5   2   0  -2 -10  -1  -3  -5  -4  -4  -6   6   0 -10  -4  -2  -2  -8  -7  -6  -1  -2  -3 -12
-M  -3  -2  -6  -7 -10  -2  -5  -6  -7   1   2   0  10  -2  -6  -4  -2  -9  -7   0  -6  -4  -3 -12
-F  -6  -7  -6 -11  -9  -9 -10  -7  -4  -1  -1 -10  -2   8  -7  -5  -6  -3   3  -5  -8 -10  -5 -12
-P   0  -2  -4  -5  -6  -1  -3  -4  -2  -6  -5  -4  -6  -7   7   0  -2 -10 -10  -4  -4  -2  -3 -12
-S   1  -2   1  -2  -1  -3  -2   0  -4  -4  -6  -2  -4  -5   0   5   1  -4  -5  -4   0  -3  -2 -12
-T   1  -4  -1  -3  -5  -4  -4  -3  -5  -1  -5  -2  -2  -6  -2   1   6  -9  -5  -1  -2  -4  -2 -12
-W -10   0  -6 -11 -12  -9 -12 -11  -5 -10  -4  -8  -9  -3 -10  -4  -9  13  -3 -11  -8 -11  -8 -12
-Y  -6  -8  -3  -8  -2  -8  -7 -10  -2  -4  -5  -7  -7   3 -10  -5  -5  -3   9  -5  -5  -7  -5 -12
-V  -1  -5  -5  -6  -4  -5  -4  -4  -5   3  -1  -6   0  -5  -4  -4  -1 -11  -5   6  -5  -5  -3 -12
-B  -2  -5   5   5  -9  -1   2  -2   0  -4  -7  -1  -6  -8  -4   0  -2  -8  -5  -5   5   1  -3 -12
-Z  -2  -2  -1   2 -10   6   5  -3   0  -4  -5  -2  -4 -10  -2  -3  -4 -11  -7  -5   1   5  -3 -12
-X  -2  -4  -2  -3  -6  -3  -3  -3  -3  -3  -4  -3  -3  -5  -3  -2  -2  -8  -5  -3  -3  -3  -3 -12
-* -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 -12   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM70 b/Butterfly/src/src/jaligner/matrix/matrices/PAM70
deleted file mode 100644
index b20cdf0..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM70
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 70 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -2.77, Entropy = 1.60 bits
-#
-# Lowest score = -11, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   5  -4  -2  -1  -4  -2  -1   0  -4  -2  -4  -4  -3  -6   0   1   1  -9  -5  -1  -1  -1  -2 -11
-R  -4   8  -3  -6  -5   0  -5  -6   0  -3  -6   2  -2  -7  -2  -1  -4   0  -7  -5  -4  -2  -3 -11
-N  -2  -3   6   3  -7  -1   0  -1   1  -3  -5   0  -5  -6  -3   1   0  -6  -3  -5   5  -1  -2 -11
-D  -1  -6   3   6  -9   0   3  -1  -1  -5  -8  -2  -7 -10  -4  -1  -2 -10  -7  -5   5   2  -3 -11
-C  -4  -5  -7  -9   9  -9  -9  -6  -5  -4 -10  -9  -9  -8  -5  -1  -5 -11  -2  -4  -8  -9  -6 -11
-Q  -2   0  -1   0  -9   7   2  -4   2  -5  -3  -1  -2  -9  -1  -3  -3  -8  -8  -4  -1   5  -2 -11
-E  -1  -5   0   3  -9   2   6  -2  -2  -4  -6  -2  -4  -9  -3  -2  -3 -11  -6  -4   2   5  -3 -11
-G   0  -6  -1  -1  -6  -4  -2   6  -6  -6  -7  -5  -6  -7  -3   0  -3 -10  -9  -3  -1  -3  -3 -11
-H  -4   0   1  -1  -5   2  -2  -6   8  -6  -4  -3  -6  -4  -2  -3  -4  -5  -1  -4   0   1  -3 -11
-I  -2  -3  -3  -5  -4  -5  -4  -6  -6   7   1  -4   1   0  -5  -4  -1  -9  -4   3  -4  -4  -3 -11
-L  -4  -6  -5  -8 -10  -3  -6  -7  -4   1   6  -5   2  -1  -5  -6  -4  -4  -4   0  -6  -4  -4 -11
-K  -4   2   0  -2  -9  -1  -2  -5  -3  -4  -5   6   0  -9  -4  -2  -1  -7  -7  -6  -1  -2  -3 -11
-M  -3  -2  -5  -7  -9  -2  -4  -6  -6   1   2   0  10  -2  -5  -3  -2  -8  -7   0  -6  -3  -3 -11
-F  -6  -7  -6 -10  -8  -9  -9  -7  -4   0  -1  -9  -2   8  -7  -4  -6  -2   4  -5  -7  -9  -5 -11
-P   0  -2  -3  -4  -5  -1  -3  -3  -2  -5  -5  -4  -5  -7   7   0  -2  -9  -9  -3  -4  -2  -3 -11
-S   1  -1   1  -1  -1  -3  -2   0  -3  -4  -6  -2  -3  -4   0   5   2  -3  -5  -3   0  -2  -1 -11
-T   1  -4   0  -2  -5  -3  -3  -3  -4  -1  -4  -1  -2  -6  -2   2   6  -8  -4  -1  -1  -3  -2 -11
-W  -9   0  -6 -10 -11  -8 -11 -10  -5  -9  -4  -7  -8  -2  -9  -3  -8  13  -3 -10  -7 -10  -7 -11
-Y  -5  -7  -3  -7  -2  -8  -6  -9  -1  -4  -4  -7  -7   4  -9  -5  -4  -3   9  -5  -4  -7  -5 -11
-V  -1  -5  -5  -5  -4  -4  -4  -3  -4   3   0  -6   0  -5  -3  -3  -1 -10  -5   6  -5  -4  -2 -11
-B  -1  -4   5   5  -8  -1   2  -1   0  -4  -6  -1  -6  -7  -4   0  -1  -7  -4  -5   5   1  -2 -11
-Z  -1  -2  -1   2  -9   5   5  -3   1  -4  -4  -2  -3  -9  -2  -2  -3 -10  -7  -4   1   5  -3 -11
-X  -2  -3  -2  -3  -6  -2  -3  -3  -3  -3  -4  -3  -3  -5  -3  -1  -2  -7  -5  -2  -2  -3  -3 -11
-* -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM80 b/Butterfly/src/src/jaligner/matrix/matrices/PAM80
deleted file mode 100644
index 55aa043..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM80
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 80 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -2.55, Entropy = 1.44 bits
-#
-# Lowest score = -11, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   4  -4  -1  -1  -4  -2  -1   0  -4  -2  -4  -4  -3  -5   0   1   1  -8  -5   0  -1  -1  -1 -11
-R  -4   7  -2  -5  -5   0  -4  -6   0  -3  -5   2  -2  -6  -2  -1  -3   0  -7  -5  -3  -1  -3 -11
-N  -1  -2   5   3  -6  -1   0  -1   2  -3  -5   0  -4  -5  -3   1   0  -5  -3  -4   4   0  -1 -11
-D  -1  -5   3   6  -9   0   4  -1  -1  -4  -7  -2  -6  -9  -4  -1  -2 -10  -7  -5   5   2  -3 -11
-C  -4  -5  -6  -9   9  -9  -9  -6  -5  -4  -9  -9  -8  -8  -5  -1  -4 -10  -2  -3  -7  -9  -5 -11
-Q  -2   0  -1   0  -9   7   2  -4   2  -4  -3  -1  -2  -8  -1  -3  -3  -8  -7  -4   0   5  -2 -11
-E  -1  -4   0   4  -9   2   6  -2  -2  -3  -6  -2  -4  -9  -3  -2  -3 -11  -6  -4   2   5  -2 -11
-G   0  -6  -1  -1  -6  -4  -2   6  -5  -6  -7  -4  -5  -6  -3   0  -2 -10  -8  -3  -1  -2  -3 -11
-H  -4   0   2  -1  -5   2  -2  -5   8  -5  -4  -3  -5  -3  -2  -3  -4  -4  -1  -4   0   1  -2 -11
-I  -2  -3  -3  -4  -4  -4  -3  -6  -5   7   1  -4   1   0  -5  -4  -1  -8  -3   3  -4  -4  -2 -11
-L  -4  -5  -5  -7  -9  -3  -6  -7  -4   1   6  -5   2   0  -4  -5  -4  -3  -4   0  -6  -4  -3 -11
-K  -4   2   0  -2  -9  -1  -2  -4  -3  -4  -5   6   0  -9  -4  -2  -1  -7  -6  -5  -1  -1  -3 -11
-M  -3  -2  -4  -6  -8  -2  -4  -5  -5   1   2   0   9  -2  -5  -3  -2  -7  -6   1  -5  -3  -2 -11
-F  -5  -6  -5  -9  -8  -8  -9  -6  -3   0   0  -9  -2   8  -7  -4  -5  -2   4  -4  -7  -8  -5 -11
-P   0  -2  -3  -4  -5  -1  -3  -3  -2  -5  -4  -4  -5  -7   7   0  -2  -9  -8  -3  -3  -2  -2 -11
-S   1  -1   1  -1  -1  -3  -2   0  -3  -4  -5  -2  -3  -4   0   4   2  -3  -4  -3   0  -2  -1 -11
-T   1  -3   0  -2  -4  -3  -3  -2  -4  -1  -4  -1  -2  -5  -2   2   5  -8  -4  -1  -1  -3  -1 -11
-W  -8   0  -5 -10 -10  -8 -11 -10  -4  -8  -3  -7  -7  -2  -9  -3  -8  13  -2 -10  -7  -9  -7 -11
-Y  -5  -7  -3  -7  -2  -7  -6  -8  -1  -3  -4  -6  -6   4  -8  -4  -4  -2   9  -5  -4  -6  -4 -11
-V   0  -5  -4  -5  -3  -4  -4  -3  -4   3   0  -5   1  -4  -3  -3  -1 -10  -5   6  -4  -4  -2 -11
-B  -1  -3   4   5  -7   0   2  -1   0  -4  -6  -1  -5  -7  -3   0  -1  -7  -4  -4   5   2  -2 -11
-Z  -1  -1   0   2  -9   5   5  -2   1  -4  -4  -1  -3  -8  -2  -2  -3  -9  -6  -4   2   5  -2 -11
-X  -1  -3  -1  -3  -5  -2  -2  -3  -2  -2  -3  -3  -2  -5  -2  -1  -1  -7  -4  -2  -2  -2  -3 -11
-* -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11 -11   1
diff --git a/Butterfly/src/src/jaligner/matrix/matrices/PAM90 b/Butterfly/src/src/jaligner/matrix/matrices/PAM90
deleted file mode 100644
index fa2d5b3..0000000
--- a/Butterfly/src/src/jaligner/matrix/matrices/PAM90
+++ /dev/null
@@ -1,34 +0,0 @@
-#
-# This matrix was produced by "pam" Version 1.0.6 [28-Jul-93]
-#
-# PAM 90 substitution matrix, scale = ln(2)/2 = 0.346574
-#
-# Expected score = -2.26, Entropy = 1.30 bits
-#
-# Lowest score = -10, Highest score = 13
-#
-    A   R   N   D   C   Q   E   G   H   I   L   K   M   F   P   S   T   W   Y   V   B   Z   X   *
-A   4  -4  -1  -1  -3  -2   0   0  -4  -2  -3  -3  -2  -5   0   1   1  -8  -5   0  -1  -1  -1 -10
-R  -4   7  -2  -5  -5   0  -4  -5   1  -3  -5   2  -2  -6  -1  -1  -3   0  -6  -4  -3  -1  -2 -10
-N  -1  -2   5   3  -6  -1   0  -1   2  -3  -4   1  -4  -5  -2   1   0  -5  -2  -4   4   0  -1 -10
-D  -1  -5   3   6  -8   0   4  -1  -1  -4  -7  -2  -5  -8  -4  -1  -2  -9  -6  -4   5   3  -2 -10
-C  -3  -5  -6  -8   9  -8  -8  -5  -5  -3  -9  -8  -8  -7  -5  -1  -4 -10  -1  -3  -7  -8  -5 -10
-Q  -2   0  -1   0  -8   6   2  -3   2  -4  -3  -1  -2  -7  -1  -2  -3  -7  -6  -4   0   5  -2 -10
-E   0  -4   0   4  -8   2   6  -1  -1  -3  -5  -2  -4  -8  -2  -2  -2 -10  -6  -3   2   5  -2 -10
-G   0  -5  -1  -1  -5  -3  -1   5  -5  -5  -6  -4  -5  -6  -3   0  -2  -9  -8  -3  -1  -2  -2 -10
-H  -4   1   2  -1  -5   2  -1  -5   8  -5  -3  -2  -5  -3  -2  -3  -3  -4  -1  -4   1   1  -2 -10
-I  -2  -3  -3  -4  -3  -4  -3  -5  -5   6   1  -3   1   0  -4  -3   0  -8  -3   3  -3  -3  -2 -10
-L  -3  -5  -4  -7  -9  -3  -5  -6  -3   1   6  -5   2   0  -4  -5  -3  -3  -3   0  -5  -4  -3 -10
-K  -3   2   1  -2  -8  -1  -2  -4  -2  -3  -5   5   0  -8  -3  -1  -1  -6  -6  -5   0  -1  -2 -10
-M  -2  -2  -4  -5  -8  -2  -4  -5  -5   1   2   0   9  -1  -4  -3  -2  -7  -6   1  -5  -3  -2 -10
-F  -5  -6  -5  -8  -7  -7  -8  -6  -3   0   0  -8  -1   8  -6  -4  -5  -2   4  -4  -6  -8  -4 -10
-P   0  -1  -2  -4  -5  -1  -2  -3  -2  -4  -4  -3  -4  -6   7   0  -1  -8  -8  -3  -3  -2  -2 -10
-S   1  -1   1  -1  -1  -2  -2   0  -3  -3  -5  -1  -3  -4   0   4   2  -3  -4  -3   0  -2  -1 -10
-T   1  -3   0  -2  -4  -3  -2  -2  -3   0  -3  -1  -2  -5  -1   2   5  -7  -4  -1  -1  -2  -1 -10
-W  -8   0  -5  -9 -10  -7 -10  -9  -4  -8  -3  -6  -7  -2  -8  -3  -7  13  -2  -9  -7  -8  -6 -10
-Y  -5  -6  -2  -6  -1  -6  -6  -8  -1  -3  -3  -6  -6   4  -8  -4  -4  -2   9  -4  -4  -6  -4 -10
-V   0  -4  -4  -4  -3  -4  -3  -3  -4   3   0  -5   1  -4  -3  -3  -1  -9  -4   6  -4  -3  -2 -10
-B  -1  -3   4   5  -7   0   2  -1   1  -3  -5   0  -5  -6  -3   0  -1  -7  -4  -4   4   2  -2 -10
-Z  -1  -1   0   3  -8   5   5  -2   1  -3  -4  -1  -3  -8  -2  -2  -2  -8  -6  -3   2   5  -2 -10
-X  -1  -2  -1  -2  -5  -2  -2  -2  -2  -2  -3  -2  -2  -4  -2  -1  -1  -6  -4  -2  -2  -2  -2 -10
-* -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10 -10   1
diff --git a/Butterfly/src/src/jaligner/matrix/package.html b/Butterfly/src/src/jaligner/matrix/package.html
deleted file mode 100644
index 4024755..0000000
--- a/Butterfly/src/src/jaligner/matrix/package.html
+++ /dev/null
@@ -1,8 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-<html>
-<head><!--$Id: package.html,v 1.1 2005/05/25 19:56:30 ahmed Exp $--></head>
-<body bgcolor="white">
-Scoring matrices package.
- at author Ahmed Moustafa (ahmed at users.sf.net)
-</body>
-</html>
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/package.html b/Butterfly/src/src/jaligner/package.html
deleted file mode 100644
index c71d65c..0000000
--- a/Butterfly/src/src/jaligner/package.html
+++ /dev/null
@@ -1,8 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-<html>
-<head><!--$Id: package.html,v 1.1 2005/05/25 19:56:30 ahmed Exp $--></head>
-<body bgcolor="white">
-Core classes for the implementation of Smith-Waterman-Gotoh algorithm
- at author Ahmed Moustafa (ahmed at users.sf.net)
-</body>
-</html>
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/test/NeedlemanWunschGotohTester.java b/Butterfly/src/src/jaligner/test/NeedlemanWunschGotohTester.java
deleted file mode 100644
index 7ee3516..0000000
--- a/Butterfly/src/src/jaligner/test/NeedlemanWunschGotohTester.java
+++ /dev/null
@@ -1,131 +0,0 @@
-/*
- * $Id: NeedlemanWunschGotohTester.java,v 1.1 2006/02/03 05:00:22 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.test;
-
-import jaligner.Alignment;
-import jaligner.NeedlemanWunschGotoh;
-import jaligner.Sequence;
-import jaligner.formats.Format;
-import jaligner.formats.Pair;
-import jaligner.matrix.Matrix;
-import jaligner.matrix.MatrixLoader;
-
-import java.util.ArrayList;
-import java.util.Iterator;
-import java.util.Random;
-
-/**
- * Testing the scores of the alignments of {@link jaligner.NeedlemanWunschGotoh}.
- * 
- * @author Bram Minnaert
- */
-
-public class NeedlemanWunschGotohTester {
-
-    public static void main(String[] args) {
-
-        int numberOfTests = Integer.parseInt(args[0]);
-        int sequencesSize = Integer.parseInt(args[1]);
-        Random random = new Random();
-        Format format = new Pair();
-
-        try {
-            ArrayList matrices = new ArrayList();
-            for (Iterator i = MatrixLoader.list().iterator(); i.hasNext();) {
-                matrices.add(i.next());
-            }
-            int countOfMatrices = matrices.size();
-
-            int i = 1;
-            while (i <= numberOfTests) {
-
-                System.gc();
-
-                String s1 = RandomSequenceGenerator.generate(sequencesSize);
-                String s2 = RandomSequenceGenerator.generate(sequencesSize);
-
-                int o = random.nextInt(50);
-                int e = random.nextInt(10);
-
-                if (s1.length() > 0 && s2.length() > 0 && o >= e) {
-
-                    Matrix matrix = (Matrix) MatrixLoader
-                            .load((String) matrices.get(random
-                                    .nextInt(countOfMatrices)));
-                    Sequence seq1 = new Sequence(s1);
-                    Sequence seq2 = new Sequence(s2);
-
-                    Alignment alignment1 = NeedlemanWunschGotoh.align(seq1,
-                            seq2, matrix, o, e);
-
-                    if (!alignment1.checkScore()) {
-                        System.err.println("Invalid alignment found:");
-                        System.err.println("Sequence 1 = " + s1);
-                        System.err.println("Sequence 2 = " + s2);
-                        System.err.println(format.format(alignment1));
-                        System.err.println(alignment1.getSummary());
-                        System.err
-                                .println("The score of the alignment above is: "
-                                        + alignment1.calculateScore());
-                        System.exit(1);
-                    }
-
-                    Alignment alignment2 = NeedlemanWunschGotoh.align(seq2,
-                            seq1, matrix, o, e);
-                    if (!alignment1.checkScore()) {
-                        System.err.println("Invalid alignment found:");
-                        System.err.println("Sequence 1 = " + s2);
-                        System.err.println("Sequence 2 = " + s1);
-                        System.err.println(format.format(alignment2));
-                        System.err.println(alignment2.getSummary());
-                        System.err
-                                .println("The score of the alignment above is: "
-                                        + alignment2.calculateScore());
-                        System.exit(1);
-                    }
-
-                    if (alignment1.getScore() != alignment2.getScore()) {
-                        System.err.println("Not symmetric alignment:");
-
-                        System.err.println("Alignment #1: ");
-                        System.err.println("Sequence 1 = " + s1);
-                        System.err.println("Sequence 2 = " + s2);
-                        System.err.println(format.format(alignment1));
-                        System.err.println(alignment1.getSummary());
-
-                        System.err.println();
-
-                        System.err.println("Alignment #2: ");
-                        System.err.println("Sequence 1 = " + s2);
-                        System.err.println("Sequence 2 = " + s1);
-                        System.err.println(format.format(alignment2));
-                        System.err.println(alignment2.getSummary());
-
-                        System.exit(1);
-                    }
-                }
-                System.out.println("Processed " + i + "/" + numberOfTests);
-                i++;
-            }
-        } catch (Exception e) {
-            e.printStackTrace();
-            System.exit(1);
-        }
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/test/NeedlemanWunschTester.java b/Butterfly/src/src/jaligner/test/NeedlemanWunschTester.java
deleted file mode 100644
index d2ca49a..0000000
--- a/Butterfly/src/src/jaligner/test/NeedlemanWunschTester.java
+++ /dev/null
@@ -1,129 +0,0 @@
-/*
- * $Id: NeedlemanWunschTester.java,v 1.4 2006/02/03 05:00:22 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.test;
-
-import jaligner.Alignment;
-import jaligner.NeedlemanWunsch;
-import jaligner.Sequence;
-import jaligner.formats.Format;
-import jaligner.formats.Pair;
-import jaligner.matrix.Matrix;
-import jaligner.matrix.MatrixLoader;
-
-import java.util.ArrayList;
-import java.util.Iterator;
-import java.util.Random;
-
-/**
- * Testing the scores of the alignments of {@link jaligner.NeedlemanWunsch}.
- * 
- * @author Ahmed Moustafa
- */
-
-public class NeedlemanWunschTester {
-
-    public static void main(String[] args) {
-
-        int numberOfTests = Integer.parseInt(args[0]);
-        int sequencesSize = Integer.parseInt(args[1]);
-        Random random = new Random();
-        Format format = new Pair();
-
-        try {
-            ArrayList matrices = new ArrayList();
-            for (Iterator i = MatrixLoader.list().iterator(); i.hasNext();) {
-                matrices.add(i.next());
-            }
-            int countOfMatrices = matrices.size();
-
-            int i = 1;
-            while (i <= numberOfTests) {
-                System.gc();
-
-                String s1 = RandomSequenceGenerator.generate(sequencesSize);
-                String s2 = RandomSequenceGenerator.generate(sequencesSize);
-
-                float gap = random.nextInt(1000);
-
-                if (s1.length() > 0 && s2.length() > 0) {
-
-                    Matrix matrix = (Matrix) MatrixLoader
-                            .load((String) matrices.get(random
-                                    .nextInt(countOfMatrices)));
-                    Sequence seq1 = new Sequence(s1);
-                    Sequence seq2 = new Sequence(s2);
-
-                    Alignment alignment1 = NeedlemanWunsch.align(seq1, seq2,
-                            matrix, gap);
-
-                    if (!alignment1.checkScore()) {
-                        System.out.println("Invalid alignment found:");
-                        System.out.println("Sequence 1 = " + s1);
-                        System.out.println("Sequence 2 = " + s2);
-                        System.out.println(format.format(alignment1));
-                        System.out.println(alignment1.getSummary());
-                        System.out
-                                .println("The score of the alignment above is: "
-                                        + alignment1.calculateScore());
-                        System.exit(1);
-                    }
-
-                    Alignment alignment2 = NeedlemanWunsch.align(seq2, seq1,
-                            matrix, gap);
-                    if (!alignment1.checkScore()) {
-                        System.out.println("Invalid alignment found:");
-                        System.out.println("Sequence 1 = " + s2);
-                        System.out.println("Sequence 2 = " + s1);
-                        System.out.println(format.format(alignment2));
-                        System.out.println(alignment2.getSummary());
-                        System.out
-                                .println("The score of the alignment above is: "
-                                        + alignment2.calculateScore());
-                        System.exit(1);
-                    }
-
-                    if (alignment1.getScore() != alignment2.getScore()) {
-                        System.out.println("Not symmetric alignment:");
-
-                        System.out.println("Alignment #1: ");
-                        System.out.println("Sequence 1 = " + s1);
-                        System.out.println("Sequence 2 = " + s2);
-                        System.out.println(format.format(alignment1));
-                        System.out.println(alignment1.getSummary());
-
-                        System.out.println();
-
-                        System.out.println("Alignment #2: ");
-                        System.out.println("Sequence 1 = " + s2);
-                        System.out.println("Sequence 2 = " + s1);
-                        System.out.println(format.format(alignment2));
-                        System.out.println(alignment2.getSummary());
-
-                        System.exit(1);
-                    }
-                }
-                System.out.println("Processed " + i + "/" + numberOfTests);
-                i++;
-            }
-        } catch (Exception e) {
-            e.printStackTrace();
-            System.exit(1);
-        }
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/test/RandomSequenceGenerator.java b/Butterfly/src/src/jaligner/test/RandomSequenceGenerator.java
deleted file mode 100644
index fb531d8..0000000
--- a/Butterfly/src/src/jaligner/test/RandomSequenceGenerator.java
+++ /dev/null
@@ -1,77 +0,0 @@
-/*
- * $Id: RandomSequenceGenerator.java,v 1.3 2006/02/03 05:00:22 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.test;
-
-import java.util.Random;
-
-/**
- * This class contains a random generator for protein sequences.
- * 
- * @author Bram Minnaert
- */
-
-public class RandomSequenceGenerator {
-
-    /**
-     * All possible characters
-     */
-    private static final char[] CHARS = { 'A', 'R', 'N', 'D', 'C', 'Q', 'E',
-            'G', 'H', 'I', 'L', 'K', 'M', 'F', 'P', 'S', 'T', 'W', 'Y', 'V' };
-
-    /**
-     * Number of possible characters
-     */
-    private static final int NUMBER_OF_CHARS = CHARS.length;
-
-    /**
-     * Random generator
-     */
-    private static Random random = new Random();
-
-    /**
-     * Returns random sequence
-     * 
-     * @param length
-     *            Size of the sequence
-     * @return Random sequence
-     */
-    public static String generate(int length) {
-        StringBuffer buffer = new StringBuffer();
-        char randomChar;
-        int randomInt;
-        for (int i = 0; i < length; i++) {
-            randomInt = random.nextInt(NUMBER_OF_CHARS);
-            randomChar = CHARS[randomInt];
-            buffer.append(randomChar);
-        }
-        return buffer.toString();
-    }
-
-    /**
-     * Displays 10 random protein sequences with length 50.
-     * 
-     * @param args
-     *            no args
-     */
-    public static void main(String[] args) {
-        for (int i = 0; i < 10; i++) {
-            System.out.println("S" + i + " = " + generate(50));
-        }
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/test/SmithWatermanGotohTester.java b/Butterfly/src/src/jaligner/test/SmithWatermanGotohTester.java
deleted file mode 100644
index 50c9995..0000000
--- a/Butterfly/src/src/jaligner/test/SmithWatermanGotohTester.java
+++ /dev/null
@@ -1,131 +0,0 @@
-/*
- * $Id: SmithWatermanGotohTester.java,v 1.1 2006/02/03 05:00:22 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.test;
-
-import jaligner.Alignment;
-import jaligner.Sequence;
-import jaligner.SmithWatermanGotoh;
-import jaligner.formats.Format;
-import jaligner.formats.Pair;
-import jaligner.matrix.Matrix;
-import jaligner.matrix.MatrixLoader;
-
-import java.util.ArrayList;
-import java.util.Iterator;
-import java.util.Random;
-
-/**
- * Testing the scores of the alignments of {@link jaligner.SmithWatermanGotoh}.
- * 
- * @author Bram Minnaert
- */
-
-public class SmithWatermanGotohTester {
-
-    public static void main(String[] args) {
-
-        int numberOfTests = Integer.parseInt(args[0]);
-        int sequencesSize = Integer.parseInt(args[1]);
-        Random random = new Random();
-        Format format = new Pair();
-
-        try {
-            ArrayList matrices = new ArrayList();
-            for (Iterator i = MatrixLoader.list().iterator(); i.hasNext();) {
-                matrices.add(i.next());
-            }
-            int countOfMatrices = matrices.size();
-
-            int i = 1;
-            while (i <= numberOfTests) {
-
-                System.gc();
-
-                String s1 = RandomSequenceGenerator.generate(sequencesSize);
-                String s2 = RandomSequenceGenerator.generate(sequencesSize);
-
-                int o = random.nextInt(50);
-                int e = random.nextInt(10);
-
-                if (s1.length() > 0 && s2.length() > 0 && o >= e) {
-
-                    Matrix matrix = (Matrix) MatrixLoader
-                            .load((String) matrices.get(random
-                                    .nextInt(countOfMatrices)));
-                    Sequence seq1 = new Sequence(s1);
-                    Sequence seq2 = new Sequence(s2);
-
-                    Alignment alignment1 = SmithWatermanGotoh.align(seq1, seq2,
-                            matrix, o, e);
-
-                    if (!alignment1.checkScore()) {
-                        System.err.println("Invalid alignment found:");
-                        System.err.println("Sequence 1 = " + s1);
-                        System.err.println("Sequence 2 = " + s2);
-                        System.err.println(format.format(alignment1));
-                        System.err.println(alignment1.getSummary());
-                        System.err
-                                .println("The score of the alignment above is: "
-                                        + alignment1.calculateScore());
-                        System.exit(1);
-                    }
-
-                    Alignment alignment2 = SmithWatermanGotoh.align(seq2, seq1,
-                            matrix, o, e);
-                    if (!alignment1.checkScore()) {
-                        System.err.println("Invalid alignment found:");
-                        System.err.println("Sequence 1 = " + s2);
-                        System.err.println("Sequence 2 = " + s1);
-                        System.err.println(format.format(alignment2));
-                        System.err.println(alignment2.getSummary());
-                        System.err
-                                .println("The score of the alignment above is: "
-                                        + alignment2.calculateScore());
-                        System.exit(1);
-                    }
-
-                    if (alignment1.getScore() != alignment2.getScore()) {
-                        System.err.println("Not symmetric alignment:");
-
-                        System.err.println("Alignment #1: ");
-                        System.err.println("Sequence 1 = " + s1);
-                        System.err.println("Sequence 2 = " + s2);
-                        System.err.println(format.format(alignment1));
-                        System.err.println(alignment1.getSummary());
-
-                        System.err.println();
-
-                        System.err.println("Alignment #2: ");
-                        System.err.println("Sequence 1 = " + s2);
-                        System.err.println("Sequence 2 = " + s1);
-                        System.err.println(format.format(alignment2));
-                        System.err.println(alignment2.getSummary());
-
-                        System.exit(1);
-                    }
-                }
-                System.out.println("Processed " + i + "/" + numberOfTests);
-                i++;
-            }
-        } catch (Exception e) {
-            e.printStackTrace();
-            System.exit(1);
-        }
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/test/package.html b/Butterfly/src/src/jaligner/test/package.html
deleted file mode 100644
index 01d9547..0000000
--- a/Butterfly/src/src/jaligner/test/package.html
+++ /dev/null
@@ -1,8 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-<html>
-<head><!--$Id: package.html,v 1.1 2005/05/25 19:56:30 ahmed Exp $--></head>
-<body bgcolor="white">
-Testing package.
- at author Bram Minnaert
-</body>
-</html>
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/ui/filechooser/NamedInputStream.java b/Butterfly/src/src/jaligner/ui/filechooser/NamedInputStream.java
deleted file mode 100644
index c03752f..0000000
--- a/Butterfly/src/src/jaligner/ui/filechooser/NamedInputStream.java
+++ /dev/null
@@ -1,67 +0,0 @@
-/*
- * $Id: NamedInputStream.java,v 1.1 2005/05/25 19:56:22 ahmed Exp $
- * 
- * This program inputStream 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 inputStream 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.
- */
-
-package jaligner.ui.filechooser;
-
-import java.io.InputStream;
-import java.io.Serializable;
-
-/**
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class NamedInputStream extends Object implements Serializable {
-    
-    /**
-     * 
-     */
-    private static final long serialVersionUID = 3256441404384686387L;
-
-    /**
-     * Name.
-     */
-    private String name = null;
-    
-    /**
-     * Input stream.
-     */
-    private InputStream inputStream = null;
-    
-    /**
-     * 
-     */
-    public NamedInputStream(String name, InputStream inputStream) {
-        this.name = name;
-        this.inputStream = inputStream;
-    }
-    
-    /**
-     * @return Returns the inputStream.
-     */
-    public InputStream getInputStream() {
-        return this.inputStream;
-    }
-    
-    /**
-     * @return Returns the name.
-     */
-    public String getName() {
-        return this.name;
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/util/Commons.java b/Butterfly/src/src/jaligner/util/Commons.java
deleted file mode 100644
index 1132e99..0000000
--- a/Butterfly/src/src/jaligner/util/Commons.java
+++ /dev/null
@@ -1,222 +0,0 @@
-/*
- * $Id: Commons.java,v 1.3 2006/07/27 16:28:24 ahmed Exp $
- * 
- * 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.
- */
-
-package jaligner.util;
-
-import java.net.JarURLConnection;
-import java.net.URL;
-import java.util.jar.Attributes;
-import java.util.jar.JarFile;
-import java.util.jar.Manifest;
-import java.util.logging.Level;
-import java.util.logging.Logger;
-
-/**
- * Global constants/variables/settings
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public abstract class Commons {
-	/**
-	 * Tab
-	 */
-	public static final String TAB = "\t";
-
-	/**
-	 * Logger
-	 */
-	private static final Logger logger = Logger.getLogger(Commons.class
-			.getName());
-
-	/**
-	 * Build timestamp attribute in the manifest in the jar
-	 */
-	private static final String BUILD_TIMESTAMP = "Created-At";
-
-	/**
-	 *  
-	 */
-	private static final String currentRelease = "TrinityVersion"; // getManifestBuildTimestamp();
-
-	/**
-	 * Default home directory
-	 */
-	private static final String DEFAULT_USER_DIRECTORY = ".";
-
-	/**
-	 * Default file separator
-	 */
-	private static final String DEFAULT_FILE_SEPARATOR = "/";
-
-	/**
-	 * Default line separator
-	 */
-	private static final String DEFAULT_LINE_SEPARATOR = "\r\n";
-
-	/**
-	 * User home directory
-	 */
-	private static String userDirectory = DEFAULT_USER_DIRECTORY;
-	static {
-		try {
-			userDirectory = System.getProperty("user.dir");
-		} catch (Exception e) {
-			logger.log(Level.WARNING, "Failed getting user current directory: "
-					+ e.getMessage(), e);
-		}
-	}
-
-	/**
-	 * Line separator
-	 */
-	private static String fileSeparator = DEFAULT_FILE_SEPARATOR;
-	static {
-		try {
-			fileSeparator = System.getProperty("file.separator");
-		} catch (Exception e) {
-			logger.log(Level.WARNING, "Failed getting system file separator: "
-					+ e.getMessage(), e);
-		}
-	}
-
-	/**
-	 * Line separator
-	 */
-	private static String lineSeparator = DEFAULT_LINE_SEPARATOR;
-
-	static {
-		try {
-			lineSeparator = System.getProperty("line.separator");
-		} catch (Exception e) {
-			logger.log(Level.WARNING, "Failed getting system line separator: "
-					+ e.getMessage(), e);
-		}
-	}
-
-	/**
-	 * JNLP enabled
-	 */
-	private static boolean jnlp = false;
-	static {
-		try {
-			jnlp = "true".equalsIgnoreCase(System.getProperty("jnlp.enabled"));
-		} catch (Exception e) {
-			logger.log(Level.WARNING, "Failed getting jnlp enabled property: "
-					+ e.getMessage(), e);
-		}
-		setJnlp(jnlp);
-	}
-
-	/**
-	 * Returns system file separator.
-	 * 
-	 * @return file separator
-	 */
-	public static String getFileSeparator() {
-		return fileSeparator;
-	}
-
-	/**
-	 * Returns system line separator.
-	 * 
-	 * @return line separator
-	 */
-	public static String getLineSeparator() {
-		return lineSeparator;
-	}
-
-	/**
-	 * Returns user's current directory.
-	 * 
-	 * @return user's current directory
-	 */
-	public static String getUserDirectory() {
-		return userDirectory;
-	}
-
-	/**
-	 * Sets the JNLP flag to true of false
-	 * 
-	 * @param jnlp
-	 *            true or false
-	 */
-	public static void setJnlp(boolean jnlp) {
-		Commons.jnlp = jnlp;
-	}
-
-	/**
-	 * Returns true if jnlp is enabled
-	 * 
-	 * @return true if jnlp is enabled, otherwise returns false
-	 */
-	public static boolean isJnlp() {
-		return jnlp;
-	}
-
-	/**
-	 * Gets the build teimstamp from the jar manifest
-	 * 
-	 * @return build timestamp
-	 */
-	private static String getManifestBuildTimestamp() {
-		JarURLConnection connection = null;
-		JarFile jarFile = null;
-		URL url = Commons.class.getClassLoader().getResource("jaligner");
-		try {
-			// Get jar connection
-			connection = (JarURLConnection) url.openConnection();
-
-			// Get the jar file
-			jarFile = connection.getJarFile();
-
-			// Get the manifest
-			Manifest manifest = jarFile.getManifest();
-
-			// Get the manifest entries
-			Attributes attributes = manifest.getMainAttributes();
-
-			Attributes.Name name = new Attributes.Name(BUILD_TIMESTAMP);
-			return attributes.getValue(name);
-		} catch (Exception e) {
-			String message = "Failed getting the current release info: "
-					+ e.getMessage();
-			logger.log(Level.WARNING, message);
-		}
-		return null;
-	}
-
-	/**
-	 * Returns the current release version of JAligner
-	 * 
-	 * @return current release
-	 */
-	public static String getCurrentRelease() {
-		return currentRelease;
-	}
-
-	/**
-	 * Returns information about JAligner
-	 * 
-	 * @return information about JAligner
-	 */
-	public static String getJAlignerInfo() {
-		return "JAligner - Build: " + getCurrentRelease()
-				+ " - By: Ahmed Moustafa (ahmed at users.sf.net)";
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/util/SequenceParser.java b/Butterfly/src/src/jaligner/util/SequenceParser.java
deleted file mode 100644
index 27ee681..0000000
--- a/Butterfly/src/src/jaligner/util/SequenceParser.java
+++ /dev/null
@@ -1,215 +0,0 @@
-/*
- * @author Ahmed Moustafa (ahmed at users.sourceforge.net)
- * 
- * 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.
- */
-
-package jaligner.util;
-
-
-import jaligner.Sequence;
-
-import java.io.BufferedReader;
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.InputStreamReader;
-import java.util.StringTokenizer;
-import java.util.logging.Level;
-import java.util.logging.Logger;
-
-/**
- * SequenceParser to sequences from different formats.
- * <br>
- * Currently the supported formats are:
- * <ul>
- * <li>Plain sequence</li>
- * <li><a href="http://www.ncbi.nlm.nih.gov/BLAST/fasta.html">Sequence</a></li>
- * </ul>
- *
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class SequenceParser {
-    
-    /**
-     * Logger
-     */
-    private static final Logger logger = Logger.getLogger(SequenceParser.class.getName());
-	
-	/**
-	 * Returns a parsed Sequence from a string.
-	 * @param sequence string to parse
-	 * @return parsed sequence
-	 * @throws SequenceParserException
-	 * @see Sequence
-	 */
-	public static Sequence parse (String sequence) throws SequenceParserException {
-		if (sequence == null) {
-			throw new SequenceParserException ( "Null sequence" );
-		}
-
-		if (sequence.trim().length() == 0) {
-			throw new SequenceParserException ( "Empty sequence" );
-		}
-		
-		sequence = sequence.replaceAll("\r\n", "\n");
-		
-		String sequenceName = null;
-		String sequenceDescription = null;
-		
-		if (sequence.startsWith(">")) {
-			// FASTA format
-			int index = sequence.indexOf("\n");
-				
-			if (index == -1) {
-				throw new SequenceParserException ( "Invalid sequence format" );
-			}
-				
-			String first = sequence.substring(1, index);
-			sequence = sequence.substring(index);
-				
-			index = 0;
-			for (int i = 0; i < first.length() && first.charAt(i) != ' ' && first.charAt(i) != '\t'; i++, index++) {
-			    // Skip white spaces
-			}
-			sequenceName = first.substring(0, index);
-			StringTokenizer stringTokenizer = new StringTokenizer(sequenceName, "|");
-			while (stringTokenizer.hasMoreTokens()) {
-				sequenceName = stringTokenizer.nextToken();
-			}
-			sequenceDescription = index + 1 > first.length() ? "" : first.substring(index + 1);
-		} else {
-			// Plain format ... nothing to do here
-		}
-		
-    	Sequence s = new Sequence(prepare(sequence), sequenceName, sequenceDescription, Sequence.PROTEIN);
-    	
-    	return s;
-	}
-
-	/**
-	 * Returns a Sequence parsed and loaded from a file
-	 * @param file to parse
-	 * @return parsed sequence 
-	 * @throws SequenceParserException
-	 * @see Sequence
-	 */
-	public static Sequence parse (File file) throws SequenceParserException {
-	    String sequenceName = null;
-		String sequenceDescription = null;
-		BufferedReader reader = null;
-		try {
-			reader = new BufferedReader(new InputStreamReader(new FileInputStream(file)));
-			StringBuffer buffer = new StringBuffer();
-			
-			// Read & parse the first line
-			String line = reader.readLine();
-				
-			if (line.startsWith(">")) {
-				// FASTA sequence
-				
-				line = line.substring(1).trim();
-				int index = 0;
-				for (int i = 0; i < line.length() && line.charAt(i) != ' ' && line.charAt(i) != '\t'; i++, index++) {
-				    // Skip white spaces
-				}
-				
-				sequenceName = line.substring(0, index);
-				StringTokenizer stringTokenizer = new StringTokenizer(sequenceName, "|");
-				while (stringTokenizer.hasMoreTokens()) {
-					sequenceName = stringTokenizer.nextToken();
-				}
-				sequenceDescription = index + 1 > line.length() ? "" : line.substring(index + 1);
-			} else {
-				// Plain sequence
-				buffer.append(prepare(line));
-			}
-			
-			// Read the remaining the file (the actual sequence)
-			while ((line = reader.readLine()) != null) {
-				buffer.append(prepare(line));
-			}
-			reader.close();
-	
-	    	Sequence s = new Sequence(buffer.toString(), sequenceName, sequenceDescription, Sequence.PROTEIN);
-	    	return s;
-		} catch (Exception e) {
-		    throw new SequenceParserException(e.getMessage());
-		} finally {
-		    if (reader != null) {
-		        try {
-		            reader.close();
-		        } catch (Exception silent) {
-		            logger.log(Level.WARNING, "Failed closing reader: " + silent.getMessage(), silent);
-		        }
-		    }
-		}
-    	
-	}
-
-	/**
-	 * Removes whitespaces from a sequence and validates other characters.
-	 * @param sequence sequence to be prepared
-	 * @return prepared array of characters
-	 * @throws SequenceParserException
-	 */
-	private static String prepare (String sequence) throws SequenceParserException {
-		StringBuffer buffer = new StringBuffer();
-		String copy = sequence.trim().toUpperCase();
-		
-		for (int i = 0, n = copy.length(); i < n; i++) {
-			switch ( copy.charAt(i) ) {
-				// skip whitespaces
-				case 9:
-				case 10:
-				case 13:
-				case 32: break;
-				
-				// add a valid character
-				case 'A':
-				case 'B':
-				case 'C':
-				case 'D':
-				case 'E':
-				case 'F':
-				case 'G':
-				case 'H':
-				case 'I':
-				case 'K':
-				case 'L':
-				case 'M':
-				case 'N':
-				case 'P':
-				case 'Q':
-				case 'R':
-				case 'S':
-				case 'T':
-				case 'U':
-				case 'V':
-				case 'W':
-				case 'Y':
-				case 'Z':
-				case 'X':
-				
-				case '-':
-				case '*': buffer.append(copy.charAt(i)); break;
-							
-				// throw an exception for anything else
-				default: throw new SequenceParserException( "Invalid sequence character: '" + copy.charAt(i) + "'"); 
-			}
-		}
-		return buffer.toString();
-	}
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/util/SequenceParserException.java b/Butterfly/src/src/jaligner/util/SequenceParserException.java
deleted file mode 100644
index 450169f..0000000
--- a/Butterfly/src/src/jaligner/util/SequenceParserException.java
+++ /dev/null
@@ -1,38 +0,0 @@
-/*
- * @author Ahmed Moustafa (ahmed at users.sourceforge.net)
- * 
- * 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.
- */
-
-package jaligner.util;
-
-/**
- * 
- * @author Ahmed Moustafa (ahmed at users.sf.net)
- */
-
-public class SequenceParserException extends Exception {
-    /**
-     * 
-     */
-    private static final long serialVersionUID = 3258417248288191543L;
-
-    /**
-     * @param message
-     */
-    public SequenceParserException(String message) {
-        super(message);
-    }
-}
\ No newline at end of file
diff --git a/Butterfly/src/src/jaligner/util/package.html b/Butterfly/src/src/jaligner/util/package.html
deleted file mode 100644
index d89358e..0000000
--- a/Butterfly/src/src/jaligner/util/package.html
+++ /dev/null
@@ -1,8 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-<html>
-<head><!--$Id: package.html,v 1.1 2005/05/25 19:56:30 ahmed Exp $--></head>
-<body bgcolor="white">
-Utility classes for helping core and GUI classes.
- at author Ahmed Moustafa (ahmed at users.sf.net)
-</body>
-</html>
\ No newline at end of file
diff --git a/Makefile b/Makefile
index 3ec8304..169e99d 100644
--- a/Makefile
+++ b/Makefile
@@ -50,7 +50,9 @@ clean:
 
 
 test_trinity:
-	cd sample_data/test_Trinity_Assembly && make test
+	cd sample_data/test_Trinity_Assembly && make test_trinity
+
+test_gg_trinity:
 	cd sample_data/test_GenomeGuidedTrinity && make test
 
 test_all:
diff --git a/Release.Notes b/Release.Notes
index 92ace01..c952654 100644
--- a/Release.Notes
+++ b/Release.Notes
@@ -1,5 +1,13 @@
 
-## pre-release v2.0.3
+# Release v2.0.4
+
+    -Trimmomatic symlink set w/ capital T
+    -additional testing built in
+    -use parallel samtools always (not just w/ v1.1, silly!)
+
+
+
+## Release v2.0.3
 
 
   -Trinity is by default less verbose.  For a more verbose run, use the new --verbose flag.
diff --git a/Trinity b/Trinity
index 2d76cfe..c27d31f 100755
--- a/Trinity
+++ b/Trinity
@@ -13,11 +13,13 @@ use Cwd;
 use Carp;
 use COMMON;
 use Getopt::Long qw(:config posix_default no_ignore_case pass_through); 
-use LWP::Simple;
 use Pipeliner;
 use Fasta_reader;
 
 
+my $VERSION = "v2.0.4"; 
+
+
 BEGIN {
 
     $ENV{TRINITY_HOME} = "$FindBin::Bin";
@@ -44,8 +46,6 @@ my $PARAFLY = "$ROOTDIR/trinity-plugins/parafly/bin/ParaFly";
 my $TRIMMOMATIC = "$ROOTDIR/trinity-plugins/Trimmomatic/trimmomatic.jar";
 my $TRIMMOMATIC_DIR = "$ROOTDIR/trinity-plugins/Trimmomatic";
 
-#&version_check();
-
 
 # Site specific setup
 
@@ -138,7 +138,6 @@ my $help_flag;
 my $advanced_help_flag;
 my $SHOW_CITATION_FLAG = 0;
 
-my $VERSION = "Trinity_v2.0.2"; 
 my $show_version_flag = 0;
 
 ## Kmer methods
@@ -294,6 +293,8 @@ my $full_usage = qq^
 #
 #  --no_cleanup                    :retain all intermediate input files.
 #
+#  --no_version_check              :dont run a network check to determine if software updates are available.
+#
 ####################################################
 # Inchworm and K-mer counting-related options: #####
 #
@@ -550,6 +551,8 @@ my $SEE = 0;
 
 my $ANANAS_DIR = "";
 
+my $NO_VERSION_CHECK = 0;
+
 
 &GetOptions( 
     
@@ -559,6 +562,8 @@ my $ANANAS_DIR = "";
             
     'verbose' => \$SEE,
  
+    'no_version_check' => \$NO_VERSION_CHECK,
+    
     ## general opts
     "seqType=s" => \$seqType,
     "left=s{,}" => \@left_files,
@@ -705,7 +710,8 @@ if ($help_flag) {
 }
 
 if ($show_version_flag) {
-    print "Trinity version: $VERSION\n";
+    &version_check();
+    
     exit(1);
 }
 
@@ -823,6 +829,11 @@ unless ($NO_RUN_INCHWORM_FLAG || $NO_RUN_CHRYSALIS_FLAG || $bypass_java_version_
   }
 }
 
+
+unless ($NO_VERSION_CHECK || $TRINITY_COMPLETE_FLAG) {
+    &version_check();
+}
+
 # Give the variable with memory size and a user-oriented name
 
 sub bfly_check {
@@ -916,13 +927,7 @@ elsif ($CUFFFLY_MODE) {
 
 
 
-my $PARALLEL_SAMTOOLS_SORT_TOKEN = "";
-{
-    my $samtools_version_info = `samtools 2>&1`;
-    if ($samtools_version_info =~ /Version: 1.1/) {
-	$PARALLEL_SAMTOOLS_SORT_TOKEN = "-\@ $CPU";
-    }
-}
+my $PARALLEL_SAMTOOLS_SORT_TOKEN = "-\@ $CPU";
 
 
 unless (basename($output_directory) =~ /trinity/i) {
@@ -939,7 +944,6 @@ if ($grid_conf_file) {
 
 main: {
     $ENV{OMP_NUM_THREADS} = $CPU;
-    
 
     unless ($NO_RUN_INCHWORM_FLAG || $NO_RUN_CHRYSALIS_FLAG) {
         print STDERR "-since butterfly will eventually be run, lets test for proper execution of java\n" if $SEE;
@@ -1437,7 +1441,7 @@ sub run_chrysalis {
             $pipeliner->add_commands( new Command($cmd, "$iworm_min100_fa_file.bowtie_build.ok"));
 
             my $bowtie_sam_file = "$chrysalis_output_dir/iworm.bowtie.nameSorted.bam";
-            $cmd = "bash -c \" set -o pipefail; bowtie -a -m 20 --best --strata --threads $CPU  --chunkmbs 512 -q -S -f $iworm_min100_fa_file $bowtie_reads_fa  | samtools view -F4 -Sb - | samtools sort $PARALLEL_SAMTOOLS_SORT_TOKEN -no - - > $bowtie_sam_file\" ";
+            $cmd = "bash -c \" set -o pipefail; bowtie -a -m 20 --best --strata --threads $CPU  --chunkmbs 512 -q -S -f $iworm_min100_fa_file $bowtie_reads_fa  | samtools view $PARALLEL_SAMTOOLS_SORT_TOKEN -F4 -Sb - | samtools sort $PARALLEL_SAMTOOLS_SORT_TOKEN -no - - > $bowtie_sam_file\" ";
             
             unless ($SEE) {
                 $cmd .= " 2>/dev/null";
@@ -2845,15 +2849,43 @@ sub add_fifo_for_gzip {
 }
 
 sub version_check {
-    my $content = get("http://rt-trinity.uits.indiana.edu/flask/version/" . $VERSION . "?timestamp=" . time);
-    if (defined $content) {
-        if ($content ne 'yes') {
-            print "Trinity version " . $content . " is available";
-        }
+    
+    print "Trinity version: $VERSION\n";
+    
+    my $url = "http://rt-trinity.uits.indiana.edu/flask/version/" . $VERSION . "?timestamp=" . time;
+    my $content = `curl --connect-timeout 10 -s "$url"`;
+    
+    ## get release info from here:
+    ## https://api.github.com/repos/trinityrnaseq/trinityrnaseq/releases
+
+    $url = "https://api.github.com/repos/trinityrnaseq/trinityrnaseq/releases";
+    $content = `curl --connect-timeout 10 -s "$url"`;
+    
+    if ($?) {
+        
+        print STDERR "-ERROR: couldn't run the network check to confirm latest Trinity software version.\n\n";
     }
     else {
-        print "Version check failed";
+        
+        if ($content =~ /\"tag_name\": \"([^\"]+)\"/) {
+            my $latest_version_tag = $1;
+            if ($VERSION eq '__TRINITY_VERSION_TAG__') {
+                print STDERR "-using Trinity devel version. Note, latest production release is: $latest_version_tag\n\n";
+            }
+            elsif ($latest_version_tag ne $VERSION) {
+                print "** NOTE: Latest version of Trinity is $latest_version_tag, and can be obtained at:\n"
+                    . "\thttps://github.com/trinityrnaseq/trinityrnaseq/releases\n\n";
+            }
+            else {
+                print STDERR "-currently using the latest production release of Trinity.\n\n";
+            }
+        }
+        else {
+            print STDERR "-ERROR: couldn't parse latest version tag info from github: $content\n\n";
+        }
     }
+    
+    return;
 }
 
 
diff --git a/sample_data/test_Trinity_Assembly/Makefile b/sample_data/test_Trinity_Assembly/Makefile
index 86f59c5..5658a5e 100644
--- a/sample_data/test_Trinity_Assembly/Makefile
+++ b/sample_data/test_Trinity_Assembly/Makefile
@@ -1,8 +1,14 @@
 
+test_trinity:
+	./runMe.sh
+
+
 test:
 	./runMe.sh
-	./misc_run_tests/runMe_no_qualTrim.sh
-	./__test_runMe_with_jaccard_clip.sh
+	./misc_run_tests/__test_runMe_include_normalization.sh
+	./misc_run_tests/__runMe_with_qual_trimming.sh
+	./misc_run_tests/__runMe_with_qual_trimming_and_normalization.sh
+	./misc_run_tests/__test_runMe_with_jaccard_clip.sh
 
 test_full:
 	./runMe.sh 1
diff --git a/sample_data/test_Trinity_Assembly/__test_runMe_with_jaccard_clip.sh b/sample_data/test_Trinity_Assembly/__test_runMe_with_jaccard_clip.sh
deleted file mode 100755
index 639b22d..0000000
--- a/sample_data/test_Trinity_Assembly/__test_runMe_with_jaccard_clip.sh
+++ /dev/null
@@ -1,6 +0,0 @@
-#!/bin/bash -ve
-
-../../Trinity --seqType fq --left reads.left.fq.gz --right reads.right.fq.gz --SS_lib_type RF  --CPU 2 --jaccard_clip --max_memory 1G --output trinity_w_jaccard
-
-
-
diff --git a/sample_data/test_Trinity_Assembly/cleanme.pl b/sample_data/test_Trinity_Assembly/cleanme.pl
index f1ade13..22d1b29 100755
--- a/sample_data/test_Trinity_Assembly/cleanme.pl
+++ b/sample_data/test_Trinity_Assembly/cleanme.pl
@@ -52,6 +52,8 @@ my %keep = map { + $_ => 1 } @files_to_keep;
 `rm -rf ./trinity_test_no_qtrim` if (-d "trinity_test_no_qtrim");
 `rm -rf ./trinity_w_jaccard` if (-d "trinity_w_jaccard");
 
+`rm -rf ./__test_trinity*`;
+
 
 foreach my $file (<*>) {
 	
diff --git a/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming.sh b/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming.sh
index 633427c..baf4560 100755
--- a/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming.sh
+++ b/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming.sh
@@ -16,7 +16,7 @@ fi
 #######################################################
 
 ## use jellyfish
-../../Trinity.pl --seqType fq --JM 2G --left reads.left.fq --right reads.right.fq --SS_lib_type RF --CPU 4 --trimmomatic
+../../Trinity --seqType fq --max_memory 2G --left reads.left.fq --right reads.right.fq --SS_lib_type RF --CPU 4 --trimmomatic --output __test_trinity_with_trimmomatic
 
 ##### Done Running Trinity #####
 
diff --git a/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming_and_normalization.sh b/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming_and_normalization.sh
index b57a688..32b2092 100755
--- a/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming_and_normalization.sh
+++ b/sample_data/test_Trinity_Assembly/misc_run_tests/__runMe_with_qual_trimming_and_normalization.sh
@@ -16,7 +16,7 @@ fi
 #######################################################
 
 ## use jellyfish
-../../Trinity.pl --seqType fq --JM 2G --left reads.left.fq --right reads.right.fq --SS_lib_type RF --CPU 4 --trimmomatic --normalize_reads
+../../Trinity --seqType fq --max_memory 2G --left reads.left.fq --right reads.right.fq --SS_lib_type RF --CPU 4 --trimmomatic --normalize_reads --output __test_trinity_qual_and_norm
 
 ##### Done Running Trinity #####
 
diff --git a/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_include_normalization.sh b/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_include_normalization.sh
index 66df7cf..2711e77 100755
--- a/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_include_normalization.sh
+++ b/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_include_normalization.sh
@@ -16,7 +16,7 @@ fi
 #######################################################
 
 ## use jellyfish
-../../Trinity.pl --seqType fq --JM 2G --left reads.left.fq --right reads.right.fq --SS_lib_type RF --CPU 4 --normalize_reads
+../../Trinity --seqType fq --max_memory 2G --left reads.left.fq --right reads.right.fq --SS_lib_type RF --CPU 4 --normalize_reads --output __test_trinity_w_normalization
 
 ##### Done Running Trinity #####
 
diff --git a/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_with_jaccard_clip.sh b/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_with_jaccard_clip.sh
index b2729cd..a8dedb8 100755
--- a/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_with_jaccard_clip.sh
+++ b/sample_data/test_Trinity_Assembly/misc_run_tests/__test_runMe_with_jaccard_clip.sh
@@ -1,6 +1,6 @@
 #!/bin/bash -ve
 
-../../Trinity.pl --seqType fq --left reads.left.fq.gz --right reads.right.fq.gz --SS_lib_type RF  --CPU 2 --jaccard_clip --JM 1G
+../../Trinity --seqType fq --left reads.left.fq.gz --right reads.right.fq.gz --SS_lib_type RF  --CPU 2 --jaccard_clip --max_memory 1G --output __test_trinity_w_jaccard
 
 
 
diff --git a/trinity-plugins/GAL_0.2.1/README b/trinity-plugins/GAL_0.2.1/README
deleted file mode 100644
index e1eee06..0000000
--- a/trinity-plugins/GAL_0.2.1/README
+++ /dev/null
@@ -1,6 +0,0 @@
-fasta_tool comes from:
-
-http://www.sequenceontology.org/software/GAL.html
-
-The Genome Annotation Library
-
diff --git a/trinity-plugins/GAL_0.2.1/fasta_tool b/trinity-plugins/GAL_0.2.1/fasta_tool
deleted file mode 100755
index b30727c..0000000
--- a/trinity-plugins/GAL_0.2.1/fasta_tool
+++ /dev/null
@@ -1,1053 +0,0 @@
-#!/usr/bin/env perl
-
-eval 'exec /usr/bin/perl  -S $0 ${1+"$@"}'
-    if 0; # not running under some shell
-
-eval 'exec /usr/bin/perl  -S $0 ${1+"$@"}'
-    if 0; # not running under some shell
-
-use strict;
-use warnings;
-use FindBin;
-use lib "$FindBin::Bin/../lib";
-use lib "$FindBin::Bin/../perl/lib";
-use Getopt::Long;
-use Bio::SeqIO;
-use IO::All;
-
-
-
-#-----------------------------------------------------------------------------
-#----------------------------------- MAIN ------------------------------------
-#-----------------------------------------------------------------------------
-my $usage = "
-
-Synopsis:
-
-fasta_tool [-options] fasta_file
-
-Description:
-The script takes a fasta file and can search it, reformat it, and manipulate it
-in a large variety of ways that can prove very very usful.  For options that
-provide the ability to evaluate code, use Perl.
-
-Options:
-  --summary
-      For functions that can report data for every sequence (nt_count),
-      use this flag to report only summary data for all sequences combined.
-
-  --chunks <integer>
-      Break up a single fasta file into the given number of chunks
-
-  --split
-      Split a multi-fasta into individual files.  One for each fasta.
-
-  --eval_code <code>
-      Run the given code on (\$seq_obj, \$sequence or \$header).  If the code
-      block returns a positive value then the sequence is printed.  This can be
-      used to build complex and custom filters.
-
-  --eval_all <code>
-      Run the given code on (\$seq_obj, \$sequence or \$header).  Prints all
-      sequences regardless of the return value of the evaled code.  This can
-      but used to perform operations (e.g. soft to hard masking with
-      s/[a-z]/N/g, but still print every sequence even if it's unaltered.
-
-  --extract_ids <id_file.txt>
-      Extract all of the sequences who's IDs are found in the given file.
-
-  --grep_header <pattern>
-      Grep through a multi fasta file and print out only the fasta
-      sequences that have a match in the header. Use grepv_header for
-      negation.
-
-  --grep_seq <pattern>
-      Grep throught a multi fasta file and print out only the fasta
-      sequences that have a match in the sequence. Use grepv_seq for
-      negation.
-
-  --wrap <integer>
-      Wrap the sequence output to a given number of columns.
-
-  --translate <string>
-      Translate a given nucleotide sequence to protein sequence.
-      Accepts 0,1,2 (for the phase) or 'maker' if you want to use the
-      frame from MAKER produced headers
-
-  --trim_maker_utr
-      Prints MAKER produced transcipts without the leading and trailing
-      UTR sequence
-
-  --seq_only
-      Print only the sequence (without the header) to STDOUT.  This
-      can also be accomplished with grep -v '>' fasta_file.
-
-  --nt_count
-      Print the number and percentage of every nt/aa found in the
-      sequence.
-
-  --length
-      Print the length of each sequence.
-
-  --total_length
-      Print the total length of all sequences.
-
-  --n50
-      Calculate the N-50 (http://en.wikipedia.org/wiki/N50_statistic)
-      of the sequences in the file.
-
-  --tab
-      Print the header and sequence on the same line separated by a tab.
-
-  --table
-      Print in table format rather than fasta format.
-
-  --print
-      Print the sequence.  Use in conjuction with 'wrap' or other formatting
-      commands to reformat the sequence.
-
-  --reverse
-      Reverse the order of the sequences in a fasta file.
-
-  --rev_seq
-      Reverse the order of the nt/aa in each sequence.
-
-  --comp_seq
-      Complement the nucleotide sequence.
-
-  --rev_comp
-      Reverse compliment a sequence.  Same as --rev_seq && --comp_seq together.
-
-  --uniq
-
-    Print only uniq sequences.  This method only compares complete
-    sequences.
-
-  --uniq_sub
-
-    Print only uniq sequences, but also check that shorter sequences
-    are not perfect substrings of longer sequences.
-
-  --shuffle_order
-      Randomize the order of sequences in a multi-fasta file.
-
-  --shuffle_seq
-      Randomize the order of the nt/aa in each sequence.
-
-  --shuffle_codon
-      Randomize the order of the codons in a nucleotide sequence.
-
-  --shuffle_pick
-      Pick a given number of sequences from a multi-fasta file.
-
-  --select
-      Pass in a file with IDs and return sequences with these IDs.
-
-  --remove
-      Pass in a file with IDs and remove sequences with these IDs.
-
-  --swap_ids
-      Pass in a file with two columns of IDs and map the IDs in the
-      fasta headers from the first column of the ID file to the second
-      column of the ID file.  If an ID in the fasta header is not found
-      in the first column of the ID file then issue a warning, but leave
-      the ID unmapped.
-
-  --fix_prot
-    Fix protein fasta files for use as blast database.  Removes spaces
-    and '*' and replaces any non amino acid codes with C.
-
-  --subseq
-    Grab a sub-sequence from a fasta file based on coordinates.  The
-    requested coordinates are in the form seqid:start-end;
-
-
-";
-
-my ($summary, $chunks, $split, $eval_code, $eval_all, $extract_ids,
-    $grep_header, $grepv_header, $grep_seq, $grepv_seq, $wrap, $count,
-    $translate, $seq_only, $nt_count, $length, $total_length, $n50,
-    $tab, $reverse, $rev_seq, $comp_seq, $rev_comp, $uniq, $uniq_sub,
-    $shuffle_order, $shuffle_seq, $shuffle_codon, $shuffle_pick,
-    $select_file, $remove_file, $print, $mRNAseq, $EST,
-    $trim_maker_utr, $table, $swap_ids, $fix_prot, $subseq, $tile);
-
-GetOptions('summary'        => \$summary,
-	   'chunks=i'       => \$chunks,
-	   'split'          => \$split,
-	   'eval_code=s'    => \$eval_code,
-	   'eval_all=s'     => \$eval_all,
-	   'extract_ids=s'  => \$extract_ids,
-	   'grep_header=s'  => \$grep_header,
-	   'grep_seq=s'     => \$grep_seq,
-	   'grepv_header=s' => \$grepv_header,
-	   'grepv_seq=s'    => \$grepv_seq,
-	   'wrap=i'         => \$wrap,
-	   'count'          => \$count,
-	   'translate=s'    => \$translate,
-	   'trim_maker_utr' => \$trim_maker_utr,
-	   'seq_only'       => \$seq_only,
-	   'nt_count'       => \$nt_count,
-	   'length'         => \$length,
-	   'total_length'   => \$total_length,
-	   'n50'            => \$n50,
-	   'tab'            => \$tab,
-	   'table'          => \$table,
-	   'print'          => \$print,
-	   'reverse'        => \$reverse,
-	   'rev_seq'        => \$rev_seq,
-	   'comp_seq'       => \$comp_seq,
-	   'rev_comp'       => \$rev_comp,
-	   'uniq'           => \$uniq,
-	   'uniq_sub'       => \$uniq_sub,
-	   'shuffle_order'  => \$shuffle_order,
-	   'shuffle_seq'    => \$shuffle_seq,
-	   'shuffle_codon'  => \$shuffle_codon,
-	   'shuffle_pick=i' => \$shuffle_pick,
-	   'remove=s'       => \$remove_file,
-	   'select=s'       => \$select_file,
-	   'fix_prot'       => \$fix_prot,
-	   'mRNAseq'        => \$mRNAseq,
-	   'EST'            => \$EST,
-	   'swap_ids=s'     => \$swap_ids,
-	   'subseq=s'       => \$subseq,
-	   'tile=s'         => \$tile,
-	  );
-
-my $file = shift;
-unless (($file && -r $file) || ! -t STDIN){
-    print $usage;
-    exit;
-}
-
-if ($rev_comp) {$rev_seq++; $comp_seq++}
-
-my $warning = "\n\n" . ('#' x 40) . "\nThis function is not yet thouroughly tested!!\n" . ('#' x 40) . "\n\n";
-
-warn $warning if grep {$_} ($extract_ids,
-			    $reverse,
-			    $rev_seq,
-			    $comp_seq,
-			    $shuffle_order,
-			    $shuffle_seq,
-			    $shuffle_codon,
-			    $shuffle_pick,
-			   );
-
-# These functions handle their own printing;
-$print++ unless grep {$_} ($chunks,
-			   $split,
-			   $eval_code,
-			   $eval_all,
-			   $extract_ids,
-			   $grep_header,
-			   $grep_seq,
-			   $grepv_header,
-			   $grepv_seq,
-			   $count,
-			   $translate,
-			   $seq_only,
-			   $nt_count,
-			   $length,
-			   $total_length,
-			   $n50,
-			   $reverse,
-			   $rev_seq,
-			   $comp_seq,
-			   $uniq,
-			   $uniq_sub,
-			   $shuffle_order,
-			   $shuffle_seq,
-			   $shuffle_codon,
-			   $shuffle_pick,
-			   $remove_file,
-			   $select_file,
-			   $mRNAseq,
-			   $EST,
-			   $swap_ids,
-			   $subseq,
-			   $tile,
-			  );
-
-$nt_count++ if $summary;
-
-if(defined $translate && $translate !~ /^\d+$/ && $translate ne 'maker'){
-    $translate = 0;
-}
-
-my $IN;
-if (! $file && ! -t STDIN) {
-	open ($IN, "<&=STDIN") or die "Can't open STDIN\n";
-}
-else {
-	open ($IN, $file) or die "Can't open $file for reading: $!\n";
-}
-
-#Bioperl object for main fasta input file.
-my $seq_io  = Bio::SeqIO->new(-fh => $IN,
-			      -format => 'Fasta');
-
-chunks($file, $chunks)	    if $chunks;
-split_fasta()	            if $split;
-eval_code($eval_code)       if $eval_code;
-eval_all($eval_all)         if $eval_all;
-extract_ids($extract_ids)   if $extract_ids;
-grep_header($grep_header)   if $grep_header;
-grep_seq($grep_seq)         if $grep_seq;
-grepv_header($grepv_header) if $grepv_header;
-grepv_seq($grepv_seq)       if $grepv_seq;
-translate()                 if defined($translate);
-trim_maker_utr()            if $trim_maker_utr;
-seq_only()                  if $seq_only;
-nt_count()	            if $nt_count;
-seq_length()                if $length;
-total_length()              if $total_length;
-n50()                       if $n50;
-tab()	                    if $tab;
-reverse_order()             if $reverse;
-rev_comp()                  if $rev_seq;
-rev_comp()                  if $comp_seq;
-uniq()                      if $uniq;
-uniq_sub()                  if $uniq_sub;
-shuffle_order()             if $shuffle_order;
-shuffle_seq()               if $shuffle_seq;
-shuffle_codon()             if $shuffle_codon;
-shuffle_pick($shuffle_pick) if $shuffle_pick;
-remove_ids($remove_file)    if $remove_file;
-select_ids($select_file)    if $select_file;
-swap_ids($swap_ids)         if $swap_ids;
-subseq($file, $subseq)      if $subseq;
-fix_prot()                  if $fix_prot;
-print_seq()                 if $print;
-mRNAseq()                   if $mRNAseq;
-EST()                       if $EST;
-
-#-----------------------------------------------------------------------------
-#-------------------------------- SUBROUTINES --------------------------------
-#-----------------------------------------------------------------------------
-sub chunks {
-	my($file, $chunks) = @_;
-
-	my $outfile_base; #Create a base name for the output file.
-	($outfile_base = $file) =~ s/\.[^\.]*$//; #Input file name minus it's extension.
-
-	my $file_size = io($file)->size; #What's the size of our input file.
-
-	#How many chunks should the input file be split into?
-	my $chunk_size = int($file_size/$chunks) + ($file_size % $chunks);
-
-	#How many digits should the output file interations be sprintf'ed to=?
-	my $digits = int(log($chunks)/log(10)) + 1;
-
-	#I felt like using a closure today.
-	my $file_counter = make_file_counter();
-
-	my $out;
-	my $file_name;
-	#Loop over each sequence
-	while ( my $seq = $seq_io->next_seq() ) {
-		#Get an Bio::SeqIO fh if we don't have one, or if the current output file
-		#has grown too large.
-		if (! $out || (io($file_name)->size > $chunk_size)) {
-			($out, $file_name) = get_output_stream($outfile_base, $digits, $file_counter);
-		}
-		#Write it to the file.
-		$out->write_seq($seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub get_output_stream{
-    my ($outfile_base, $digits, $file_counter) = @_;
-    my $file_count = $file_counter->();
-    #Build/format the file_name.
-    $file_count = sprintf "%0${digits}s", $file_count;
-    my $file_name = $outfile_base . "_$file_count" . '.fasta';
-    #Get Bio::SeqIO object
-    my $out = Bio::SeqIO->new(-file   => ">$file_name",
-			      -format => 'fasta');
-    return ($out, $file_name);
-}
-#-----------------------------------------------------------------------------
-sub make_file_counter {
-    #Initialize the counter.
-    my $file_counter = 0;
-
-    #Increment the counter.
-    return sub{$file_counter++}
-}
-#-----------------------------------------------------------------------------
-sub split_fasta {
-	while ( my $seq = $seq_io->next_seq() ) {
-		my $file_out = $seq->display_id . ".fasta";
-
-		#Get Bio::SeqIO object
-		my $out = Bio::SeqIO->new(-file   => ">$file_out",
-					  -format => 'fasta');
-		#Write it to the file.
-		$out->write_seq($seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub eval_code {
-	my ($code) = @_;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-
-		my $return_value = eval $code;
-		die "Fatal Error in code ref:\n$@\n" if $@;
-		next unless $return_value;
-		print_this_seq($header, $seq);
-	}
-
-}
-#-----------------------------------------------------------------------------s
-sub eval_all {
-	my ($code) = @_;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-
-		eval $code;
-		die "Fatal Error in code ref:\n$@\n" if $@;
-		print_this_seq($header, $seq);
-	}
-
-}
-#-----------------------------------------------------------------------------
-sub extract_ids {
-
-    my $id_file = shift;
-
-    open(my $IN, '<', $id_file) or die "Can't open $id_file for reading\n$!\n";
-
-    my %ids = map {$_ => 1 unless (/^\#/ || ! $_)} (<$IN>);
-
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $id = $seq_obj->display_id;
-	my $header = get_header($seq_obj);
-	my $seq = $seq_obj->seq;
-
-	if (exists $ids{$id}) {
-	    print_this_seq($header, $seq);
-	}
-    }
-}
-#-----------------------------------------------------------------------------
-sub grep_header {
-	my ($pattern) = @_;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		$header .= " " . $seq_obj->description;
-		my $seq = $seq_obj->seq;
-
-		if ($header =~ /$pattern/) {
-			print_this_seq($header, $seq);
-		}
-	}
-}
-#-----------------------------------------------------------------------------
-sub grepv_header {
-	my ($pattern) = @_;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-
-		if ($header !~ /$pattern/) {
-			print_this_seq($header, $seq);
-		}
-	}
-}
-#-----------------------------------------------------------------------------
-{my $i = 0;
-sub mRNAseq {
-    my $size = 50;
-
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $seq = $seq_obj->seq;
-
-	my $len = length($seq);
-
-	for (my $j = 0; $j < $len/5; $j++){
-	    my $range = $len - $size;
-
-	    my $start; my $end;
-	    if($range < 0){
-		$start = 0 ;
-		$end = $len - 1;
-	    }
-	    else{
-		$start = int(rand($range));
-		$end = $start + $size - 1;
-	    }
-
-	    my $l = $end - $start + 1;
-
-		my $header = "sequence_".$i++;
-		print_this_seq($header, substr($seq, $start, $l));
-	    }
-	}
-}
-#-----------------------------------------------------------------------------
-sub EST {
-
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $seq = $seq_obj->seq;
-
-	my $len = length($seq);
-
-
-	my $range = $len - 500;
-	my $min = 250;
-
-	if($range < 0 || $min < 0){
-	    my $header = "sequence_".$i++;
-	    print_this_seq($header, $seq);
-	    next;
-	}
-
-	my $A = int(rand($range) + $min);
-	my $start = int(rand($range) + $min);
-	my $end = int(rand($range));
-	my $B = int(rand($range) + $min);
-
-	my $l = abs($end - $start + 1);
-	if($l > 250){
-	    my $header = "sequence_".$i++;
-	    print_this_seq($header, substr($seq, $start, $l));
-	}
-
-	$l = abs($A - 0 + 1);
-	if($l > 250){
-	    my $header = "sequence_".$i++;
-	    print_this_seq($header, substr($seq, 0, $l));
-	}
-
-	$l = abs($len - $B + 1);
-	if($l > 250){
-	    my $header = "sequence_".$i++;
-	    print_this_seq($header, substr($seq, $B, $l));
-	}
-
-    }
-}
-}
-#-----------------------------------------------------------------------------
-sub grep_seq {
-	my ($pattern) = @_;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		$seq =~ s/\s//g;
-
-		if ($seq =~ /$pattern/) {
-			print_this_seq($header, $seq);
-		}
-	}
-}
-#-----------------------------------------------------------------------------
-sub grepv_seq {
-	my ($pattern) = @_;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		$seq =~ s/\s//g;
-
-		if ($seq !~ /$pattern/) {
-			print_this_seq($header, $seq);
-		}
-	}
-}
-#-----------------------------------------------------------------------------
-sub fix_prot {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		$seq =~ s/[\s\*]//g;
-		$seq =~ s/[^abcdefghiklmnpqrstvwyzxABCDEFGHIKLMNPQRSTVWYZX\-\n]/C/g;
-		next if($seq eq ''); #skip empty fasta entries
-		print_this_seq($header, $seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub translate {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $frame;
-		my $offset;
-		if($translate eq 'maker'){
-		    $header =~ /offset:(\d+)/;
-		    $frame = ($1 % 3);
-		    $offset = ($1 - $frame)/3;
-		}
-		else{
-		    $frame = $translate % 3;
-		    $offset = ($translate - $frame)/3;
-		}
-		my $pep_seq = $seq_obj->translate(-frame => $frame)->seq;
-		$pep_seq = substr($pep_seq, $offset);
-		$pep_seq =~ s/^([^\*]+).*/$1/;
-		print_this_seq($header, $pep_seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub trim_maker_utr {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $frame;
-		my $offset;
-
-		$header =~ /offset:(\d+)/;
-
-		die "ERROR: These do not appear to be MAKER produced transcripts\n"
-		    if(! defined $1 || $1 eq '');
-		$frame = ($1 % 3);
-		$offset = ($1 - $frame)/3; #peptide offet without frame
-
-		my $tra_seq = $seq_obj->seq;
-		my $pep_seq = $seq_obj->translate(-frame => $frame)->seq;
-
-		$pep_seq = substr($pep_seq, $offset);
-		$pep_seq =~ s/^([^\*]+\*?).*/$1/;
-		$offset = 3 * $offset + $frame; #make transcript offset
-		my $length = 3 * length($pep_seq); #length of substring to get
-		my $fix = $offset + $length - length($tra_seq);
-		$length -= $fix	if($fix > 0);
-		$tra_seq = substr($tra_seq, $offset, $length);
-
-		print_this_seq($header, $tra_seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub seq_only {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $seq = $seq_obj->seq;
-		$seq = wrap_seq($seq, $wrap) if $wrap;
-		print $seq . "\n";
-	}
-}
-#-----------------------------------------------------------------------------
-sub nt_count {
-	my %all_seq_count;
-	my $total_count;
-
-	while (my $seq_obj = $seq_io->next_seq) {
-		my %this_seq_count;
-		my $this_count;
-		my $id = $seq_obj->display_id;
-		my $seq = $seq_obj->seq;
-		$seq =~ s/\s//g;
-		my @nts = split //, $seq;
-		for my $nt (@nts) {
-			$all_seq_count{$nt}++;
-			$this_seq_count{$nt}++;
-			$this_count++;
-			$total_count++;
-		}
-
-		next if $summary;
-		print "$id:\n";
-		print '-' x 80;
-		print "\n";
-		for my $nt (sort keys %this_seq_count) {
-			my $round = sprintf ("%.4f", $this_seq_count{$nt} / $this_count * 100);
-			print join "\t", ($nt,
-					  $this_seq_count{$nt},
-					  $round,
-					 );
-			print '%' . "\n";
-		}
-
-		my %this_report;
-		map {$this_report{aA} += $this_seq_count{$_} if $this_seq_count{$_}} qw(a A);
-		map {$this_report{tT} += $this_seq_count{$_} if $this_seq_count{$_}} qw(t T);
-		map {$this_report{gG} += $this_seq_count{$_} if $this_seq_count{$_}} qw(g G);
-		map {$this_report{cC} += $this_seq_count{$_} if $this_seq_count{$_}} qw(c C);
-
-		map {$this_report{aAtT} += $this_report{$_} if $this_report{$_}} qw(aA tT);
-		map {$this_report{gGcC} += $this_report{$_} if $this_report{$_}} qw(gG cC);
-		map {$this_report{aAtTgGcC} += $this_report{$_} if $this_report{$_}} qw(aAtT gGcC);
-
-		map {$this_report{atgc}   += $this_seq_count{$_} if $this_seq_count{$_}} qw(a t g c);
-		map {$this_report{nN}     += $this_seq_count{$_} if $this_seq_count{$_}} qw(n N);
-		map {$this_report{atgcnN} += $this_seq_count{$_} if $this_seq_count{$_}} qw(atgc nN);
-
-		for my $key (sort keys %this_report) {
-
-			print join "\t", ($key,
-					  $this_report{$key},
-					  sprintf ("%.4f", $this_report{$key} / $this_count * 100),
-					 );
-			print '%' . "\n";
-		}
-		print "\n\n";
-	}
-
-	print "All sequences combined:\n";
-	print '-' x 80;
-	print "\n";
-
-	for my $nt (sort keys %all_seq_count) {
-		print join "\t", ($nt,
-				  $all_seq_count{$nt},
-				  sprintf ("%.4f", $all_seq_count{$nt} / $total_count * 100),
-				 );
-		print '%' . "\n";
-	}
-
-	my %all_report;
-	map {$all_report{aA} += $all_seq_count{$_} if $all_seq_count{$_}} qw(a A);
-	map {$all_report{tT} += $all_seq_count{$_} if $all_seq_count{$_}} qw(t T);
-	map {$all_report{gG} += $all_seq_count{$_} if $all_seq_count{$_}} qw(g G);
-	map {$all_report{cC} += $all_seq_count{$_} if $all_seq_count{$_}} qw(c C);
-
-	map {$all_report{aAtT} += $all_report{$_} if $all_report{$_}} qw(aA tT);
-	map {$all_report{gGcC} += $all_report{$_} if $all_report{$_}} qw(gG cC);
-	map {$all_report{aAtTgGcC} += $all_report{$_} if $all_report{$_}} qw(aAtT gGcC);
-
-	map {$all_report{atgc}   += $all_seq_count{$_} if $all_seq_count{$_}} qw(a t g c);
-	map {$all_report{nN}     += $all_seq_count{$_} if $all_seq_count{$_}} qw(n N);
-	map {$all_report{atgcnN} += $all_seq_count{$_} if $all_seq_count{$_}} qw(atgc nN);
-
-	for my $key (sort keys %all_report) {
-
-		print join "\t", ($key,
-				  $all_report{$key},
-				  sprintf ("%.4f", $all_report{$key} / $total_count * 100),
-				 );
-		print '%' . "\n";
-	}
-	print "\n";
-	print "Total nts\t$total_count\n";
-}
-#-----------------------------------------------------------------------------
-sub seq_length {
-    my $count = 0;
-    my $total;
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $id = $seq_obj->display_id;
-	my $length = $seq_obj->length;
-	$total += $length;
-	$count++;
-	print "$id\t$length\n";
-    }
-    print "Total\t$total\n" if $count > 1;
-}
-#-----------------------------------------------------------------------------
-sub total_length {
-    my $total_length;
-    while (my $seq_obj = $seq_io->next_seq) {
-	$total_length += $seq_obj->length;
-    }
-    print $total_length . "\n";
-}
-#-----------------------------------------------------------------------------
-sub n50 {
-    my $total_length;
-    my @lengths;
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $length = $seq_obj->length;
-	$total_length += $length;
-	push @lengths, $length;
-    }
-    my $cumulative_length;
-    my $last_length;
-    my $n50;
-    for my $length (sort {$b <=> $a} @lengths) {
-	$cumulative_length += $length;
-	if ($cumulative_length > $total_length / 2) {
-	    $n50 = $length;
-	    last;
-	}
-	elsif ($cumulative_length == $total_length / 2) {
-	    $n50 = $length;
-	    $last_length = $length;
-	    last;
-	}
-	$last_length = $length;
-    }
-    $n50 = int((($n50 + $last_length) / 2) + 0.5);
-    print $n50 . "\n";
-}
-#-----------------------------------------------------------------------------
-sub tab {
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $header = get_header($seq_obj);
-	my $seq = $seq_obj->seq;
-		$seq =~ s/[\s\n\t]//g;
-		print "$header\t$seq\n";
-	}
-}
-#-----------------------------------------------------------------------------
-sub print_seq {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		print_this_seq($header, $seq);
-
-	}
-}
-#-----------------------------------------------------------------------------
-sub reverse_order {
-	my @seqs;
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		push @seqs, {seq => $seq,
-			     header => $header,
-			    };
-	}
-
-	@seqs = reverse @seqs;
-
-	for my $seq (@seqs) {
-		print_this_seq($seq->{header}, $seq->{seq});
-	}
-}
-#-----------------------------------------------------------------------------
-sub rev_comp{
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		$seq = reverse $seq   if $rev_seq;
-		if ($comp_seq) {
-			$seq =~ tr/acgtrymkswhdbvACGTRYMKSWHDBV
-				  /tgcayrkmswdhvbTGCAYRKMSWDHVB/;
-		}
-		print_this_seq($header, $seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub uniq{
-  my %seen;
-  while (my $seq_obj = $seq_io->next_seq) {
-    my $header = get_header($seq_obj);
-    my $seq = $seq_obj->seq;
-    print_this_seq($header, $seq) unless exists $seen{$seq};
-    $seen{$seq}++;
-  }
-}
-#-----------------------------------------------------------------------------
-sub uniq_sub {
-  my @seqs;
-  while (my $seq_obj = $seq_io->next_seq) {
-    my $header = get_header($seq_obj);
-    my $seq = $seq_obj->seq;
-    push @seqs, [$header, $seq];
-  }
-
-  @seqs = sort {length $a->[1] <=> length $b->[1]} @seqs;
-
- OUTER:
-  for my $outer_idx (0 .. $#seqs) {
-    my $start_idx = $outer_idx + 1;
-    for my $inner_idx ($start_idx .. $#seqs) {
-      if ($seqs[$inner_idx][1] =~ /$seqs[$outer_idx][1]/) {
-	print STDERR "WARN : skipping_sequence : ($seqs[$outer_idx][0]) " .
-	  "$seqs[$outer_idx][1]\n";
-	next OUTER;
-      }
-    }
-    print_this_seq($seqs[$outer_idx][0], $seqs[$outer_idx][1]);
-  }
-}
-#-----------------------------------------------------------------------------
-sub shuffle_order {
-	my @seqs;
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		push @seqs, {seq => $seq,
-			     header => $header,
-			    };
-	}
-
-	shuffle(\@seqs);
-
-	for my $seq (@seqs) {
-		print_this_seq($seq->{header}, $seq->{seq});
-	}
-}
-#-----------------------------------------------------------------------------
-sub shuffle_seq {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my @seq = split //, $seq_obj->seq;
-		shuffle(\@seq);
-		my $seq = join '', @seq;
-		print_this_seq($header, $seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub shuffle_codon {
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		my @codons = $seq =~ /(.{3})/g;
-		shuffle(\@codons);
-		$seq = join '', @codons;
-		print_this_seq($header, $seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub shuffle_pick {
-	my $shuffle_pick = shift;
-
-	my @seqs;
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		push @seqs, {seq => $seq,
-			     header => $header,
-			    };
-	}
-
-	my @picks;
-	for (1 .. $shuffle_pick) {
-		push @picks, splice @seqs, int(rand(scalar @seqs)), 1;
-	}
-
-	for my $pick (@picks) {
-		print_this_seq($pick->{header}, $pick->{seq});
-	}
-}
-#-----------------------------------------------------------------------------
-sub remove_ids {
-
-	my $remove_file = shift;
-	open (my $IN, '<', $remove_file) or die "Can't open $remove_file for reading\n";
-	my %ids = map {chomp;$_, 1} (<$IN>);
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $id = $seq_obj->display_id;
-		next if $ids{$id};
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		print_this_seq($header, $seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub select_ids {
-
-	my $select_file = shift;
-	open (my $IN, '<', $select_file) or die "Can't open $select_file for reading\n";
-	my %ids = map {chomp;$_, 1} (<$IN>);
-	while (my $seq_obj = $seq_io->next_seq) {
-		my $id = $seq_obj->display_id;
-		next unless $ids{$id};
-		my $header = get_header($seq_obj);
-		my $seq = $seq_obj->seq;
-		print_this_seq($header, $seq);
-	}
-}
-#-----------------------------------------------------------------------------
-sub print_this_seq {
-	my ($header, $seq) = @_;
-
-	if($table){
-	    chomp $seq;
-	    ($header) = $header =~ /^([^\s+]+)/;
-	    print join("\t", $header, uc($seq))."\n";
-	}
-	else{
-	    $seq = wrap_seq($seq, $wrap) if $wrap;
-	    chomp $seq;
-	    my $join = $tab ? "\t" : "\n";
-	    print join $join, (">$header", "$seq\n");
-	}
-}
-#-----------------------------------------------------------------------------
-sub wrap_seq {
-	my ($seq, $wrap) = @_;
-
-	if ($wrap > 0) {
-		$seq =~ s/\s//g;
-		$seq =~ s/(.{$wrap})/$1\n/g;
-	}
-	chomp $seq;
-	return $seq;
-}
-#-----------------------------------------------------------------------------
-sub get_header {
-	my $seq_obj = shift;
-	return $seq_obj->display_id . " " . $seq_obj->description;
-
-}
-#-----------------------------------------------------------------------------
-sub shuffle {
-	#Fisher-Yates Shuffle
-	my $array = shift;
-
-	my $n = scalar @{$array};
-	while ($n > 1) {
-		my $k = int rand($n--);
-		($array->[$n], $array->[$k]) = ($array->[$k], $array->[$n]);
-	}
-}
-#-----------------------------------------------------------------------------
-sub swap_ids {
-
-    my $id_file = shift;
-    open (my $IN, '<', $id_file) or die "Can't open $id_file for reading\n";
-    my %ids;
-    while (<$IN>) {
-	chomp;
-	my($id1, $id2) = split /\t/, $_;
-	# $id1 =~ s/\.\d+$//;
-	$ids{$id1} = $id2;
-    }
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $id = $seq_obj->display_id;
-	# gi|71999842|ref|NM_073020.2|
-	# my ($x, $y, $z, $id) = split /\|/, $id_text;
-	# $id =~ s/\.\d+//;
-	my $header = get_header($seq_obj);
-	if (exists $ids{$id}) {
-	    $header = $ids{$id};
-	}
-	my $seq = $seq_obj->seq;
-	print_this_seq($header, $seq);
-    }
-}
-#-----------------------------------------------------------------------------
-sub subseq {
-
-    my ($file, $coordinates) = @_;
-
-    require Bio::DB::Fasta;
-    my $fasta = Bio::DB::Fasta->new($file);
-
-    my ($seqid, $start, $end) = split /[:-]/, $coordinates;
-
-    print $fasta->seq($seqid, $start, $end);
-    print "\n";
-}
-#-----------------------------------------------------------------------------
-
-sub tile_seq {
-
-    my $tile = shift;
-
-    my ($tile_length, $step) = split /,/, $tile;
-    $tile_length ||= 50;
-    $step ||= 1;
-
-    while (my $seq_obj = $seq_io->next_seq) {
-	my $id  = $seq_obj->display_id;
-	my $seq = $seq_obj->seq;
-	my $seq_length = length($seq);
-	my $start;
-	for ($start = 1;$start <= ($seq_length - $tile_length); $start += $step) {
-	    my $header = "$id:$start-" . ($start + $tile_length - 1);
-	    my $subseq = substr($seq, $start, $tile_length);
-	    print ">$header\n$subseq\n";
-	}
-    }
-}
-
-#-----------------------------------------------------------------------------
diff --git a/trinity-plugins/Makefile b/trinity-plugins/Makefile
index 040defe..9988036 100644
--- a/trinity-plugins/Makefile
+++ b/trinity-plugins/Makefile
@@ -24,7 +24,7 @@ TRIMMOMATIC_CODE=Trimmomatic-0.32
 trinity_essentials: jellyfish fastool_target parafly_target trimmomatic_target
 
 trimmomatic_target:
-	ln -sf ${TRIMMOMATIC_CODE} trimmomatic
+	ln -sf ${TRIMMOMATIC_CODE} Trimmomatic
 
 
 jellyfish:
@@ -74,7 +74,7 @@ clean:
 	rm -f ./fastool # rm symlink
 	cd parafly && $(MAKE) clean
 	rm -f ./parafly # rm symlink
-	rm -f ./trimmomatic # rm symlink
+	rm -f ./Trimmomatic # rm symlink
 	cd slclust && $(MAKE) clean
 	cd collectl && rm -rf bin doc man
 	@echo "\n\n** Done cleaning plugins area **"
diff --git a/trinity-plugins/TransDecoder_r20140704.tar.gz b/trinity-plugins/TransDecoder_r20140704.tar.gz
deleted file mode 100644
index ec5e294..0000000
Binary files a/trinity-plugins/TransDecoder_r20140704.tar.gz and /dev/null differ
diff --git a/trinity-plugins/Trimmomatic-0.32/LICENSE b/trinity-plugins/Trimmomatic-0.32/LICENSE
deleted file mode 100644
index 94a9ed0..0000000
--- a/trinity-plugins/Trimmomatic-0.32/LICENSE
+++ /dev/null
@@ -1,674 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
-  The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works.  By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users.  We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors.  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
-  To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights.  Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received.  You must make sure that they, too, receive
-or can get the source code.  And you must show them these terms so they
-know their rights.
-
-  Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
-  For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software.  For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
-  Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so.  This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software.  The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable.  Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products.  If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
-  Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary.  To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                       TERMS AND CONDITIONS
-
-  0. Definitions.
-
-  "This License" refers to version 3 of the GNU General Public License.
-
-  "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
-  "The Program" refers to any copyrightable work licensed under this
-License.  Each licensee is addressed as "you".  "Licensees" and
-"recipients" may be individuals or organizations.
-
-  To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy.  The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
-  A "covered work" means either the unmodified Program or a work based
-on the Program.
-
-  To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy.  Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
-  To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies.  Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
-  An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License.  If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
-  1. Source Code.
-
-  The "source code" for a work means the preferred form of the work
-for making modifications to it.  "Object code" means any non-source
-form of a work.
-
-  A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
-  The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form.  A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
-  The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities.  However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work.  For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
-  The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
-  The Corresponding Source for a work in source code form is that
-same work.
-
-  2. Basic Permissions.
-
-  All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met.  This License explicitly affirms your unlimited
-permission to run the unmodified Program.  The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work.  This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
-  You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force.  You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright.  Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
-  Conveying under any other circumstances is permitted solely under
-the conditions stated below.  Sublicensing is not allowed; section 10
-makes it unnecessary.
-
-  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
-  No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
-  When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
-  4. Conveying Verbatim Copies.
-
-  You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
-  You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
-  5. Conveying Modified Source Versions.
-
-  You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
-    a) The work must carry prominent notices stating that you modified
-    it, and giving a relevant date.
-
-    b) The work must carry prominent notices stating that it is
-    released under this License and any conditions added under section
-    7.  This requirement modifies the requirement in section 4 to
-    "keep intact all notices".
-
-    c) You must license the entire work, as a whole, under this
-    License to anyone who comes into possession of a copy.  This
-    License will therefore apply, along with any applicable section 7
-    additional terms, to the whole of the work, and all its parts,
-    regardless of how they are packaged.  This License gives no
-    permission to license the work in any other way, but it does not
-    invalidate such permission if you have separately received it.
-
-    d) If the work has interactive user interfaces, each must display
-    Appropriate Legal Notices; however, if the Program has interactive
-    interfaces that do not display Appropriate Legal Notices, your
-    work need not make them do so.
-
-  A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit.  Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
-  6. Conveying Non-Source Forms.
-
-  You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
-    a) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by the
-    Corresponding Source fixed on a durable physical medium
-    customarily used for software interchange.
-
-    b) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by a
-    written offer, valid for at least three years and valid for as
-    long as you offer spare parts or customer support for that product
-    model, to give anyone who possesses the object code either (1) a
-    copy of the Corresponding Source for all the software in the
-    product that is covered by this License, on a durable physical
-    medium customarily used for software interchange, for a price no
-    more than your reasonable cost of physically performing this
-    conveying of source, or (2) access to copy the
-    Corresponding Source from a network server at no charge.
-
-    c) Convey individual copies of the object code with a copy of the
-    written offer to provide the Corresponding Source.  This
-    alternative is allowed only occasionally and noncommercially, and
-    only if you received the object code with such an offer, in accord
-    with subsection 6b.
-
-    d) Convey the object code by offering access from a designated
-    place (gratis or for a charge), and offer equivalent access to the
-    Corresponding Source in the same way through the same place at no
-    further charge.  You need not require recipients to copy the
-    Corresponding Source along with the object code.  If the place to
-    copy the object code is a network server, the Corresponding Source
-    may be on a different server (operated by you or a third party)
-    that supports equivalent copying facilities, provided you maintain
-    clear directions next to the object code saying where to find the
-    Corresponding Source.  Regardless of what server hosts the
-    Corresponding Source, you remain obligated to ensure that it is
-    available for as long as needed to satisfy these requirements.
-
-    e) Convey the object code using peer-to-peer transmission, provided
-    you inform other peers where the object code and Corresponding
-    Source of the work are being offered to the general public at no
-    charge under subsection 6d.
-
-  A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
-  A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling.  In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage.  For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product.  A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
-  "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source.  The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
-  If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information.  But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
-  The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed.  Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
-  Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
-  7. Additional Terms.
-
-  "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law.  If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
-  When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it.  (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.)  You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
-  Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
-    a) Disclaiming warranty or limiting liability differently from the
-    terms of sections 15 and 16 of this License; or
-
-    b) Requiring preservation of specified reasonable legal notices or
-    author attributions in that material or in the Appropriate Legal
-    Notices displayed by works containing it; or
-
-    c) Prohibiting misrepresentation of the origin of that material, or
-    requiring that modified versions of such material be marked in
-    reasonable ways as different from the original version; or
-
-    d) Limiting the use for publicity purposes of names of licensors or
-    authors of the material; or
-
-    e) Declining to grant rights under trademark law for use of some
-    trade names, trademarks, or service marks; or
-
-    f) Requiring indemnification of licensors and authors of that
-    material by anyone who conveys the material (or modified versions of
-    it) with contractual assumptions of liability to the recipient, for
-    any liability that these contractual assumptions directly impose on
-    those licensors and authors.
-
-  All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10.  If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term.  If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
-  If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
-  Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
-  8. Termination.
-
-  You may not propagate or modify a covered work except as expressly
-provided under this License.  Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
-  However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
-  Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
-  Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License.  If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
-  9. Acceptance Not Required for Having Copies.
-
-  You are not required to accept this License in order to receive or
-run a copy of the Program.  Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance.  However,
-nothing other than this License grants you permission to propagate or
-modify any covered work.  These actions infringe copyright if you do
-not accept this License.  Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
-  10. Automatic Licensing of Downstream Recipients.
-
-  Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License.  You are not responsible
-for enforcing compliance by third parties with this License.
-
-  An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations.  If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
-  You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License.  For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
-  11. Patents.
-
-  A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based.  The
-work thus licensed is called the contributor's "contributor version".
-
-  A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version.  For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
-  Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
-  In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement).  To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
-  If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients.  "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
-  If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
-  A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License.  You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
-  Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
-  12. No Surrender of Others' Freedom.
-
-  If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all.  For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
-  13. Use with the GNU Affero General Public License.
-
-  Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work.  The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
-  14. Revised Versions of this License.
-
-  The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-  Each version is given a distinguishing version number.  If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation.  If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
-  If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
-  Later license versions may give you additional or different
-permissions.  However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
-  15. Disclaimer of Warranty.
-
-  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. Limitation of Liability.
-
-  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
-  17. Interpretation of Sections 15 and 16.
-
-  If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    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 3 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, see <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/trinity-plugins/Trimmomatic-0.32/adapters/NexteraPE-PE.fa b/trinity-plugins/Trimmomatic-0.32/adapters/NexteraPE-PE.fa
deleted file mode 100644
index a986757..0000000
--- a/trinity-plugins/Trimmomatic-0.32/adapters/NexteraPE-PE.fa
+++ /dev/null
@@ -1,12 +0,0 @@
->PrefixNX/1
-AGATGTGTATAAGAGACAG
->PrefixNX/2
-AGATGTGTATAAGAGACAG
->Trans1
-TCGTCGGCAGCGTCAGATGTGTATAAGAGACAG
->Trans1_rc
-CTGTCTCTTATACACATCTGACGCTGCCGACGA
->Trans2
-GTCTCGTGGGCTCGGAGATGTGTATAAGAGACAG
->Trans2_rc
-CTGTCTCTTATACACATCTCCGAGCCCACGAGAC
\ No newline at end of file
diff --git a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq2-PE.fa b/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq2-PE.fa
deleted file mode 100644
index cef17cc..0000000
--- a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq2-PE.fa
+++ /dev/null
@@ -1,16 +0,0 @@
->PrefixPE/1
-AATGATACGGCGACCACCGAGATCTACACTCTTTCCCTACACGACGCTCTTCCGATCT
->PrefixPE/2
-CAAGCAGAAGACGGCATACGAGATCGGTCTCGGCATTCCTGCTGAACCGCTCTTCCGATCT
->PCR_Primer1
-AATGATACGGCGACCACCGAGATCTACACTCTTTCCCTACACGACGCTCTTCCGATCT
->PCR_Primer1_rc
-AGATCGGAAGAGCGTCGTGTAGGGAAAGAGTGTAGATCTCGGTGGTCGCCGTATCATT
->PCR_Primer2
-CAAGCAGAAGACGGCATACGAGATCGGTCTCGGCATTCCTGCTGAACCGCTCTTCCGATCT
->PCR_Primer2_rc
-AGATCGGAAGAGCGGTTCAGCAGGAATGCCGAGACCGATCTCGTATGCCGTCTTCTGCTTG
->FlowCell1
-TTTTTTTTTTAATGATACGGCGACCACCGAGATCTACAC
->FlowCell2
-TTTTTTTTTTCAAGCAGAAGACGGCATACGA
diff --git a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq2-SE.fa b/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq2-SE.fa
deleted file mode 100644
index 30eaeae..0000000
--- a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq2-SE.fa
+++ /dev/null
@@ -1,6 +0,0 @@
->TruSeq2_SE
-AGATCGGAAGAGCTCGTATGCCGTCTTCTGCTTG
->TruSeq2_PE_f
-AGATCGGAAGAGCGTCGTGTAGGGAAAGAGTGT
->TruSeq2_PE_r
-AGATCGGAAGAGCGGTTCAGCAGGAATGCCGAG
diff --git a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-PE-2.fa b/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-PE-2.fa
deleted file mode 100644
index b205511..0000000
--- a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-PE-2.fa
+++ /dev/null
@@ -1,12 +0,0 @@
->PrefixPE/1
-TACACTCTTTCCCTACACGACGCTCTTCCGATCT
->PrefixPE/2
-GTGACTGGAGTTCAGACGTGTGCTCTTCCGATCT
->PE1
-TACACTCTTTCCCTACACGACGCTCTTCCGATCT
->PE1_rc
-AGATCGGAAGAGCGTCGTGTAGGGAAAGAGTGTA
->PE2
-GTGACTGGAGTTCAGACGTGTGCTCTTCCGATCT
->PE2_rc
-AGATCGGAAGAGCACACGTCTGAACTCCAGTCAC
\ No newline at end of file
diff --git a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-PE.fa b/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-PE.fa
deleted file mode 100644
index e370ca1..0000000
--- a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-PE.fa
+++ /dev/null
@@ -1,4 +0,0 @@
->PrefixPE/1
-TACACTCTTTCCCTACACGACGCTCTTCCGATCT
->PrefixPE/2
-GTGACTGGAGTTCAGACGTGTGCTCTTCCGATCT
\ No newline at end of file
diff --git a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-SE.fa b/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-SE.fa
deleted file mode 100644
index 3fbad17..0000000
--- a/trinity-plugins/Trimmomatic-0.32/adapters/TruSeq3-SE.fa
+++ /dev/null
@@ -1,4 +0,0 @@
->TruSeq3_IndexedAdapter
-AGATCGGAAGAGCACACGTCTGAACTCCAGTCAC
->TruSeq3_UniversalAdapter
-AGATCGGAAGAGCGTCGTGTAGGGAAAGAGTGTA
diff --git a/trinity-plugins/Trimmomatic-0.32/trimmomatic-0.32.jar b/trinity-plugins/Trimmomatic-0.32/trimmomatic-0.32.jar
deleted file mode 100644
index c32e6c1..0000000
Binary files a/trinity-plugins/Trimmomatic-0.32/trimmomatic-0.32.jar and /dev/null differ
diff --git a/trinity-plugins/Trimmomatic-0.32/trimmomatic.jar b/trinity-plugins/Trimmomatic-0.32/trimmomatic.jar
deleted file mode 120000
index 7df34ff..0000000
--- a/trinity-plugins/Trimmomatic-0.32/trimmomatic.jar
+++ /dev/null
@@ -1 +0,0 @@
-trimmomatic-0.32.jar
\ No newline at end of file
diff --git a/trinity-plugins/collectl/Tests.py b/trinity-plugins/collectl/Tests.py
deleted file mode 100755
index 7297760..0000000
--- a/trinity-plugins/collectl/Tests.py
+++ /dev/null
@@ -1,117 +0,0 @@
-__author__ = 'befulton'
-
-import unittest
-import make_data_files
-
-def generate(lines):
-    for line in lines:
-        yield line
-
-class CollectlTests(unittest.TestCase):
-
-    def test_build_datasets_returns_last_line_time_as_end_time(self):
-        lines = ["20140919 13:10:49\n",
-                 "20140919 11:10:49\n",
-                 "20140919 11:27:49\n"]
-        _, _, _, _, end_time = make_data_files.build_datasets(generate(lines))
-        self.assertEquals(['20140919', '11:27:49'], end_time)
-
-    def test_build_datasets_adds_inchworm_to_line_dict(self):
-        lines = ["20140919 11:08:49 44009 user 20 44008 0 R 10975748 0 10837764 10957692 92 128 3416 9 0.00 4.99 99 "
-                 "01:33:35 0 0 0 0 0 0 0 0 1 /N/test/Inchworm/bin/inchworm --kmers jellyfish.kmers.fa --run_inchworm "
-                 "-K 25 -L 25 --monitor 1"]
-        _, line_dict, _, _, _ = make_data_files.build_datasets(generate(lines))
-        self.assertEquals(lines, line_dict['inchworm'])
-
-    def test_build_datasets_adds_bowtie_build_to_line_dict_if_no_path(self):
-        lines = ["20140919 11:11:24 44143 user 20 44131 0 R 547552 0 502040 535608 164 260 3244 9 0.01 4.98 99 "
-                 "02:27.86 0 960 0 960 0 124 0 0 0 bowtie-build /N/test/trinity_out/jaccard_clip_workdir/iworm.fa "
-                 "/N/trinity_out/jaccard_clip_workdir/iworm.fa",
-                 "20140919 11:11:29 44143 user 20 44131 0 R 547552 0 502040 535608 164 260 3244 9 0.01 4.98 99 02:27.86"
-                 " 0 960 0 960 0 124 0 0 0 bowtie-build /N/trinity_out/jaccard_clip_workdir/iworm.fa "
-                 "/N/trinity_out/jaccard_clip_workdir/iworm.fa",
-                 "20140919 11:11:34 44143 user 20 44131 0 R 547552 0 502040 535608 164 260 3244 9 0.01 4.98 99 02:27.86"
-                 " 0 960 0 960 0 124 0 0 0 some_app /N/trinity_out/bowtie-build/jaccard_clip_workdir/iworm.fa "
-                 "/N/trinity_out/jaccard_clip_workdir/iworm.fa"]
-        _, line_dict, _, _, _ = make_data_files.build_datasets(generate(lines))
-        self.assertEquals(lines[0:2], line_dict['bowtie-build'])
-        
-    def test_Chrysalis_is_identified_correctly(self):
-        lines = ["20140920 11:29:54 49383 befulton 20 43684 0 S 18468 0 1464 300 92 236 3416 8 0.00 0.00 0 00:02.44 "
-                 "0 0 0 0 0 0 0 0 0 /trinity/Chrysalis/Chrysalis "
-                 "-i both.fa -iworm /jobdir/trinity_out/inchworm.K25.L25.fa.clipped.fa -o "
-                 "/jobdir/trinity_out/chrysalis -cpu 16 -min_glue 2 "
-                 "-min_iso_ratio 0.05 -glue_factor 0.05 -weldmer_size 48 -min 200 -dist 500 -max_reads 200000 "
-                 "-sort_buffer_size 20G -max_mem_reads 1000000 -strand 1 -paired -reads_for_pairs both.fa "
-                 "-butterfly /trinity/Butterfly/Butterfly.jar"]
-        _, line_dict, _, _, _ = make_data_files.build_datasets(generate(lines))
-        self.assertEquals(lines, line_dict['Chrysalis'])
-
-    def test_Butterfly_is_identified_correctly(self):
-        lines = ["20140920 17:28:14 30084 befulton 20 62435 0 S 24215176 0 37768 24080384 92 4 14420 30 0.03 0.17 "
-                 "4 00:00.20 0 6 519 0 203 1 0 0 1056 java -Xmx20G -Xms1G -jar /trinity/Butterfly/Butterfly.jar "
-                 "-N 100000 -L 200 -F 500 -C /jobdir/trinity_out/chrysalis/Component_bins/Cbin5/c6058.graph "
-                 "--max_number_of_paths_per_node=10 --path_reinforcement_distance=75 --triplet-lock"]
-        _, line_dict, _, _, _ = make_data_files.build_datasets(generate(lines))
-        self.assertEquals(lines, line_dict['Butterfly'])
-
-    def test_shell_c_commands_are_dropped(self):
-        lines = ["20140919 10:06:14 43812 befulton 20 43684 0 S 108160 0 1228 196 92 848 1832 1 0.00 0.00 0 00:00.00 " \
-                "0 0 0 0 0 0 0 0 0 sh -c /trinity/trinity-plugins/fastool/fastool --rev  --illumina-trinity " \
-                "--to-fasta /jobdir/reads.left.fq >> left.fa"]
-        _, line_dict, _, _, _ = make_data_files.build_datasets(generate(lines))
-        self.assertEquals(0, len(line_dict))
-
-    def test_prettyprocess_combines_sort_and_binsort(self):
-        line = "20140919 11:08:49 44009 user 20 44008 0 R 10975748 0 10837764 10957692 92 128 3416 9 0.00 4.99 99 " \
-               "01:33:35 0 0 0 0 0 0 0 0 1 /bin/sort"
-        self.assertEquals("sort", make_data_files.prettyprocess(line))
-        line = "20140919 11:08:49 44009 user 20 44008 0 R 10975748 0 10837764 10957692 92 128 3416 9 0.00 4.99 99 " \
-               "01:33:35 0 0 0 0 0 0 0 0 1 sort"
-        self.assertEquals("sort", make_data_files.prettyprocess(line))
-
-    def test_sort(self):
-        line = "20140919 16:06:24 45210 befulton 20 45209 0 R 973936 0 966268 965740 92 88 1824 10 1.96 0.94 58 " \
-               "04:26.85 0 188211 178646 188416 82 92 0 0 0 sort -T . -S 2G -k 1,1 -k 3,3 right_fa.sam"
-        self.assertEquals("sort", make_data_files.prettyprocess(line))
-
-    def test_GraphFromFasta_identified(self):
-        line = "20141008 04:38:10 15672 befulton 20 15671 0 R 91636 0 11216 73412 92 292 3416 1 0.01 5.18 103" \
-               " 00:05.19 0 0 1342 0 337 3 0 0 579 " \
-               "/N/dc2/scratch/befulton/TrinityMason/trinityrnaseq_r20140717/Chrysalis/GraphFromFasta " \
-               "-i /dev/shm/trinity72/trinity_out/inchworm.K25.L25.fa -r both.fa -min_contig_length 200 -min_glue 2 " \
-               "-glue_factor 0.05 -min_iso_ratio 0.05 -t 32 -k 24 -kk 48 -strand -scaffolding iworm_scaffolds.txt"
-
-        self.assertEquals("GraphFromFasta", make_data_files.prettyprocess(line))
-
-    def test_Samtools_identified_with_verb(self):
-        line = "20141008 01:51:30 14984 befulton 20 14982 0 S 17752 0 820 200 92 384 2664 2 0.00 0.00 0 00:00.00 99" \
-               " 0 1 0 2 0 0 0 61 samtools view -F4 -Sb -"
-        self.assertEquals("samtools_view", make_data_files.prettyprocess(line))
-        line = "20141008 01:51:30 14985 befulton 20 14982 0 S 17748 0 740 196 92 384 2664 16 0.00 0.00 0 00:00.00 26" \
-               " 0 1 0 2 0 0 0 59 samtools sort -no - -"
-        self.assertEquals("samtools_sort", make_data_files.prettyprocess(line))
-
-    def test_Jellyfish_identified(self):
-        line = "20141008 00:03:55 14423 befulton 20 14226 0 S 11316512 0 9153040 11314672 92 1732 0 17 3.14 19.75" \
-               " 457 00:22.89 0 0 26047 0 3257 0 0 10 1129 " \
-               "/N/dc2/scratch/befulton/TrinityMason/trinityrnaseq_r20140717/trinity-plugins/jellyfish/bin/jellyfish " \
-               "count -t 32 -m 25 -s 1380200998 both.fa"
-        self.assertEquals("jellyfish", make_data_files.prettyprocess(line))
-
-    def test_Unrecognized_gives_binary_and_unknown(self):
-        line = "20141008 00:03:55 14423 befulton 20 14226 0 S 11316512 0 9153040 11314672 92 1732 0 17 3.14 19.75" \
-               " 457 00:22.89 0 0 26047 0 3257 0 0 10 1129 " \
-               "/N/dc2/scratch/befulton/TrinityMason/trinityrnaseq_r20140717/trinity-plugins/new_app/bin/new_app " \
-               "count -t 32 -m 25 -s 1380200998 both.fa"
-        self.assertEquals("new_app_unknown", make_data_files.prettyprocess(line))
-
-    def test_Unknown_apps_in_Chrysalis_directory_are_not_Chrysalis(self):
-        line = "20141008 00:03:55 14423 befulton 20 14226 0 S 11316512 0 9153040 11314672 92 1732 0 17 3.14 19.75" \
-               " 457 00:22.89 0 0 26047 0 3257 0 0 10 1129 " \
-               "/N/dc2/scratch/befulton/TrinityMason/trinityrnaseq_r20140717/Chrysalis/new_app " \
-               "count -t 32 -m 25 -s 1380200998 both.fa"
-        self.assertEquals("new_app_unknown", make_data_files.prettyprocess(line))
-
-
-
diff --git a/trinity-plugins/collectl/build_collectl.sh b/trinity-plugins/collectl/build_collectl.sh
deleted file mode 100755
index 71cadbd..0000000
--- a/trinity-plugins/collectl/build_collectl.sh
+++ /dev/null
@@ -1,53 +0,0 @@
-#!/bin/bash
-# this is a manual selection derived from the INSTALL script of collectl
-
-#switch to the folder of this script
-DESTDIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )"
-cd $DESTDIR
-BINDIR=$DESTDIR/bin
-DOCDIR=$DESTDIR/doc
-MANDIR=$DESTDIR/man
-rm -rf $BINDIR
-rm -rf $DOCDIR
-rm -rf $MANDIR
-
-FILE=`ls -1 -d collectl*| tail -1`
-tar xzf ${FILE}
-INSTALLDIR=`find . -maxdepth 1 -type d -iname "*collect*" | tail -1`
-
-echo "DESTDIR=$DESTDIR"
-echo "FILE=$FILE"
-echo "INSTALLDIR=$INSTALLDIR"
-
-mkdir -p $BINDIR
-mkdir -p $DOCDIR
-mkdir -p $MANDIR
-
-cp make_data_files.py    $BINDIR
-cp plot.py               $BINDIR
-cp timetable.py          $BINDIR
-cd ${INSTALLDIR}
-cp collectl.pl           $BINDIR/collectl
-cp collectl.conf         $BINDIR
-cp -r man1               $MANDIR
-
-cp docs/*                $DOCDIR
-cp GPL ARTISTIC COPYING  $DOCDIR
-cp RELEASE-collectl      $DOCDIR
-
-cp UNINSTALL             $BINDIR
-cp *.ph                  $BINDIR
-cp envrules.std          $BINDIR
-cp client.pl             $BINDIR
-cp col2tlviz.pl          $BINDIR
-
-chmod 444 $BINDIR/collectl.conf
-chmod 755 $BINDIR/collectl
-chmod 444 $DOCDIR/ARTISTIC $DOCDIR/COPYING $DOCDIR/GPL
-chmod 755 $BINDIR/*.pl
-chmod 444 $BINDIR/*.ph
-
-cd ${DESTDIR}
-rm -rf ${INSTALLDIR}
-
-
diff --git a/trinity-plugins/collectl/collectl-3.6.9.src.tar.gz b/trinity-plugins/collectl/collectl-3.6.9.src.tar.gz
deleted file mode 100644
index 08a716d..0000000
Binary files a/trinity-plugins/collectl/collectl-3.6.9.src.tar.gz and /dev/null differ
diff --git a/trinity-plugins/collectl/collectl-3.7.4.src.tar.gz b/trinity-plugins/collectl/collectl-3.7.4.src.tar.gz
deleted file mode 100644
index 2389dc3..0000000
Binary files a/trinity-plugins/collectl/collectl-3.7.4.src.tar.gz and /dev/null differ
diff --git a/trinity-plugins/collectl/make_data_files.py b/trinity-plugins/collectl/make_data_files.py
deleted file mode 100644
index a6d9f7c..0000000
--- a/trinity-plugins/collectl/make_data_files.py
+++ /dev/null
@@ -1,181 +0,0 @@
-__author__ = 'befulton'
-from subprocess import call, Popen, PIPE
-from collections import defaultdict
-import os
-import time
-import re
-import datetime
-import sys
-
-def total_seconds(td):
-    # Since this function is not available in Python 2.6
-    return (td.microseconds + (td.seconds + td.days * 24 * 3600) * 10**6) / 10**6
-
-def open_collectl(filename, start_time=None):
-    bindir = os.path.dirname(sys.argv[0])
-    args = [bindir+os.sep+"collectl", "-P", "-p", filename, "-sZ"]
-    if start_time:
-        midnight = datetime.datetime.combine(start_time, datetime.datetime.min.time())
-        offsettime = total_seconds(midnight - start_time + datetime.timedelta(minutes=1))
-        print "offsettime: %s s" % offsettime
-        args += ["--offsettime", str(offsettime)]
-    p = Popen(args, stdout=PIPE)
-    return p
-
-def wait_for_collectl(filename):
-    finished = call(["gzip", "-tf", filename])
-    count = 0
-    while finished != 0 and count < 300:
-        print "collectl has not yet finished"
-        time.sleep(1)
-        finished = call(["gzip", "-tf", filename])
-        count += 1
-
-def get_start_time(filename):
-    p = open_collectl(filename)
-    print p.stdout.readline()
-    print p.stdout.readline()
-    s = p.stdout.readline().split()
-
-    p.stdout.close()
-    return s[0:2]
-    #return datetime.datetime.strptime(s[0] + ' ' + s[1], "%Y%m%d %H:%M:%S")
-
-def replay(filename, start_time):
-    if filename.endswith('gz'):
-        p = open_collectl(filename, start_time)
-        print p.stdout.readline()
-        print p.stdout.readline()
-        while True:
-          retcode = p.poll() #returns None while subprocess is running
-          line = p.stdout.readline()
-          yield line
-          if(retcode is not None):
-            break
-    else:
-        with open(filename) as  f:
-            for line in f:
-                yield line
-
-def timedelta(filename):
-    print filename
-    p = Popen(["zcat", filename], stdout=PIPE)
-    p.stdout.readline()
-    params = p.stdout.readline().split()
-    i = next(param for param in params if param.startswith('-i'))
-    p.stdout.close()
-    return i[2:]
-
-
-def prettyprocess(line):
-    s = line.split()[29:]
-    if not s:
-        return None
-    if s[0] in ("-bash", 'sh', '/bin/bash', 'bash', 'ln', '/bin/pwd', 'mkdir', 'date', 'touch', '/usr/bin/env'):  
-        return None
-
-    exes = ['fastool', 'ParaFly','Butterfly','ReadsToTranscripts', 'jellyfish',
-             'inchworm', 'FastaToDeBruijn', 'QuantifyGraph', 'GraphFromFasta', 'CreateIwormFastaBundle',
-             'bowtie-build', 'bowtie', 'Chrysalis', 'cat', 'sort', 'cp', 'wc', 'rm', 'find']
-    perl_scripts = ['scaffold_iworm_contigs', 'Trinity', 'collectl', 'print_butterfly_assemblies',
-              'partition_chrysalis_graphs_n_reads', 'fasta_filter_by_min_length', 'partitioned_trinity_aggregator']
-
-    for k in exes:
-        if s[0].endswith(k):
-            return k
-
-    if s[0] == 'samtools':
-        return ('samtools_' + s[1]) if len(s) > 1 else 'samtools'
-
-    if s[0] == '/bin/sort':
-        return 'sort'
-
-    if s[0] == 'java':
-        if 'Butterfly.jar' in " ".join(s):
-            return 'Butterfly'
-        if 'ExitTester.jar' in " ".join(s):
-            return 'ExitTester'
-        if '-version' in " ".join(s):
-            return 'java_version'
-
-        return 'java'
-
-    if s[0] == 'perl':
-        for k in perl_scripts:
-            if k in s[1]:
-                return k
-        return 'perl'
-
-    if s[0] == '/usr/bin/perl' and 'collectl' in s[2]:
-        return 'collectl'
-
-    return os.path.basename(s[0])+'_unknown'
-
-
-def build_datasets(line_generator):
-    line_dict = defaultdict(list)
-    sum_dict = defaultdict(lambda: [0]*27)
-    grand_sum_dict = defaultdict(lambda: [0]*27)
-
-    last_line = ''
-    ordered_keys = []
-    for line in line_generator:
-        if line: last_line = line
-        key = prettyprocess(line)
-        if key:
-            if key not in ordered_keys:
-                ordered_keys.append(key)
-            line_dict[key].append(line)
-            s = line.split()
-            data = sum_dict[key, s[0], s[1]]
-            total = grand_sum_dict[tuple(s[0:2])]
-            for i in range(27):
-                try:
-                    data[i] += float(s[i + 2])
-                    total[i] += float(s[i + 2])
-                except ValueError:
-                    pass
-
-    return ordered_keys, line_dict, sum_dict, grand_sum_dict, last_line.split()[0:2]
-
-def write_times(start_time, end_time, colpar):
-     ref = start_time[0] + " 00:00:00"
-     e = datetime.datetime.strptime(" ".join(end_time), "%Y%m%d %H:%M:%S")
-     r = datetime.datetime.strptime(ref, "%Y%m%d %H:%M:%S")
-
-     with open("global.time", "w") as f:
-        f.write("date %s\n" % " ".join(start_time))
-        f.write("start %s\n" % ref)
-        f.write("end %s\n" % " ".join(end_time))
-        f.write("runtime %s\n" % total_seconds(e-r))
-        f.write("interval %s\n" % colpar)
-
-
-def write_files(keys, line_dict, sum_dict, grand_sum_dict):
-    for id, tool in enumerate(keys):
-        if line_dict[tool]:
-            with open("%s.%s.data" % (id + 1, tool), "w") as f:
-                f.writelines(line_dict[tool])
-            with open("%s.%s.sum" % (id + 1, tool), "w") as f:
-                lines = (key for key in sum_dict.keys() if key[0] == tool)
-                for line in sorted(lines):
-                    f.write(" ".join(list(line[1:]) + [('%f' % val).rstrip('0').rstrip('.')
-                                                       for val in sum_dict[line]]) + "\n")
-        with open("collectZ.proc", "w") as f:
-            for k in sorted(grand_sum_dict.keys()):
-                f.write(" ".join(list(k) + ['{0:g}'.format(val) for val in grand_sum_dict[k]]) + "\n")
-
-if __name__ == '__main__':
-    filename = next(file for file in os.listdir(".") if file.endswith(".gz"))
-    wait_for_collectl(filename)
-    colpar = timedelta(filename)
-    start_time = get_start_time(filename)
-
-    start = datetime.datetime.strptime(" ".join(start_time), "%Y%m%d %H:%M:%S")
-    ordered_keys, line_dict, sum_dict, grand_sum_dict, end_time = build_datasets(replay(filename, start))
-    write_files(ordered_keys, line_dict, sum_dict, grand_sum_dict)
-    write_times(start_time, end_time, colpar)
-
-    sum_files = sorted((file for file in os.listdir(".") if file.endswith(".sum")), key=lambda f: int(f.split('.')[0]))
-    for id, sf in enumerate(sum_files):
-        os.rename(sf, "%s.%s" % (id+1, sf))
diff --git a/trinity-plugins/collectl/plot.py b/trinity-plugins/collectl/plot.py
deleted file mode 100644
index b1ac081..0000000
--- a/trinity-plugins/collectl/plot.py
+++ /dev/null
@@ -1,176 +0,0 @@
-__author__ = 'befulton'
-
-import os
-import sys
-import subprocess
-
-def get_times():
-    d = dict()
-    with open("global.time") as f:
-        for line in f:
-            s = line.split()
-            d[s[0]] = s[1:]
-    return d
-
-times = get_times()
-date = times['start'][0]
-start = times['start'][1]
-end = times['end'][1]
-tics = int(end.split(':')[0]) + 1
-
-prettycolors = False
-if len(sys.argv) > 1:
-    name = sys.argv[1]
-else:
-    name = os.path.split(os.getcwd())[1]
-
-if len(sys.argv) > 2:
-    cpu_count = int(sys.argv[2])
-else:
-    cpu_count = 64
-
-
-def build_plot(files, stat):
-    d = []
-    for i, file in enumerate(sorted(files, key=lambda fn: int(fn.split('.')[0]))):
-        title = file.split('.')[2]
-        d.append("'%s' using 1:(%s) title \"%s\"  ls %s" % (file, stat, title, i+1))
-    return d
-
-
-def write_files(name):
-    files = [file for file in os.listdir(".") if file.endswith(".sum")]
-
-    with open("defs.gnu", 'w') as f:
-        f.write("#generated gnuplot file\n")
-        f.write("set xrange ['%s %s':'%s %s']\n" % (date, start, date, end))
-        f.write("set xtics (")
-        f.write(", ".join(["\"{0}\" '{1} {0:02d}:00:00'".format(i, date) for i in range(tics)]))
-        f.write(" )\n")
-        f.write("ncpu=%s" % cpu_count)
-        f.write("\n")
-
-    with open("common.gnu", 'w') as f:
-        f.write(common_text.format(name))
-        if prettycolors:
-            colorset = color_sets[len(files)-1]
-            for i, c in enumerate(colorset.split()):
-                f.write("set style line %s lt 1 lc rgb \"%s\" lw mylw1 pt mypt1 ps myps1\n" % i, c)
-        else:
-            for i in range(len(files)):
-                f.write("set style line %s lw mylw1 pt mypt1 ps myps1\n" % (i+1))
-
-    with open('ram.gnu', 'w') as f:
-        f.write(gnu_head % ('ram', end, "RAM usage GiB", ""))
-        d = build_plot(files, "fg*$11")
-        f.write(",\\\n     ".join(d))
-
-    with open('cpu.gnu', 'w') as f:
-        f.write(gnu_head % ('cpu', end, "Core Utilization", "ncpu"))
-        d = build_plot(files, "$19/100")
-        f.write(",\\\n     ".join(d))
-
-    with open('io.gnu', 'w') as f:
-        f.write(gnu_io_head % end)
-        d = build_plot(files, "fm*($23+$24)")
-        f.write(",\\\n     ".join(d))
-
-    for gnu in ['ram.gnu', 'cpu.gnu', 'io.gnu']:
-        subprocess.Popen(['gnuplot', gnu]).wait()
-
-common_text = """
-set terminal postscript color eps "Times" 14
-#set termoption enhanced
-
-set style data points
-
-# ram and cpu
-mypt1=7
-mylw1=0
-#myps1=0.3
-myps1=0.6
-
-set key below
-set timefmt "%Y%m%d %H:%M:%S"
-set xdata time
-set format x "%k"
-set xrange [*:*]
-unset grid
-set grid x
-unset title
-#set title "{0}" noenhanced
-set title "{0}"
-
-fm=1./(1024.0)
-fg=1./(1024.0)/(1024.0)
-
-#set multiplot layout 3,1
-#set tmargin 0
-#set tmargin 0.8
-#set bmargin 0.8
-
-#set tics nomirror scale 0.66
-#set xtics scale 0
-
-#myvertoffset=0.02
-
-"""
-
-gnu_head = """load 'common.gnu'
-load 'defs.gnu'
-
-set out '%s.eps'
-
-set xlabel "Runtime [h] %s"
-set ylabel "%s"
-set yrange [0:%s]
-
-plot """
-
-gnu_io_head = """load 'common.gnu'
-load 'defs.gnu'
-
-set out 'io.eps'
-
-set xlabel "Runtime [h] %s"
-set ylabel "I/O MiB/s"
-set yrange [0.005:2000]
-set logscale y
-set ytics ("10^{-3}" 0.001, "10^{-2}" 0.01, "10^{-1}" 0.1, "10^{0}" 1, "10^{1}" 10, "10^{2}" 100, "10^{3}" 1000)
-
-plot """
-
-color_sets = [
-    '#f800ff',
-    '#ff00e3 #f100ff',
-    "#ffa900 #00ffdc #0096ff",
-    "#ff005d #19ff00 #00ffc8 #c200ff",
-    "#ff00c7 #9cff00 #00ff61 #0042ff #5700ff",
-    "#ff00cb #ff1500 #59ff00 #00ffb5 #00b4ff #4f00ff",
-    "#ff00f2 #ff000f #c0ff00 #0bff00 #00ffdd #0007ff #7800ff",
-    "#ff004d #ff0100 #ffe800 #64ff00 #00ff94 #00daff #0070ff #c800ff",
-    "#ff0081 #ff0031 #ffa500 #6aff00 #23ff00 #00ffb5 #0058ff #1300ff #ab00ff",
-    "#ff00af #ff003b #ff4b00 #fff900 #6aff00 #00ff98 #00feff #00b6ff #3c00ff #8700ff",
-    "#ff00de #ff1100 #ff7d00 #fff600 #59ff00 #1bff00 #00ff64 #00e7ff #009cff #7100ff #bc00ff",
-    "#ff00b7 #ff0062 #ff5200 #ffdb00 #baff00 #54ff00 #00ff5e #00ff87 #0087ff #0083ff #7800ff #cc00ff",
-    "#ff00b9 #ff0037 #ff2600 #ffa500 #bbff00 #84ff00 #00ff03 #00ff64 #00ffb5 #00cfff #0048ff #2b00ff #ba00ff",
-    '#ff00d8 #ff0047 #ff0007 #ff7f00 #ffee00 #88ff00 #32ff00 #00ff67 #00ff75 #00c9ff #0070ff #0005ff #6c00ff #8f00ff',
-    "#ff00db #ff0066 #ff2d00 #ff3400 #fff600 #adff00 #7eff00 #00ff03 #00ff72 #00ffc5 #00c6ff #0052ff #002fff #9500ff #bb00ff",
-    "#ff00c8 #ff009b #ff0004 #ff7600 #ffbe00 #ffef00 #98ff00 #54ff00 #00ff2c #00ff6a #00ffbf #0088ff #004fff #0010ff #8900ff #b300ff",
-    "#ff00ed #ff0053 #ff0005 #ff4200 #ffc200 #f9ff00 #aaff00 #52ff00 #14ff00 #00ff74 #00ffb5 #00ffe6 #00b4ff #0025ff #0003ff #6300ff #be00ff",
-    "#ff00a9 #ff006c #ff004a #ff4000 #ff5a00 #ffae00 #e8ff00 #9bff00 #36ff00 #00ff3a #00ff7a #00fff4 #00bdff #007cff #0017ff #2a00ff #5d00ff #be00ff",
-    "#ff00cb #ff007f #ff0054 #ff0b00 #ff7d00 #ffa700 #ffe400 #aaff00 #7cff00 #18ff00 #00ff41 #00ffb1 #00ffe1 #009cff #0071ff #001eff #1900ff #8a00ff #b400ff",
-    "#ff00e1 #ff0086 #ff0037 #ff0400 #ff6f00 #ff8400 #fff100 #aeff00 #71ff00 #05ff00 #00ff22 #00ff56 #00ffd2 #00ecff #00c4ff #003eff #001cff #3300ff #8000ff #c700ff",
-    "#ff00f0 #ff009c #ff004e #ff0004 #ff3300 #ff7400 #ffcc00 #f4ff00 #9fff00 #53ff00 #13ff00 #00ff3a #00ff9c #00ffb5 #00f1ff #00b4ff #0078ff #0007ff #3700ff #8a00ff #eb00ff",
-    "#ff00d4 #ff00a1 #ff0064 #ff001f #ff3100 #ff9d00 #ffa200 #ffeb00 #a5ff00 #80ff00 #43ff00 #02ff00 #00ff49 #00ff88 #00ffe4 #00e6ff #008fff #004fff #001dff #4300ff #7900ff #b000ff",
-    "#ff00f6 #ff00af #ff0047 #ff0012 #ff2e00 #ff6300 #ffc700 #fffc00 #bcff00 #6bff00 #63ff00 #0fff00 #00ff29 #00ff8b #00ffc5 #00fff1 #00c5ff #0072ff #0053ff #0200ff #3600ff #7700ff #bd00ff",
-    "#ff00d7 #ff009e #ff0061 #ff0037 #ff3000 #ff7200 #ffaa00 #ffec00 #cfff00 #94ff00 #4eff00 #10ff00 #08ff00 #00ff59 #00ff86 #00ffc1 #00dcff #00b5ff #006cff #0041ff #1d00ff #5100ff #9800ff #d100ff",
-    "#ff00e4 #ff0094 #ff007e #ff003b #ff0000 #ff4e00 #ff9100 #ffb000 #ffec00 #ccff00 #76ff00 #28ff00 #00ff17 #00ff50 #00ff5c #00ffa9 #00fff1 #00e6ff #008bff #005bff #0005ff #1b00ff #7000ff #8a00ff #c500ff",
-    "#ff00ed #ff00a9 #ff0059 #ff0034 #ff0009 #ff4d00 #ff6200 #ffab00 #fffe00 #e3ff00 #8bff00 #7aff00 #41ff00 #00ff06 #00ff45 #00ff7c #00ffb5 #00fff7 #00b2ff #00a4ff #0067ff #0033ff #2e00ff #5a00ff #9d00ff #d500ff",
-    "#ff00e2 #ff00af #ff0059 #ff0033 #ff1000 #ff2c00 #ff7500 #ffb100 #ffe600 #faff00 #c9ff00 #94ff00 #50ff00 #17ff00 #00ff39 #00ff74 #00ffad #00ffe6 #00fff9 #00c8ff #0089ff #004cff #0019ff #1700ff #6e00ff #9400ff #d600ff",
-    "#ff00cd #ff00af #ff008a #ff003a #ff0020 #ff2f00 #ff6c00 #ff8300 #ffc200 #ffea00 #b5ff00 #82ff00 #71ff00 #12ff00 #00ff16 #00ff58 #00ff69 #00ffb6 #00ffd5 #00d0ff #00bcff #0077ff #002cff #0020ff #3c00ff #5900ff #9e00ff #be00ff",
-    "#ff00d6 #ff00b4 #ff007e #ff005d #ff0013 #ff0f00 #ff4400 #ff8a00 #ffb300 #fff100 #e1ff00 #beff00 #6eff00 #31ff00 #03ff00 #00ff28 #00ff68 #00ff83 #00ffad #00ffe7 #00deff #0099ff #0053ff #0038ff #0011ff #4100ff #6d00ff #8800ff #e800ff",
-    "#ff00d8 #ff00ae #ff0078 #ff0036 #ff0003 #ff0400 #ff5500 #ff8600 #ffb100 #ffd100 #cfff00 #b4ff00 #7dff00 #65ff00 #1cff00 #00ff0c #00ff4b #00ff86 #00ffb9 #00ffe5 #00f5ff #00a2ff #0086ff #0064ff #0014ff #2d00ff #4a00ff #8200ff #b100ff #de00ff",
-]
-if __name__ == '__main__':
-    write_files(name)
\ No newline at end of file
diff --git a/trinity-plugins/collectl/timetable.py b/trinity-plugins/collectl/timetable.py
deleted file mode 100644
index 7f5ff07..0000000
--- a/trinity-plugins/collectl/timetable.py
+++ /dev/null
@@ -1,33 +0,0 @@
-__author__ = 'befulton'
-import os
-import datetime
-
-def to_date(s):
-    return datetime.datetime.strptime(s[0] + ' ' + s[1], "%Y%m%d %H:%M:%S")
-
-files = [file for file in os.listdir(".") if file.endswith(".sum")]
-
-files = [file for file in os.listdir(".") if file.endswith(".sum")]
-
-interval = 5
-runtimes = dict()
-for file in files:
-    app_name = file.split('.')[2]
-    linecount = 0
-    with open(file) as f:
-        line = f.readline().split()
-        if line:
-            linecount = 1
-            app_start = to_date(line)
-            for line in f:
-                linecount += 1
-            if linecount > 1:
-                line = line.split()
-            app_end = to_date(line)
-    runtimes[app_name] = linecount * interval
-
-with open('runtime.csv', 'w') as f:
-    f.write("application runtime[s]\n")
-    for k, v in runtimes.iteritems():
-        f.write("%s %s\n" % (k, v))
-
diff --git a/trinity-plugins/parafly-code/LICENSE b/trinity-plugins/parafly-code/LICENSE
deleted file mode 100644
index 6a9679e..0000000
--- a/trinity-plugins/parafly-code/LICENSE
+++ /dev/null
@@ -1,17 +0,0 @@
-Copyright (c) 2011, The Broad Institute, Inc. All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
-
-·         Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
-
-·         Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
-
-·         Neither the name of the Broad Institute nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.**
-
-THIS SOFTWARE IS PROVIDED BY THE BROAD INSTITUTE  ''AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE BROAD INSTITUTE 
-BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES(INCLUDING, BUT NOT LIMITED TO, 
-PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, 
-EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
diff --git a/trinity-plugins/parafly-code/Makefile.am b/trinity-plugins/parafly-code/Makefile.am
deleted file mode 100644
index af437a6..0000000
--- a/trinity-plugins/parafly-code/Makefile.am
+++ /dev/null
@@ -1 +0,0 @@
-SUBDIRS = src
diff --git a/trinity-plugins/parafly-code/Makefile.in b/trinity-plugins/parafly-code/Makefile.in
deleted file mode 100644
index 99b30b8..0000000
--- a/trinity-plugins/parafly-code/Makefile.in
+++ /dev/null
@@ -1,671 +0,0 @@
-# Makefile.in generated by automake 1.11.1 from Makefile.am.
-# @configure_input@
-
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009  Free Software Foundation,
-# Inc.
-# This Makefile.in is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
-# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
-# PARTICULAR PURPOSE.
-
- at SET_MAKE@
-VPATH = @srcdir@
-pkgdatadir = $(datadir)/@PACKAGE@
-pkgincludedir = $(includedir)/@PACKAGE@
-pkglibdir = $(libdir)/@PACKAGE@
-pkglibexecdir = $(libexecdir)/@PACKAGE@
-am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
-install_sh_DATA = $(install_sh) -c -m 644
-install_sh_PROGRAM = $(install_sh) -c
-install_sh_SCRIPT = $(install_sh) -c
-INSTALL_HEADER = $(INSTALL_DATA)
-transform = $(program_transform_name)
-NORMAL_INSTALL = :
-PRE_INSTALL = :
-POST_INSTALL = :
-NORMAL_UNINSTALL = :
-PRE_UNINSTALL = :
-POST_UNINSTALL = :
-subdir = .
-DIST_COMMON = $(am__configure_deps) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in $(srcdir)/config.h.in \
-	$(top_srcdir)/configure depcomp install-sh missing
-ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
-am__aclocal_m4_deps = $(top_srcdir)/configure.ac
-am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
-	$(ACLOCAL_M4)
-am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
- configure.lineno config.status.lineno
-mkinstalldirs = $(install_sh) -d
-CONFIG_HEADER = config.h
-CONFIG_CLEAN_FILES =
-CONFIG_CLEAN_VPATH_FILES =
-SOURCES =
-DIST_SOURCES =
-RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
-	html-recursive info-recursive install-data-recursive \
-	install-dvi-recursive install-exec-recursive \
-	install-html-recursive install-info-recursive \
-	install-pdf-recursive install-ps-recursive install-recursive \
-	installcheck-recursive installdirs-recursive pdf-recursive \
-	ps-recursive uninstall-recursive
-RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
-  distclean-recursive maintainer-clean-recursive
-AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \
-	$(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \
-	distdir dist dist-all distcheck
-ETAGS = etags
-CTAGS = ctags
-DIST_SUBDIRS = $(SUBDIRS)
-DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
-distdir = $(PACKAGE)-$(VERSION)
-top_distdir = $(distdir)
-am__remove_distdir = \
-  { test ! -d "$(distdir)" \
-    || { find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
-         && rm -fr "$(distdir)"; }; }
-am__relativize = \
-  dir0=`pwd`; \
-  sed_first='s,^\([^/]*\)/.*$$,\1,'; \
-  sed_rest='s,^[^/]*/*,,'; \
-  sed_last='s,^.*/\([^/]*\)$$,\1,'; \
-  sed_butlast='s,/*[^/]*$$,,'; \
-  while test -n "$$dir1"; do \
-    first=`echo "$$dir1" | sed -e "$$sed_first"`; \
-    if test "$$first" != "."; then \
-      if test "$$first" = ".."; then \
-        dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \
-        dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \
-      else \
-        first2=`echo "$$dir2" | sed -e "$$sed_first"`; \
-        if test "$$first2" = "$$first"; then \
-          dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \
-        else \
-          dir2="../$$dir2"; \
-        fi; \
-        dir0="$$dir0"/"$$first"; \
-      fi; \
-    fi; \
-    dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \
-  done; \
-  reldir="$$dir2"
-DIST_ARCHIVES = $(distdir).tar.gz
-GZIP_ENV = --best
-distuninstallcheck_listfiles = find . -type f -print
-distcleancheck_listfiles = find . -type f -print
-ACLOCAL = @ACLOCAL@
-AMTAR = @AMTAR@
-AM_CXXFLAGS = @AM_CXXFLAGS@
-AUTOCONF = @AUTOCONF@
-AUTOHEADER = @AUTOHEADER@
-AUTOMAKE = @AUTOMAKE@
-AWK = @AWK@
-CPPFLAGS = @CPPFLAGS@
-CXX = @CXX@
-CXXDEPMODE = @CXXDEPMODE@
-CXXFLAGS = @CXXFLAGS@
-CYGPATH_W = @CYGPATH_W@
-DEFS = @DEFS@
-DEPDIR = @DEPDIR@
-ECHO_C = @ECHO_C@
-ECHO_N = @ECHO_N@
-ECHO_T = @ECHO_T@
-EXEEXT = @EXEEXT@
-INSTALL = @INSTALL@
-INSTALL_DATA = @INSTALL_DATA@
-INSTALL_PROGRAM = @INSTALL_PROGRAM@
-INSTALL_SCRIPT = @INSTALL_SCRIPT@
-INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
-LDFLAGS = @LDFLAGS@
-LIBOBJS = @LIBOBJS@
-LIBS = @LIBS@
-LTLIBOBJS = @LTLIBOBJS@
-MAKEINFO = @MAKEINFO@
-MKDIR_P = @MKDIR_P@
-OBJEXT = @OBJEXT@
-PACKAGE = @PACKAGE@
-PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
-PACKAGE_NAME = @PACKAGE_NAME@
-PACKAGE_STRING = @PACKAGE_STRING@
-PACKAGE_TARNAME = @PACKAGE_TARNAME@
-PACKAGE_VERSION = @PACKAGE_VERSION@
-PATH_SEPARATOR = @PATH_SEPARATOR@
-SET_MAKE = @SET_MAKE@
-SHELL = @SHELL@
-STRIP = @STRIP@
-VERSION = @VERSION@
-abs_builddir = @abs_builddir@
-abs_srcdir = @abs_srcdir@
-abs_top_builddir = @abs_top_builddir@
-abs_top_srcdir = @abs_top_srcdir@
-ac_ct_CXX = @ac_ct_CXX@
-am__include = @am__include@
-am__leading_dot = @am__leading_dot@
-am__quote = @am__quote@
-am__tar = @am__tar@
-am__untar = @am__untar@
-bindir = @bindir@
-build_alias = @build_alias@
-builddir = @builddir@
-datadir = @datadir@
-datarootdir = @datarootdir@
-docdir = @docdir@
-dvidir = @dvidir@
-exec_prefix = @exec_prefix@
-host_alias = @host_alias@
-htmldir = @htmldir@
-includedir = @includedir@
-infodir = @infodir@
-install_sh = @install_sh@
-libdir = @libdir@
-libexecdir = @libexecdir@
-localedir = @localedir@
-localstatedir = @localstatedir@
-mandir = @mandir@
-mkdir_p = @mkdir_p@
-oldincludedir = @oldincludedir@
-pdfdir = @pdfdir@
-prefix = @prefix@
-program_transform_name = @program_transform_name@
-psdir = @psdir@
-sbindir = @sbindir@
-sharedstatedir = @sharedstatedir@
-srcdir = @srcdir@
-sysconfdir = @sysconfdir@
-target_alias = @target_alias@
-top_build_prefix = @top_build_prefix@
-top_builddir = @top_builddir@
-top_srcdir = @top_srcdir@
-SUBDIRS = src
-all: config.h
-	$(MAKE) $(AM_MAKEFLAGS) all-recursive
-
-.SUFFIXES:
-am--refresh:
-	@:
-$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
-	@for dep in $?; do \
-	  case '$(am__configure_deps)' in \
-	    *$$dep*) \
-	      echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \
-	      $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \
-		&& exit 0; \
-	      exit 1;; \
-	  esac; \
-	done; \
-	echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \
-	$(am__cd) $(top_srcdir) && \
-	  $(AUTOMAKE) --foreign Makefile
-.PRECIOUS: Makefile
-Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
-	@case '$?' in \
-	  *config.status*) \
-	    echo ' $(SHELL) ./config.status'; \
-	    $(SHELL) ./config.status;; \
-	  *) \
-	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
-	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
-	esac;
-
-$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
-	$(SHELL) ./config.status --recheck
-
-$(top_srcdir)/configure:  $(am__configure_deps)
-	$(am__cd) $(srcdir) && $(AUTOCONF)
-$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
-	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
-$(am__aclocal_m4_deps):
-
-config.h: stamp-h1
-	@if test ! -f $@; then \
-	  rm -f stamp-h1; \
-	  $(MAKE) $(AM_MAKEFLAGS) stamp-h1; \
-	else :; fi
-
-stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status
-	@rm -f stamp-h1
-	cd $(top_builddir) && $(SHELL) ./config.status config.h
-$(srcdir)/config.h.in:  $(am__configure_deps) 
-	($(am__cd) $(top_srcdir) && $(AUTOHEADER))
-	rm -f stamp-h1
-	touch $@
-
-distclean-hdr:
-	-rm -f config.h stamp-h1
-
-# This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    dot_seen=yes; \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done; \
-	if test "$$dot_seen" = "no"; then \
-	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
-	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
-tags-recursive:
-	list='$(SUBDIRS)'; for subdir in $$list; do \
-	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
-	done
-ctags-recursive:
-	list='$(SUBDIRS)'; for subdir in $$list; do \
-	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
-	done
-
-ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
-	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
-	unique=`for i in $$list; do \
-	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
-	  done | \
-	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
-	      END { if (nonempty) { for (i in files) print i; }; }'`; \
-	mkid -fID $$unique
-tags: TAGS
-
-TAGS: tags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
-		$(TAGS_FILES) $(LISP)
-	set x; \
-	here=`pwd`; \
-	if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
-	  include_option=--etags-include; \
-	  empty_fix=.; \
-	else \
-	  include_option=--include; \
-	  empty_fix=; \
-	fi; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
-	    test ! -f $$subdir/TAGS || \
-	      set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \
-	  fi; \
-	done; \
-	list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
-	unique=`for i in $$list; do \
-	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
-	  done | \
-	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
-	      END { if (nonempty) { for (i in files) print i; }; }'`; \
-	shift; \
-	if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
-	  test -n "$$unique" || unique=$$empty_fix; \
-	  if test $$# -gt 0; then \
-	    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
-	      "$$@" $$unique; \
-	  else \
-	    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
-	      $$unique; \
-	  fi; \
-	fi
-ctags: CTAGS
-CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
-		$(TAGS_FILES) $(LISP)
-	list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
-	unique=`for i in $$list; do \
-	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
-	  done | \
-	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
-	      END { if (nonempty) { for (i in files) print i; }; }'`; \
-	test -z "$(CTAGS_ARGS)$$unique" \
-	  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
-	     $$unique
-
-GTAGS:
-	here=`$(am__cd) $(top_builddir) && pwd` \
-	  && $(am__cd) $(top_srcdir) \
-	  && gtags -i $(GTAGS_ARGS) "$$here"
-
-distclean-tags:
-	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
-
-distdir: $(DISTFILES)
-	$(am__remove_distdir)
-	test -d "$(distdir)" || mkdir "$(distdir)"
-	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
-	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
-	list='$(DISTFILES)'; \
-	  dist_files=`for file in $$list; do echo $$file; done | \
-	  sed -e "s|^$$srcdirstrip/||;t" \
-	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
-	case $$dist_files in \
-	  */*) $(MKDIR_P) `echo "$$dist_files" | \
-			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
-			   sort -u` ;; \
-	esac; \
-	for file in $$dist_files; do \
-	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
-	  if test -d $$d/$$file; then \
-	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
-	    if test -d "$(distdir)/$$file"; then \
-	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
-	    fi; \
-	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
-	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
-	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
-	    fi; \
-	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
-	  else \
-	    test -f "$(distdir)/$$file" \
-	    || cp -p $$d/$$file "$(distdir)/$$file" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
-	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
-	    $(am__relativize); \
-	    new_distdir=$$reldir; \
-	    dir1=$$subdir; dir2="$(top_distdir)"; \
-	    $(am__relativize); \
-	    new_top_distdir=$$reldir; \
-	    echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \
-	    echo "     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \
-	    ($(am__cd) $$subdir && \
-	      $(MAKE) $(AM_MAKEFLAGS) \
-	        top_distdir="$$new_top_distdir" \
-	        distdir="$$new_distdir" \
-		am__remove_distdir=: \
-		am__skip_length_check=: \
-		am__skip_mode_fix=: \
-	        distdir) \
-	      || exit 1; \
-	  fi; \
-	done
-	-test -n "$(am__skip_mode_fix)" \
-	|| find "$(distdir)" -type d ! -perm -755 \
-		-exec chmod u+rwx,go+rx {} \; -o \
-	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
-	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
-	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
-	|| chmod -R a+r "$(distdir)"
-dist-gzip: distdir
-	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
-	$(am__remove_distdir)
-
-dist-bzip2: distdir
-	tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2
-	$(am__remove_distdir)
-
-dist-lzma: distdir
-	tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma
-	$(am__remove_distdir)
-
-dist-xz: distdir
-	tardir=$(distdir) && $(am__tar) | xz -c >$(distdir).tar.xz
-	$(am__remove_distdir)
-
-dist-tarZ: distdir
-	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
-	$(am__remove_distdir)
-
-dist-shar: distdir
-	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
-	$(am__remove_distdir)
-
-dist-zip: distdir
-	-rm -f $(distdir).zip
-	zip -rq $(distdir).zip $(distdir)
-	$(am__remove_distdir)
-
-dist dist-all: distdir
-	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
-	$(am__remove_distdir)
-
-# This target untars the dist file and tries a VPATH configuration.  Then
-# it guarantees that the distribution is self-contained by making another
-# tarfile.
-distcheck: dist
-	case '$(DIST_ARCHIVES)' in \
-	*.tar.gz*) \
-	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
-	*.tar.bz2*) \
-	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
-	*.tar.lzma*) \
-	  lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\
-	*.tar.xz*) \
-	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
-	*.tar.Z*) \
-	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
-	*.shar.gz*) \
-	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
-	*.zip*) \
-	  unzip $(distdir).zip ;;\
-	esac
-	chmod -R a-w $(distdir); chmod u+w $(distdir)
-	mkdir $(distdir)/_build
-	mkdir $(distdir)/_inst
-	chmod a-w $(distdir)
-	test -d $(distdir)/_build || exit 0; \
-	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
-	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
-	  && am__cwd=`pwd` \
-	  && $(am__cd) $(distdir)/_build \
-	  && ../configure --srcdir=.. --prefix="$$dc_install_base" \
-	    $(DISTCHECK_CONFIGURE_FLAGS) \
-	  && $(MAKE) $(AM_MAKEFLAGS) \
-	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
-	  && $(MAKE) $(AM_MAKEFLAGS) check \
-	  && $(MAKE) $(AM_MAKEFLAGS) install \
-	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
-	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
-	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
-	        distuninstallcheck \
-	  && chmod -R a-w "$$dc_install_base" \
-	  && ({ \
-	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
-	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
-	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
-	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
-	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
-	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
-	  && rm -rf "$$dc_destdir" \
-	  && $(MAKE) $(AM_MAKEFLAGS) dist \
-	  && rm -rf $(DIST_ARCHIVES) \
-	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
-	  && cd "$$am__cwd" \
-	  || exit 1
-	$(am__remove_distdir)
-	@(echo "$(distdir) archives ready for distribution: "; \
-	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
-	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
-distuninstallcheck:
-	@$(am__cd) '$(distuninstallcheck_dir)' \
-	&& test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \
-	   || { echo "ERROR: files left after uninstall:" ; \
-	        if test -n "$(DESTDIR)"; then \
-	          echo "  (check DESTDIR support)"; \
-	        fi ; \
-	        $(distuninstallcheck_listfiles) ; \
-	        exit 1; } >&2
-distcleancheck: distclean
-	@if test '$(srcdir)' = . ; then \
-	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
-	  exit 1 ; \
-	fi
-	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
-	  || { echo "ERROR: files left in build directory after distclean:" ; \
-	       $(distcleancheck_listfiles) ; \
-	       exit 1; } >&2
-check-am: all-am
-check: check-recursive
-all-am: Makefile config.h
-installdirs: installdirs-recursive
-installdirs-am:
-install: install-recursive
-install-exec: install-exec-recursive
-install-data: install-data-recursive
-uninstall: uninstall-recursive
-
-install-am: all-am
-	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
-
-installcheck: installcheck-recursive
-install-strip:
-	$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
-	  install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
-	  `test -z '$(STRIP)' || \
-	    echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
-mostlyclean-generic:
-
-clean-generic:
-
-distclean-generic:
-	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
-
-maintainer-clean-generic:
-	@echo "This command is intended for maintainers to use"
-	@echo "it deletes files that may require special tools to rebuild."
-clean: clean-recursive
-
-clean-am: clean-generic mostlyclean-am
-
-distclean: distclean-recursive
-	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
-	-rm -f Makefile
-distclean-am: clean-am distclean-generic distclean-hdr distclean-tags
-
-dvi: dvi-recursive
-
-dvi-am:
-
-html: html-recursive
-
-html-am:
-
-info: info-recursive
-
-info-am:
-
-install-data-am:
-
-install-dvi: install-dvi-recursive
-
-install-dvi-am:
-
-install-exec-am:
-
-install-html: install-html-recursive
-
-install-html-am:
-
-install-info: install-info-recursive
-
-install-info-am:
-
-install-man:
-
-install-pdf: install-pdf-recursive
-
-install-pdf-am:
-
-install-ps: install-ps-recursive
-
-install-ps-am:
-
-installcheck-am:
-
-maintainer-clean: maintainer-clean-recursive
-	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
-	-rm -rf $(top_srcdir)/autom4te.cache
-	-rm -f Makefile
-maintainer-clean-am: distclean-am maintainer-clean-generic
-
-mostlyclean: mostlyclean-recursive
-
-mostlyclean-am: mostlyclean-generic
-
-pdf: pdf-recursive
-
-pdf-am:
-
-ps: ps-recursive
-
-ps-am:
-
-uninstall-am:
-
-.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all \
-	ctags-recursive install-am install-strip tags-recursive
-
-.PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
-	all all-am am--refresh check check-am clean clean-generic \
-	ctags ctags-recursive dist dist-all dist-bzip2 dist-gzip \
-	dist-lzma dist-shar dist-tarZ dist-xz dist-zip distcheck \
-	distclean distclean-generic distclean-hdr distclean-tags \
-	distcleancheck distdir distuninstallcheck dvi dvi-am html \
-	html-am info info-am install install-am install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-pdf install-pdf-am \
-	install-ps install-ps-am install-strip installcheck \
-	installcheck-am installdirs installdirs-am maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-generic pdf \
-	pdf-am ps ps-am tags tags-recursive uninstall uninstall-am
-
-
-# Tell versions [3.59,3.63) of GNU make to not export all variables.
-# Otherwise a system limit (for SysV at least) may be exceeded.
-.NOEXPORT:
diff --git a/trinity-plugins/parafly-code/aclocal.m4 b/trinity-plugins/parafly-code/aclocal.m4
deleted file mode 100644
index bcc213b..0000000
--- a/trinity-plugins/parafly-code/aclocal.m4
+++ /dev/null
@@ -1,951 +0,0 @@
-# generated automatically by aclocal 1.11.1 -*- Autoconf -*-
-
-# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
-# 2005, 2006, 2007, 2008, 2009  Free Software Foundation, Inc.
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
-# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
-# PARTICULAR PURPOSE.
-
-m4_ifndef([AC_AUTOCONF_VERSION],
-  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
-m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.63],,
-[m4_warning([this file was generated for autoconf 2.63.
-You have another version of autoconf.  It may work, but is not guaranteed to.
-If you have problems, you may need to regenerate the build system entirely.
-To do so, use the procedure documented by the package, typically `autoreconf'.])])
-
-# Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# AM_AUTOMAKE_VERSION(VERSION)
-# ----------------------------
-# Automake X.Y traces this macro to ensure aclocal.m4 has been
-# generated from the m4 files accompanying Automake X.Y.
-# (This private macro should not be called outside this file.)
-AC_DEFUN([AM_AUTOMAKE_VERSION],
-[am__api_version='1.11'
-dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
-dnl require some minimum version.  Point them to the right macro.
-m4_if([$1], [1.11.1], [],
-      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
-])
-
-# _AM_AUTOCONF_VERSION(VERSION)
-# -----------------------------
-# aclocal traces this macro to find the Autoconf version.
-# This is a private macro too.  Using m4_define simplifies
-# the logic in aclocal, which can simply ignore this definition.
-m4_define([_AM_AUTOCONF_VERSION], [])
-
-# AM_SET_CURRENT_AUTOMAKE_VERSION
-# -------------------------------
-# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
-# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
-AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
-[AM_AUTOMAKE_VERSION([1.11.1])dnl
-m4_ifndef([AC_AUTOCONF_VERSION],
-  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
-_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
-
-# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-
-
-# Copyright (C) 2001, 2003, 2005  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
-# $ac_aux_dir to `$srcdir/foo'.  In other projects, it is set to
-# `$srcdir', `$srcdir/..', or `$srcdir/../..'.
-#
-# Of course, Automake must honor this variable whenever it calls a
-# tool from the auxiliary directory.  The problem is that $srcdir (and
-# therefore $ac_aux_dir as well) can be either absolute or relative,
-# depending on how configure is run.  This is pretty annoying, since
-# it makes $ac_aux_dir quite unusable in subdirectories: in the top
-# source directory, any form will work fine, but in subdirectories a
-# relative path needs to be adjusted first.
-#
-# $ac_aux_dir/missing
-#    fails when called from a subdirectory if $ac_aux_dir is relative
-# $top_srcdir/$ac_aux_dir/missing
-#    fails if $ac_aux_dir is absolute,
-#    fails when called from a subdirectory in a VPATH build with
-#          a relative $ac_aux_dir
-#
-# The reason of the latter failure is that $top_srcdir and $ac_aux_dir
-# are both prefixed by $srcdir.  In an in-source build this is usually
-# harmless because $srcdir is `.', but things will broke when you
-# start a VPATH build or use an absolute $srcdir.
-#
-# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
-# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:
-#   am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"`
-# and then we would define $MISSING as
-#   MISSING="\${SHELL} $am_aux_dir/missing"
-# This will work as long as MISSING is not called from configure, because
-# unfortunately $(top_srcdir) has no meaning in configure.
-# However there are other variables, like CC, which are often used in
-# configure, and could therefore not use this "fixed" $ac_aux_dir.
-#
-# Another solution, used here, is to always expand $ac_aux_dir to an
-# absolute PATH.  The drawback is that using absolute paths prevent a
-# configured tree to be moved without reconfiguration.
-
-AC_DEFUN([AM_AUX_DIR_EXPAND],
-[dnl Rely on autoconf to set up CDPATH properly.
-AC_PREREQ([2.50])dnl
-# expand $ac_aux_dir to an absolute path
-am_aux_dir=`cd $ac_aux_dir && pwd`
-])
-
-# AM_CONDITIONAL                                            -*- Autoconf -*-
-
-# Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008
-# Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 9
-
-# AM_CONDITIONAL(NAME, SHELL-CONDITION)
-# -------------------------------------
-# Define a conditional.
-AC_DEFUN([AM_CONDITIONAL],
-[AC_PREREQ(2.52)dnl
- ifelse([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
-	[$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
-AC_SUBST([$1_TRUE])dnl
-AC_SUBST([$1_FALSE])dnl
-_AM_SUBST_NOTMAKE([$1_TRUE])dnl
-_AM_SUBST_NOTMAKE([$1_FALSE])dnl
-m4_define([_AM_COND_VALUE_$1], [$2])dnl
-if $2; then
-  $1_TRUE=
-  $1_FALSE='#'
-else
-  $1_TRUE='#'
-  $1_FALSE=
-fi
-AC_CONFIG_COMMANDS_PRE(
-[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then
-  AC_MSG_ERROR([[conditional "$1" was never defined.
-Usually this means the macro was only invoked conditionally.]])
-fi])])
-
-# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009
-# Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 10
-
-# There are a few dirty hacks below to avoid letting `AC_PROG_CC' be
-# written in clear, in which case automake, when reading aclocal.m4,
-# will think it sees a *use*, and therefore will trigger all it's
-# C support machinery.  Also note that it means that autoscan, seeing
-# CC etc. in the Makefile, will ask for an AC_PROG_CC use...
-
-
-# _AM_DEPENDENCIES(NAME)
-# ----------------------
-# See how the compiler implements dependency checking.
-# NAME is "CC", "CXX", "GCJ", or "OBJC".
-# We try a few techniques and use that to set a single cache variable.
-#
-# We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was
-# modified to invoke _AM_DEPENDENCIES(CC); we would have a circular
-# dependency, and given that the user is not expected to run this macro,
-# just rely on AC_PROG_CC.
-AC_DEFUN([_AM_DEPENDENCIES],
-[AC_REQUIRE([AM_SET_DEPDIR])dnl
-AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl
-AC_REQUIRE([AM_MAKE_INCLUDE])dnl
-AC_REQUIRE([AM_DEP_TRACK])dnl
-
-ifelse([$1], CC,   [depcc="$CC"   am_compiler_list=],
-       [$1], CXX,  [depcc="$CXX"  am_compiler_list=],
-       [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
-       [$1], UPC,  [depcc="$UPC"  am_compiler_list=],
-       [$1], GCJ,  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
-                   [depcc="$$1"   am_compiler_list=])
-
-AC_CACHE_CHECK([dependency style of $depcc],
-               [am_cv_$1_dependencies_compiler_type],
-[if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
-  # We make a subdir and do the tests there.  Otherwise we can end up
-  # making bogus files that we don't know about and never remove.  For
-  # instance it was reported that on HP-UX the gcc test will end up
-  # making a dummy file named `D' -- because `-MD' means `put the output
-  # in D'.
-  mkdir conftest.dir
-  # Copy depcomp to subdir because otherwise we won't find it if we're
-  # using a relative directory.
-  cp "$am_depcomp" conftest.dir
-  cd conftest.dir
-  # We will build objects and dependencies in a subdirectory because
-  # it helps to detect inapplicable dependency modes.  For instance
-  # both Tru64's cc and ICC support -MD to output dependencies as a
-  # side effect of compilation, but ICC will put the dependencies in
-  # the current directory while Tru64 will put them in the object
-  # directory.
-  mkdir sub
-
-  am_cv_$1_dependencies_compiler_type=none
-  if test "$am_compiler_list" = ""; then
-     am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp`
-  fi
-  am__universal=false
-  m4_case([$1], [CC],
-    [case " $depcc " in #(
-     *\ -arch\ *\ -arch\ *) am__universal=true ;;
-     esac],
-    [CXX],
-    [case " $depcc " in #(
-     *\ -arch\ *\ -arch\ *) am__universal=true ;;
-     esac])
-
-  for depmode in $am_compiler_list; do
-    # Setup a source with many dependencies, because some compilers
-    # like to wrap large dependency lists on column 80 (with \), and
-    # we should not choose a depcomp mode which is confused by this.
-    #
-    # We need to recreate these files for each test, as the compiler may
-    # overwrite some of them when testing with obscure command lines.
-    # This happens at least with the AIX C compiler.
-    : > sub/conftest.c
-    for i in 1 2 3 4 5 6; do
-      echo '#include "conftst'$i'.h"' >> sub/conftest.c
-      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
-      # Solaris 8's {/usr,}/bin/sh.
-      touch sub/conftst$i.h
-    done
-    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
-
-    # We check with `-c' and `-o' for the sake of the "dashmstdout"
-    # mode.  It turns out that the SunPro C++ compiler does not properly
-    # handle `-M -o', and we need to detect this.  Also, some Intel
-    # versions had trouble with output in subdirs
-    am__obj=sub/conftest.${OBJEXT-o}
-    am__minus_obj="-o $am__obj"
-    case $depmode in
-    gcc)
-      # This depmode causes a compiler race in universal mode.
-      test "$am__universal" = false || continue
-      ;;
-    nosideeffect)
-      # after this tag, mechanisms are not by side-effect, so they'll
-      # only be used when explicitly requested
-      if test "x$enable_dependency_tracking" = xyes; then
-	continue
-      else
-	break
-      fi
-      ;;
-    msvisualcpp | msvcmsys)
-      # This compiler won't grok `-c -o', but also, the minuso test has
-      # not run yet.  These depmodes are late enough in the game, and
-      # so weak that their functioning should not be impacted.
-      am__obj=conftest.${OBJEXT-o}
-      am__minus_obj=
-      ;;
-    none) break ;;
-    esac
-    if depmode=$depmode \
-       source=sub/conftest.c object=$am__obj \
-       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
-       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
-         >/dev/null 2>conftest.err &&
-       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
-       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
-       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
-       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
-      # icc doesn't choke on unknown options, it will just issue warnings
-      # or remarks (even with -Werror).  So we grep stderr for any message
-      # that says an option was ignored or not supported.
-      # When given -MP, icc 7.0 and 7.1 complain thusly:
-      #   icc: Command line warning: ignoring option '-M'; no argument required
-      # The diagnosis changed in icc 8.0:
-      #   icc: Command line remark: option '-MP' not supported
-      if (grep 'ignoring option' conftest.err ||
-          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
-        am_cv_$1_dependencies_compiler_type=$depmode
-        break
-      fi
-    fi
-  done
-
-  cd ..
-  rm -rf conftest.dir
-else
-  am_cv_$1_dependencies_compiler_type=none
-fi
-])
-AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])
-AM_CONDITIONAL([am__fastdep$1], [
-  test "x$enable_dependency_tracking" != xno \
-  && test "$am_cv_$1_dependencies_compiler_type" = gcc3])
-])
-
-
-# AM_SET_DEPDIR
-# -------------
-# Choose a directory name for dependency files.
-# This macro is AC_REQUIREd in _AM_DEPENDENCIES
-AC_DEFUN([AM_SET_DEPDIR],
-[AC_REQUIRE([AM_SET_LEADING_DOT])dnl
-AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
-])
-
-
-# AM_DEP_TRACK
-# ------------
-AC_DEFUN([AM_DEP_TRACK],
-[AC_ARG_ENABLE(dependency-tracking,
-[  --disable-dependency-tracking  speeds up one-time build
-  --enable-dependency-tracking   do not reject slow dependency extractors])
-if test "x$enable_dependency_tracking" != xno; then
-  am_depcomp="$ac_aux_dir/depcomp"
-  AMDEPBACKSLASH='\'
-fi
-AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno])
-AC_SUBST([AMDEPBACKSLASH])dnl
-_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl
-])
-
-# Generate code to set up dependency tracking.              -*- Autoconf -*-
-
-# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008
-# Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-#serial 5
-
-# _AM_OUTPUT_DEPENDENCY_COMMANDS
-# ------------------------------
-AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],
-[{
-  # Autoconf 2.62 quotes --file arguments for eval, but not when files
-  # are listed without --file.  Let's play safe and only enable the eval
-  # if we detect the quoting.
-  case $CONFIG_FILES in
-  *\'*) eval set x "$CONFIG_FILES" ;;
-  *)   set x $CONFIG_FILES ;;
-  esac
-  shift
-  for mf
-  do
-    # Strip MF so we end up with the name of the file.
-    mf=`echo "$mf" | sed -e 's/:.*$//'`
-    # Check whether this is an Automake generated Makefile or not.
-    # We used to match only the files named `Makefile.in', but
-    # some people rename them; so instead we look at the file content.
-    # Grep'ing the first line is not enough: some people post-process
-    # each Makefile.in and add a new line on top of each file to say so.
-    # Grep'ing the whole file is not good either: AIX grep has a line
-    # limit of 2048, but all sed's we know have understand at least 4000.
-    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
-      dirpart=`AS_DIRNAME("$mf")`
-    else
-      continue
-    fi
-    # Extract the definition of DEPDIR, am__include, and am__quote
-    # from the Makefile without running `make'.
-    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
-    test -z "$DEPDIR" && continue
-    am__include=`sed -n 's/^am__include = //p' < "$mf"`
-    test -z "am__include" && continue
-    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
-    # When using ansi2knr, U may be empty or an underscore; expand it
-    U=`sed -n 's/^U = //p' < "$mf"`
-    # Find all dependency output files, they are included files with
-    # $(DEPDIR) in their names.  We invoke sed twice because it is the
-    # simplest approach to changing $(DEPDIR) to its actual value in the
-    # expansion.
-    for file in `sed -n "
-      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
-	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do
-      # Make sure the directory exists.
-      test -f "$dirpart/$file" && continue
-      fdir=`AS_DIRNAME(["$file"])`
-      AS_MKDIR_P([$dirpart/$fdir])
-      # echo "creating $dirpart/$file"
-      echo '# dummy' > "$dirpart/$file"
-    done
-  done
-}
-])# _AM_OUTPUT_DEPENDENCY_COMMANDS
-
-
-# AM_OUTPUT_DEPENDENCY_COMMANDS
-# -----------------------------
-# This macro should only be invoked once -- use via AC_REQUIRE.
-#
-# This code is only required when automatic dependency tracking
-# is enabled.  FIXME.  This creates each `.P' file that we will
-# need in order to bootstrap the dependency handling code.
-AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS],
-[AC_CONFIG_COMMANDS([depfiles],
-     [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS],
-     [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"])
-])
-
-# Do all the work for Automake.                             -*- Autoconf -*-
-
-# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
-# 2005, 2006, 2008, 2009 Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 16
-
-# This macro actually does too much.  Some checks are only needed if
-# your package does certain things.  But this isn't really a big deal.
-
-# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
-# AM_INIT_AUTOMAKE([OPTIONS])
-# -----------------------------------------------
-# The call with PACKAGE and VERSION arguments is the old style
-# call (pre autoconf-2.50), which is being phased out.  PACKAGE
-# and VERSION should now be passed to AC_INIT and removed from
-# the call to AM_INIT_AUTOMAKE.
-# We support both call styles for the transition.  After
-# the next Automake release, Autoconf can make the AC_INIT
-# arguments mandatory, and then we can depend on a new Autoconf
-# release and drop the old call support.
-AC_DEFUN([AM_INIT_AUTOMAKE],
-[AC_PREREQ([2.62])dnl
-dnl Autoconf wants to disallow AM_ names.  We explicitly allow
-dnl the ones we care about.
-m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
-AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
-AC_REQUIRE([AC_PROG_INSTALL])dnl
-if test "`cd $srcdir && pwd`" != "`pwd`"; then
-  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
-  # is not polluted with repeated "-I."
-  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
-  # test to see if srcdir already configured
-  if test -f $srcdir/config.status; then
-    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
-  fi
-fi
-
-# test whether we have cygpath
-if test -z "$CYGPATH_W"; then
-  if (cygpath --version) >/dev/null 2>/dev/null; then
-    CYGPATH_W='cygpath -w'
-  else
-    CYGPATH_W=echo
-  fi
-fi
-AC_SUBST([CYGPATH_W])
-
-# Define the identity of the package.
-dnl Distinguish between old-style and new-style calls.
-m4_ifval([$2],
-[m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
- AC_SUBST([PACKAGE], [$1])dnl
- AC_SUBST([VERSION], [$2])],
-[_AM_SET_OPTIONS([$1])dnl
-dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
-m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,,
-  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
- AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
- AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
-
-_AM_IF_OPTION([no-define],,
-[AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package])
- AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl
-
-# Some tools Automake needs.
-AC_REQUIRE([AM_SANITY_CHECK])dnl
-AC_REQUIRE([AC_ARG_PROGRAM])dnl
-AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version})
-AM_MISSING_PROG(AUTOCONF, autoconf)
-AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version})
-AM_MISSING_PROG(AUTOHEADER, autoheader)
-AM_MISSING_PROG(MAKEINFO, makeinfo)
-AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
-AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
-AC_REQUIRE([AM_PROG_MKDIR_P])dnl
-# We need awk for the "check" target.  The system "awk" is bad on
-# some platforms.
-AC_REQUIRE([AC_PROG_AWK])dnl
-AC_REQUIRE([AC_PROG_MAKE_SET])dnl
-AC_REQUIRE([AM_SET_LEADING_DOT])dnl
-_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
-	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
-			     [_AM_PROG_TAR([v7])])])
-_AM_IF_OPTION([no-dependencies],,
-[AC_PROVIDE_IFELSE([AC_PROG_CC],
-		  [_AM_DEPENDENCIES(CC)],
-		  [define([AC_PROG_CC],
-			  defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl
-AC_PROVIDE_IFELSE([AC_PROG_CXX],
-		  [_AM_DEPENDENCIES(CXX)],
-		  [define([AC_PROG_CXX],
-			  defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl
-AC_PROVIDE_IFELSE([AC_PROG_OBJC],
-		  [_AM_DEPENDENCIES(OBJC)],
-		  [define([AC_PROG_OBJC],
-			  defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl
-])
-_AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl
-dnl The `parallel-tests' driver may need to know about EXEEXT, so add the
-dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This macro
-dnl is hooked onto _AC_COMPILER_EXEEXT early, see below.
-AC_CONFIG_COMMANDS_PRE(dnl
-[m4_provide_if([_AM_COMPILER_EXEEXT],
-  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
-])
-
-dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
-dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
-dnl mangled by Autoconf and run in a shell conditional statement.
-m4_define([_AC_COMPILER_EXEEXT],
-m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])
-
-
-# When config.status generates a header, we must update the stamp-h file.
-# This file resides in the same directory as the config header
-# that is generated.  The stamp files are numbered to have different names.
-
-# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the
-# loop where config.status creates the headers, so we can generate
-# our stamp files there.
-AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],
-[# Compute $1's index in $config_headers.
-_am_arg=$1
-_am_stamp_count=1
-for _am_header in $config_headers :; do
-  case $_am_header in
-    $_am_arg | $_am_arg:* )
-      break ;;
-    * )
-      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
-  esac
-done
-echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
-
-# Copyright (C) 2001, 2003, 2005, 2008  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# AM_PROG_INSTALL_SH
-# ------------------
-# Define $install_sh.
-AC_DEFUN([AM_PROG_INSTALL_SH],
-[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
-if test x"${install_sh}" != xset; then
-  case $am_aux_dir in
-  *\ * | *\	*)
-    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
-  *)
-    install_sh="\${SHELL} $am_aux_dir/install-sh"
-  esac
-fi
-AC_SUBST(install_sh)])
-
-# Copyright (C) 2003, 2005  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 2
-
-# Check whether the underlying file-system supports filenames
-# with a leading dot.  For instance MS-DOS doesn't.
-AC_DEFUN([AM_SET_LEADING_DOT],
-[rm -rf .tst 2>/dev/null
-mkdir .tst 2>/dev/null
-if test -d .tst; then
-  am__leading_dot=.
-else
-  am__leading_dot=_
-fi
-rmdir .tst 2>/dev/null
-AC_SUBST([am__leading_dot])])
-
-# Check to see how 'make' treats includes.	            -*- Autoconf -*-
-
-# Copyright (C) 2001, 2002, 2003, 2005, 2009  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 4
-
-# AM_MAKE_INCLUDE()
-# -----------------
-# Check to see how make treats includes.
-AC_DEFUN([AM_MAKE_INCLUDE],
-[am_make=${MAKE-make}
-cat > confinc << 'END'
-am__doit:
-	@echo this is the am__doit target
-.PHONY: am__doit
-END
-# If we don't find an include directive, just comment out the code.
-AC_MSG_CHECKING([for style of include used by $am_make])
-am__include="#"
-am__quote=
-_am_result=none
-# First try GNU make style include.
-echo "include confinc" > confmf
-# Ignore all kinds of additional output from `make'.
-case `$am_make -s -f confmf 2> /dev/null` in #(
-*the\ am__doit\ target*)
-  am__include=include
-  am__quote=
-  _am_result=GNU
-  ;;
-esac
-# Now try BSD make style include.
-if test "$am__include" = "#"; then
-   echo '.include "confinc"' > confmf
-   case `$am_make -s -f confmf 2> /dev/null` in #(
-   *the\ am__doit\ target*)
-     am__include=.include
-     am__quote="\""
-     _am_result=BSD
-     ;;
-   esac
-fi
-AC_SUBST([am__include])
-AC_SUBST([am__quote])
-AC_MSG_RESULT([$_am_result])
-rm -f confinc confmf
-])
-
-# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-
-
-# Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008
-# Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 6
-
-# AM_MISSING_PROG(NAME, PROGRAM)
-# ------------------------------
-AC_DEFUN([AM_MISSING_PROG],
-[AC_REQUIRE([AM_MISSING_HAS_RUN])
-$1=${$1-"${am_missing_run}$2"}
-AC_SUBST($1)])
-
-
-# AM_MISSING_HAS_RUN
-# ------------------
-# Define MISSING if not defined so far and test if it supports --run.
-# If it does, set am_missing_run to use it, otherwise, to nothing.
-AC_DEFUN([AM_MISSING_HAS_RUN],
-[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
-AC_REQUIRE_AUX_FILE([missing])dnl
-if test x"${MISSING+set}" != xset; then
-  case $am_aux_dir in
-  *\ * | *\	*)
-    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
-  *)
-    MISSING="\${SHELL} $am_aux_dir/missing" ;;
-  esac
-fi
-# Use eval to expand $SHELL
-if eval "$MISSING --run true"; then
-  am_missing_run="$MISSING --run "
-else
-  am_missing_run=
-  AC_MSG_WARN([`missing' script is too old or missing])
-fi
-])
-
-# Copyright (C) 2003, 2004, 2005, 2006  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# AM_PROG_MKDIR_P
-# ---------------
-# Check for `mkdir -p'.
-AC_DEFUN([AM_PROG_MKDIR_P],
-[AC_PREREQ([2.60])dnl
-AC_REQUIRE([AC_PROG_MKDIR_P])dnl
-dnl Automake 1.8 to 1.9.6 used to define mkdir_p.  We now use MKDIR_P,
-dnl while keeping a definition of mkdir_p for backward compatibility.
-dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile.
-dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of
-dnl Makefile.ins that do not define MKDIR_P, so we do our own
-dnl adjustment using top_builddir (which is defined more often than
-dnl MKDIR_P).
-AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl
-case $mkdir_p in
-  [[\\/$]]* | ?:[[\\/]]*) ;;
-  */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
-esac
-])
-
-# Helper functions for option handling.                     -*- Autoconf -*-
-
-# Copyright (C) 2001, 2002, 2003, 2005, 2008  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 4
-
-# _AM_MANGLE_OPTION(NAME)
-# -----------------------
-AC_DEFUN([_AM_MANGLE_OPTION],
-[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
-
-# _AM_SET_OPTION(NAME)
-# ------------------------------
-# Set option NAME.  Presently that only means defining a flag for this option.
-AC_DEFUN([_AM_SET_OPTION],
-[m4_define(_AM_MANGLE_OPTION([$1]), 1)])
-
-# _AM_SET_OPTIONS(OPTIONS)
-# ----------------------------------
-# OPTIONS is a space-separated list of Automake options.
-AC_DEFUN([_AM_SET_OPTIONS],
-[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
-
-# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])
-# -------------------------------------------
-# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
-AC_DEFUN([_AM_IF_OPTION],
-[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
-
-# Check to make sure that the build environment is sane.    -*- Autoconf -*-
-
-# Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008
-# Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 5
-
-# AM_SANITY_CHECK
-# ---------------
-AC_DEFUN([AM_SANITY_CHECK],
-[AC_MSG_CHECKING([whether build environment is sane])
-# Just in case
-sleep 1
-echo timestamp > conftest.file
-# Reject unsafe characters in $srcdir or the absolute working directory
-# name.  Accept space and tab only in the latter.
-am_lf='
-'
-case `pwd` in
-  *[[\\\"\#\$\&\'\`$am_lf]]*)
-    AC_MSG_ERROR([unsafe absolute working directory name]);;
-esac
-case $srcdir in
-  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
-    AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);;
-esac
-
-# Do `set' in a subshell so we don't clobber the current shell's
-# arguments.  Must try -L first in case configure is actually a
-# symlink; some systems play weird games with the mod time of symlinks
-# (eg FreeBSD returns the mod time of the symlink's containing
-# directory).
-if (
-   set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
-   if test "$[*]" = "X"; then
-      # -L didn't work.
-      set X `ls -t "$srcdir/configure" conftest.file`
-   fi
-   rm -f conftest.file
-   if test "$[*]" != "X $srcdir/configure conftest.file" \
-      && test "$[*]" != "X conftest.file $srcdir/configure"; then
-
-      # If neither matched, then we have a broken ls.  This can happen
-      # if, for instance, CONFIG_SHELL is bash and it inherits a
-      # broken ls alias from the environment.  This has actually
-      # happened.  Such a system could not be considered "sane".
-      AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
-alias in your environment])
-   fi
-
-   test "$[2]" = conftest.file
-   )
-then
-   # Ok.
-   :
-else
-   AC_MSG_ERROR([newly created file is older than distributed files!
-Check your system clock])
-fi
-AC_MSG_RESULT(yes)])
-
-# Copyright (C) 2001, 2003, 2005  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# AM_PROG_INSTALL_STRIP
-# ---------------------
-# One issue with vendor `install' (even GNU) is that you can't
-# specify the program used to strip binaries.  This is especially
-# annoying in cross-compiling environments, where the build's strip
-# is unlikely to handle the host's binaries.
-# Fortunately install-sh will honor a STRIPPROG variable, so we
-# always use install-sh in `make install-strip', and initialize
-# STRIPPROG with the value of the STRIP variable (set by the user).
-AC_DEFUN([AM_PROG_INSTALL_STRIP],
-[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
-# Installed binaries are usually stripped using `strip' when the user
-# run `make install-strip'.  However `strip' might not be the right
-# tool to use in cross-compilation environments, therefore Automake
-# will honor the `STRIP' environment variable to overrule this program.
-dnl Don't test for $cross_compiling = yes, because it might be `maybe'.
-if test "$cross_compiling" != no; then
-  AC_CHECK_TOOL([STRIP], [strip], :)
-fi
-INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
-AC_SUBST([INSTALL_STRIP_PROGRAM])])
-
-# Copyright (C) 2006, 2008  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 2
-
-# _AM_SUBST_NOTMAKE(VARIABLE)
-# ---------------------------
-# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
-# This macro is traced by Automake.
-AC_DEFUN([_AM_SUBST_NOTMAKE])
-
-# AM_SUBST_NOTMAKE(VARIABLE)
-# ---------------------------
-# Public sister of _AM_SUBST_NOTMAKE.
-AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
-
-# Check how to create a tarball.                            -*- Autoconf -*-
-
-# Copyright (C) 2004, 2005  Free Software Foundation, Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 2
-
-# _AM_PROG_TAR(FORMAT)
-# --------------------
-# Check how to create a tarball in format FORMAT.
-# FORMAT should be one of `v7', `ustar', or `pax'.
-#
-# Substitute a variable $(am__tar) that is a command
-# writing to stdout a FORMAT-tarball containing the directory
-# $tardir.
-#     tardir=directory && $(am__tar) > result.tar
-#
-# Substitute a variable $(am__untar) that extract such
-# a tarball read from stdin.
-#     $(am__untar) < result.tar
-AC_DEFUN([_AM_PROG_TAR],
-[# Always define AMTAR for backward compatibility.
-AM_MISSING_PROG([AMTAR], [tar])
-m4_if([$1], [v7],
-     [am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'],
-     [m4_case([$1], [ustar],, [pax],,
-              [m4_fatal([Unknown tar format])])
-AC_MSG_CHECKING([how to create a $1 tar archive])
-# Loop over all known methods to create a tar archive until one works.
-_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
-_am_tools=${am_cv_prog_tar_$1-$_am_tools}
-# Do not fold the above two line into one, because Tru64 sh and
-# Solaris sh will not grok spaces in the rhs of `-'.
-for _am_tool in $_am_tools
-do
-  case $_am_tool in
-  gnutar)
-    for _am_tar in tar gnutar gtar;
-    do
-      AM_RUN_LOG([$_am_tar --version]) && break
-    done
-    am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
-    am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
-    am__untar="$_am_tar -xf -"
-    ;;
-  plaintar)
-    # Must skip GNU tar: if it does not support --format= it doesn't create
-    # ustar tarball either.
-    (tar --version) >/dev/null 2>&1 && continue
-    am__tar='tar chf - "$$tardir"'
-    am__tar_='tar chf - "$tardir"'
-    am__untar='tar xf -'
-    ;;
-  pax)
-    am__tar='pax -L -x $1 -w "$$tardir"'
-    am__tar_='pax -L -x $1 -w "$tardir"'
-    am__untar='pax -r'
-    ;;
-  cpio)
-    am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
-    am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
-    am__untar='cpio -i -H $1 -d'
-    ;;
-  none)
-    am__tar=false
-    am__tar_=false
-    am__untar=false
-    ;;
-  esac
-
-  # If the value was cached, stop now.  We just wanted to have am__tar
-  # and am__untar set.
-  test -n "${am_cv_prog_tar_$1}" && break
-
-  # tar/untar a dummy directory, and stop if the command works
-  rm -rf conftest.dir
-  mkdir conftest.dir
-  echo GrepMe > conftest.dir/file
-  AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
-  rm -rf conftest.dir
-  if test -s conftest.tar; then
-    AM_RUN_LOG([$am__untar <conftest.tar])
-    grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
-  fi
-done
-rm -rf conftest.dir
-
-AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
-AC_MSG_RESULT([$am_cv_prog_tar_$1])])
-AC_SUBST([am__tar])
-AC_SUBST([am__untar])
-]) # _AM_PROG_TAR
-
diff --git a/trinity-plugins/parafly-code/config.h b/trinity-plugins/parafly-code/config.h
deleted file mode 100644
index 31b7679..0000000
--- a/trinity-plugins/parafly-code/config.h
+++ /dev/null
@@ -1,23 +0,0 @@
-/* config.h.  Generated from config.h.in by configure.  */
-/* config.h.in.  Generated from configure.ac by autoheader.  */
-
-/* Name of package */
-#define PACKAGE "parafly"
-
-/* Define to the address where bug reports for this package should be sent. */
-#define PACKAGE_BUGREPORT "bug-report at address"
-
-/* Define to the full name of this package. */
-#define PACKAGE_NAME "Parafly"
-
-/* Define to the full name and version of this package. */
-#define PACKAGE_STRING "Parafly 0.1"
-
-/* Define to the one symbol short name of this package. */
-#define PACKAGE_TARNAME "parafly"
-
-/* Define to the version of this package. */
-#define PACKAGE_VERSION "0.1"
-
-/* Version number of package */
-#define VERSION "0.1"
diff --git a/trinity-plugins/parafly-code/config.h.in b/trinity-plugins/parafly-code/config.h.in
deleted file mode 100644
index c364eda..0000000
--- a/trinity-plugins/parafly-code/config.h.in
+++ /dev/null
@@ -1,22 +0,0 @@
-/* config.h.in.  Generated from configure.ac by autoheader.  */
-
-/* Name of package */
-#undef PACKAGE
-
-/* Define to the address where bug reports for this package should be sent. */
-#undef PACKAGE_BUGREPORT
-
-/* Define to the full name of this package. */
-#undef PACKAGE_NAME
-
-/* Define to the full name and version of this package. */
-#undef PACKAGE_STRING
-
-/* Define to the one symbol short name of this package. */
-#undef PACKAGE_TARNAME
-
-/* Define to the version of this package. */
-#undef PACKAGE_VERSION
-
-/* Version number of package */
-#undef VERSION
diff --git a/trinity-plugins/parafly-code/configure b/trinity-plugins/parafly-code/configure
deleted file mode 100755
index 740f187..0000000
--- a/trinity-plugins/parafly-code/configure
+++ /dev/null
@@ -1,4685 +0,0 @@
-#! /bin/sh
-# Guess values for system-dependent variables and create Makefiles.
-# Generated by GNU Autoconf 2.63 for Parafly 0.1.
-#
-# Report bugs to <bug-report at address>.
-#
-# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
-# 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
-# This configure script is free software; the Free Software Foundation
-# gives unlimited permission to copy, distribute and modify it.
-## --------------------- ##
-## M4sh Initialization.  ##
-## --------------------- ##
-
-# Be more Bourne compatible
-DUALCASE=1; export DUALCASE # for MKS sh
-if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
-  emulate sh
-  NULLCMD=:
-  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
-  # is contrary to our usage.  Disable this feature.
-  alias -g '${1+"$@"}'='"$@"'
-  setopt NO_GLOB_SUBST
-else
-  case `(set -o) 2>/dev/null` in
-  *posix*) set -o posix ;;
-esac
-
-fi
-
-
-
-
-# PATH needs CR
-# Avoid depending upon Character Ranges.
-as_cr_letters='abcdefghijklmnopqrstuvwxyz'
-as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
-as_cr_Letters=$as_cr_letters$as_cr_LETTERS
-as_cr_digits='0123456789'
-as_cr_alnum=$as_cr_Letters$as_cr_digits
-
-as_nl='
-'
-export as_nl
-# Printing a long string crashes Solaris 7 /usr/bin/printf.
-as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
-as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
-as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
-if (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
-  as_echo='printf %s\n'
-  as_echo_n='printf %s'
-else
-  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
-    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
-    as_echo_n='/usr/ucb/echo -n'
-  else
-    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
-    as_echo_n_body='eval
-      arg=$1;
-      case $arg in
-      *"$as_nl"*)
-	expr "X$arg" : "X\\(.*\\)$as_nl";
-	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
-      esac;
-      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
-    '
-    export as_echo_n_body
-    as_echo_n='sh -c $as_echo_n_body as_echo'
-  fi
-  export as_echo_body
-  as_echo='sh -c $as_echo_body as_echo'
-fi
-
-# The user is always right.
-if test "${PATH_SEPARATOR+set}" != set; then
-  PATH_SEPARATOR=:
-  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
-    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
-      PATH_SEPARATOR=';'
-  }
-fi
-
-# Support unset when possible.
-if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then
-  as_unset=unset
-else
-  as_unset=false
-fi
-
-
-# IFS
-# We need space, tab and new line, in precisely that order.  Quoting is
-# there to prevent editors from complaining about space-tab.
-# (If _AS_PATH_WALK were called with IFS unset, it would disable word
-# splitting by setting IFS to empty value.)
-IFS=" ""	$as_nl"
-
-# Find who we are.  Look in the path if we contain no directory separator.
-case $0 in
-  *[\\/]* ) as_myself=$0 ;;
-  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
-done
-IFS=$as_save_IFS
-
-     ;;
-esac
-# We did not find ourselves, most probably we were run as `sh COMMAND'
-# in which case we are not to be found in the path.
-if test "x$as_myself" = x; then
-  as_myself=$0
-fi
-if test ! -f "$as_myself"; then
-  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
-  { (exit 1); exit 1; }
-fi
-
-# Work around bugs in pre-3.0 UWIN ksh.
-for as_var in ENV MAIL MAILPATH
-do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
-done
-PS1='$ '
-PS2='> '
-PS4='+ '
-
-# NLS nuisances.
-LC_ALL=C
-export LC_ALL
-LANGUAGE=C
-export LANGUAGE
-
-# Required to use basename.
-if expr a : '\(a\)' >/dev/null 2>&1 &&
-   test "X`expr 00001 : '.*\(...\)'`" = X001; then
-  as_expr=expr
-else
-  as_expr=false
-fi
-
-if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
-  as_basename=basename
-else
-  as_basename=false
-fi
-
-
-# Name of the executable.
-as_me=`$as_basename -- "$0" ||
-$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
-	 X"$0" : 'X\(//\)$' \| \
-	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X/"$0" |
-    sed '/^.*\/\([^/][^/]*\)\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\/\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\/\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-
-# CDPATH.
-$as_unset CDPATH
-
-
-if test "x$CONFIG_SHELL" = x; then
-  if (eval ":") 2>/dev/null; then
-  as_have_required=yes
-else
-  as_have_required=no
-fi
-
-  if test $as_have_required = yes &&	 (eval ":
-(as_func_return () {
-  (exit \$1)
-}
-as_func_success () {
-  as_func_return 0
-}
-as_func_failure () {
-  as_func_return 1
-}
-as_func_ret_success () {
-  return 0
-}
-as_func_ret_failure () {
-  return 1
-}
-
-exitcode=0
-if as_func_success; then
-  :
-else
-  exitcode=1
-  echo as_func_success failed.
-fi
-
-if as_func_failure; then
-  exitcode=1
-  echo as_func_failure succeeded.
-fi
-
-if as_func_ret_success; then
-  :
-else
-  exitcode=1
-  echo as_func_ret_success failed.
-fi
-
-if as_func_ret_failure; then
-  exitcode=1
-  echo as_func_ret_failure succeeded.
-fi
-
-if ( set x; as_func_ret_success y && test x = \"\$1\" ); then
-  :
-else
-  exitcode=1
-  echo positional parameters were not saved.
-fi
-
-test \$exitcode = 0) || { (exit 1); exit 1; }
-
-(
-  as_lineno_1=\$LINENO
-  as_lineno_2=\$LINENO
-  test \"x\$as_lineno_1\" != \"x\$as_lineno_2\" &&
-  test \"x\`expr \$as_lineno_1 + 1\`\" = \"x\$as_lineno_2\") || { (exit 1); exit 1; }
-") 2> /dev/null; then
-  :
-else
-  as_candidate_shells=
-    as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  case $as_dir in
-	 /*)
-	   for as_base in sh bash ksh sh5; do
-	     as_candidate_shells="$as_candidate_shells $as_dir/$as_base"
-	   done;;
-       esac
-done
-IFS=$as_save_IFS
-
-
-      for as_shell in $as_candidate_shells $SHELL; do
-	 # Try only shells that exist, to save several forks.
-	 if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
-		{ ("$as_shell") 2> /dev/null <<\_ASEOF
-if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
-  emulate sh
-  NULLCMD=:
-  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
-  # is contrary to our usage.  Disable this feature.
-  alias -g '${1+"$@"}'='"$@"'
-  setopt NO_GLOB_SUBST
-else
-  case `(set -o) 2>/dev/null` in
-  *posix*) set -o posix ;;
-esac
-
-fi
-
-
-:
-_ASEOF
-}; then
-  CONFIG_SHELL=$as_shell
-	       as_have_required=yes
-	       if { "$as_shell" 2> /dev/null <<\_ASEOF
-if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
-  emulate sh
-  NULLCMD=:
-  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
-  # is contrary to our usage.  Disable this feature.
-  alias -g '${1+"$@"}'='"$@"'
-  setopt NO_GLOB_SUBST
-else
-  case `(set -o) 2>/dev/null` in
-  *posix*) set -o posix ;;
-esac
-
-fi
-
-
-:
-(as_func_return () {
-  (exit $1)
-}
-as_func_success () {
-  as_func_return 0
-}
-as_func_failure () {
-  as_func_return 1
-}
-as_func_ret_success () {
-  return 0
-}
-as_func_ret_failure () {
-  return 1
-}
-
-exitcode=0
-if as_func_success; then
-  :
-else
-  exitcode=1
-  echo as_func_success failed.
-fi
-
-if as_func_failure; then
-  exitcode=1
-  echo as_func_failure succeeded.
-fi
-
-if as_func_ret_success; then
-  :
-else
-  exitcode=1
-  echo as_func_ret_success failed.
-fi
-
-if as_func_ret_failure; then
-  exitcode=1
-  echo as_func_ret_failure succeeded.
-fi
-
-if ( set x; as_func_ret_success y && test x = "$1" ); then
-  :
-else
-  exitcode=1
-  echo positional parameters were not saved.
-fi
-
-test $exitcode = 0) || { (exit 1); exit 1; }
-
-(
-  as_lineno_1=$LINENO
-  as_lineno_2=$LINENO
-  test "x$as_lineno_1" != "x$as_lineno_2" &&
-  test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2") || { (exit 1); exit 1; }
-
-_ASEOF
-}; then
-  break
-fi
-
-fi
-
-      done
-
-      if test "x$CONFIG_SHELL" != x; then
-  for as_var in BASH_ENV ENV
-	do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
-	done
-	export CONFIG_SHELL
-	exec "$CONFIG_SHELL" "$as_myself" ${1+"$@"}
-fi
-
-
-    if test $as_have_required = no; then
-  echo This script requires a shell more modern than all the
-      echo shells that I found on your system.  Please install a
-      echo modern shell, or manually run the script under such a
-      echo shell if you do have one.
-      { (exit 1); exit 1; }
-fi
-
-
-fi
-
-fi
-
-
-
-(eval "as_func_return () {
-  (exit \$1)
-}
-as_func_success () {
-  as_func_return 0
-}
-as_func_failure () {
-  as_func_return 1
-}
-as_func_ret_success () {
-  return 0
-}
-as_func_ret_failure () {
-  return 1
-}
-
-exitcode=0
-if as_func_success; then
-  :
-else
-  exitcode=1
-  echo as_func_success failed.
-fi
-
-if as_func_failure; then
-  exitcode=1
-  echo as_func_failure succeeded.
-fi
-
-if as_func_ret_success; then
-  :
-else
-  exitcode=1
-  echo as_func_ret_success failed.
-fi
-
-if as_func_ret_failure; then
-  exitcode=1
-  echo as_func_ret_failure succeeded.
-fi
-
-if ( set x; as_func_ret_success y && test x = \"\$1\" ); then
-  :
-else
-  exitcode=1
-  echo positional parameters were not saved.
-fi
-
-test \$exitcode = 0") || {
-  echo No shell found that supports shell functions.
-  echo Please tell bug-autoconf at gnu.org about your system,
-  echo including any error possibly output before this message.
-  echo This can help us improve future autoconf versions.
-  echo Configuration will now proceed without shell functions.
-}
-
-
-
-  as_lineno_1=$LINENO
-  as_lineno_2=$LINENO
-  test "x$as_lineno_1" != "x$as_lineno_2" &&
-  test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2" || {
-
-  # Create $as_me.lineno as a copy of $as_myself, but with $LINENO
-  # uniformly replaced by the line number.  The first 'sed' inserts a
-  # line-number line after each line using $LINENO; the second 'sed'
-  # does the real work.  The second script uses 'N' to pair each
-  # line-number line with the line containing $LINENO, and appends
-  # trailing '-' during substitution so that $LINENO is not a special
-  # case at line end.
-  # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the
-  # scripts with optimization help from Paolo Bonzini.  Blame Lee
-  # E. McMahon (1931-1989) for sed's syntax.  :-)
-  sed -n '
-    p
-    /[$]LINENO/=
-  ' <$as_myself |
-    sed '
-      s/[$]LINENO.*/&-/
-      t lineno
-      b
-      :lineno
-      N
-      :loop
-      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
-      t loop
-      s/-\n.*//
-    ' >$as_me.lineno &&
-  chmod +x "$as_me.lineno" ||
-    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2
-   { (exit 1); exit 1; }; }
-
-  # Don't try to exec as it changes $[0], causing all sort of problems
-  # (the dirname of $[0] is not the place where we might find the
-  # original and so on.  Autoconf is especially sensitive to this).
-  . "./$as_me.lineno"
-  # Exit status is that of the last command.
-  exit
-}
-
-
-if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
-  as_dirname=dirname
-else
-  as_dirname=false
-fi
-
-ECHO_C= ECHO_N= ECHO_T=
-case `echo -n x` in
--n*)
-  case `echo 'x\c'` in
-  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
-  *)   ECHO_C='\c';;
-  esac;;
-*)
-  ECHO_N='-n';;
-esac
-if expr a : '\(a\)' >/dev/null 2>&1 &&
-   test "X`expr 00001 : '.*\(...\)'`" = X001; then
-  as_expr=expr
-else
-  as_expr=false
-fi
-
-rm -f conf$$ conf$$.exe conf$$.file
-if test -d conf$$.dir; then
-  rm -f conf$$.dir/conf$$.file
-else
-  rm -f conf$$.dir
-  mkdir conf$$.dir 2>/dev/null
-fi
-if (echo >conf$$.file) 2>/dev/null; then
-  if ln -s conf$$.file conf$$ 2>/dev/null; then
-    as_ln_s='ln -s'
-    # ... but there are two gotchas:
-    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
-    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
-    # In both cases, we have to default to `cp -p'.
-    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
-      as_ln_s='cp -p'
-  elif ln conf$$.file conf$$ 2>/dev/null; then
-    as_ln_s=ln
-  else
-    as_ln_s='cp -p'
-  fi
-else
-  as_ln_s='cp -p'
-fi
-rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
-rmdir conf$$.dir 2>/dev/null
-
-if mkdir -p . 2>/dev/null; then
-  as_mkdir_p=:
-else
-  test -d ./-p && rmdir ./-p
-  as_mkdir_p=false
-fi
-
-if test -x / >/dev/null 2>&1; then
-  as_test_x='test -x'
-else
-  if ls -dL / >/dev/null 2>&1; then
-    as_ls_L_option=L
-  else
-    as_ls_L_option=
-  fi
-  as_test_x='
-    eval sh -c '\''
-      if test -d "$1"; then
-	test -d "$1/.";
-      else
-	case $1 in
-	-*)set "./$1";;
-	esac;
-	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in
-	???[sx]*):;;*)false;;esac;fi
-    '\'' sh
-  '
-fi
-as_executable_p=$as_test_x
-
-# Sed expression to map a string onto a valid CPP name.
-as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
-
-# Sed expression to map a string onto a valid variable name.
-as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
-
-
-
-exec 7<&0 </dev/null 6>&1
-
-# Name of the host.
-# hostname on some systems (SVR3.2, Linux) returns a bogus exit status,
-# so uname gets run too.
-ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
-
-#
-# Initializations.
-#
-ac_default_prefix=/usr/local
-ac_clean_files=
-ac_config_libobj_dir=.
-LIBOBJS=
-cross_compiling=no
-subdirs=
-MFLAGS=
-MAKEFLAGS=
-SHELL=${CONFIG_SHELL-/bin/sh}
-
-# Identity of this package.
-PACKAGE_NAME='Parafly'
-PACKAGE_TARNAME='parafly'
-PACKAGE_VERSION='0.1'
-PACKAGE_STRING='Parafly 0.1'
-PACKAGE_BUGREPORT='bug-report at address'
-
-ac_subst_vars='am__EXEEXT_FALSE
-am__EXEEXT_TRUE
-LTLIBOBJS
-LIBOBJS
-AM_CXXFLAGS
-am__fastdepCXX_FALSE
-am__fastdepCXX_TRUE
-CXXDEPMODE
-AMDEPBACKSLASH
-AMDEP_FALSE
-AMDEP_TRUE
-am__quote
-am__include
-DEPDIR
-OBJEXT
-EXEEXT
-ac_ct_CXX
-CPPFLAGS
-LDFLAGS
-CXXFLAGS
-CXX
-am__untar
-am__tar
-AMTAR
-am__leading_dot
-SET_MAKE
-AWK
-mkdir_p
-MKDIR_P
-INSTALL_STRIP_PROGRAM
-STRIP
-install_sh
-MAKEINFO
-AUTOHEADER
-AUTOMAKE
-AUTOCONF
-ACLOCAL
-VERSION
-PACKAGE
-CYGPATH_W
-am__isrc
-INSTALL_DATA
-INSTALL_SCRIPT
-INSTALL_PROGRAM
-target_alias
-host_alias
-build_alias
-LIBS
-ECHO_T
-ECHO_N
-ECHO_C
-DEFS
-mandir
-localedir
-libdir
-psdir
-pdfdir
-dvidir
-htmldir
-infodir
-docdir
-oldincludedir
-includedir
-localstatedir
-sharedstatedir
-sysconfdir
-datadir
-datarootdir
-libexecdir
-sbindir
-bindir
-program_transform_name
-prefix
-exec_prefix
-PACKAGE_BUGREPORT
-PACKAGE_STRING
-PACKAGE_VERSION
-PACKAGE_TARNAME
-PACKAGE_NAME
-PATH_SEPARATOR
-SHELL'
-ac_subst_files=''
-ac_user_opts='
-enable_option_checking
-enable_dependency_tracking
-'
-      ac_precious_vars='build_alias
-host_alias
-target_alias
-CXX
-CXXFLAGS
-LDFLAGS
-LIBS
-CPPFLAGS
-CCC'
-
-
-# Initialize some variables set by options.
-ac_init_help=
-ac_init_version=false
-ac_unrecognized_opts=
-ac_unrecognized_sep=
-# The variables have the same names as the options, with
-# dashes changed to underlines.
-cache_file=/dev/null
-exec_prefix=NONE
-no_create=
-no_recursion=
-prefix=NONE
-program_prefix=NONE
-program_suffix=NONE
-program_transform_name=s,x,x,
-silent=
-site=
-srcdir=
-verbose=
-x_includes=NONE
-x_libraries=NONE
-
-# Installation directory options.
-# These are left unexpanded so users can "make install exec_prefix=/foo"
-# and all the variables that are supposed to be based on exec_prefix
-# by default will actually change.
-# Use braces instead of parens because sh, perl, etc. also accept them.
-# (The list follows the same order as the GNU Coding Standards.)
-bindir='${exec_prefix}/bin'
-sbindir='${exec_prefix}/sbin'
-libexecdir='${exec_prefix}/libexec'
-datarootdir='${prefix}/share'
-datadir='${datarootdir}'
-sysconfdir='${prefix}/etc'
-sharedstatedir='${prefix}/com'
-localstatedir='${prefix}/var'
-includedir='${prefix}/include'
-oldincludedir='/usr/include'
-docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
-infodir='${datarootdir}/info'
-htmldir='${docdir}'
-dvidir='${docdir}'
-pdfdir='${docdir}'
-psdir='${docdir}'
-libdir='${exec_prefix}/lib'
-localedir='${datarootdir}/locale'
-mandir='${datarootdir}/man'
-
-ac_prev=
-ac_dashdash=
-for ac_option
-do
-  # If the previous option needs an argument, assign it.
-  if test -n "$ac_prev"; then
-    eval $ac_prev=\$ac_option
-    ac_prev=
-    continue
-  fi
-
-  case $ac_option in
-  *=*)	ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
-  *)	ac_optarg=yes ;;
-  esac
-
-  # Accept the important Cygnus configure options, so we can diagnose typos.
-
-  case $ac_dashdash$ac_option in
-  --)
-    ac_dashdash=yes ;;
-
-  -bindir | --bindir | --bindi | --bind | --bin | --bi)
-    ac_prev=bindir ;;
-  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
-    bindir=$ac_optarg ;;
-
-  -build | --build | --buil | --bui | --bu)
-    ac_prev=build_alias ;;
-  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
-    build_alias=$ac_optarg ;;
-
-  -cache-file | --cache-file | --cache-fil | --cache-fi \
-  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
-    ac_prev=cache_file ;;
-  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
-  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
-    cache_file=$ac_optarg ;;
-
-  --config-cache | -C)
-    cache_file=config.cache ;;
-
-  -datadir | --datadir | --datadi | --datad)
-    ac_prev=datadir ;;
-  -datadir=* | --datadir=* | --datadi=* | --datad=*)
-    datadir=$ac_optarg ;;
-
-  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
-  | --dataroo | --dataro | --datar)
-    ac_prev=datarootdir ;;
-  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
-  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
-    datarootdir=$ac_optarg ;;
-
-  -disable-* | --disable-*)
-    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
-    # Reject names that are not valid shell variable names.
-    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
-      { $as_echo "$as_me: error: invalid feature name: $ac_useropt" >&2
-   { (exit 1); exit 1; }; }
-    ac_useropt_orig=$ac_useropt
-    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
-    case $ac_user_opts in
-      *"
-"enable_$ac_useropt"
-"*) ;;
-      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
-	 ac_unrecognized_sep=', ';;
-    esac
-    eval enable_$ac_useropt=no ;;
-
-  -docdir | --docdir | --docdi | --doc | --do)
-    ac_prev=docdir ;;
-  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
-    docdir=$ac_optarg ;;
-
-  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
-    ac_prev=dvidir ;;
-  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
-    dvidir=$ac_optarg ;;
-
-  -enable-* | --enable-*)
-    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
-    # Reject names that are not valid shell variable names.
-    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
-      { $as_echo "$as_me: error: invalid feature name: $ac_useropt" >&2
-   { (exit 1); exit 1; }; }
-    ac_useropt_orig=$ac_useropt
-    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
-    case $ac_user_opts in
-      *"
-"enable_$ac_useropt"
-"*) ;;
-      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
-	 ac_unrecognized_sep=', ';;
-    esac
-    eval enable_$ac_useropt=\$ac_optarg ;;
-
-  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
-  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
-  | --exec | --exe | --ex)
-    ac_prev=exec_prefix ;;
-  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
-  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
-  | --exec=* | --exe=* | --ex=*)
-    exec_prefix=$ac_optarg ;;
-
-  -gas | --gas | --ga | --g)
-    # Obsolete; use --with-gas.
-    with_gas=yes ;;
-
-  -help | --help | --hel | --he | -h)
-    ac_init_help=long ;;
-  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
-    ac_init_help=recursive ;;
-  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
-    ac_init_help=short ;;
-
-  -host | --host | --hos | --ho)
-    ac_prev=host_alias ;;
-  -host=* | --host=* | --hos=* | --ho=*)
-    host_alias=$ac_optarg ;;
-
-  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
-    ac_prev=htmldir ;;
-  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
-  | --ht=*)
-    htmldir=$ac_optarg ;;
-
-  -includedir | --includedir | --includedi | --included | --include \
-  | --includ | --inclu | --incl | --inc)
-    ac_prev=includedir ;;
-  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
-  | --includ=* | --inclu=* | --incl=* | --inc=*)
-    includedir=$ac_optarg ;;
-
-  -infodir | --infodir | --infodi | --infod | --info | --inf)
-    ac_prev=infodir ;;
-  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
-    infodir=$ac_optarg ;;
-
-  -libdir | --libdir | --libdi | --libd)
-    ac_prev=libdir ;;
-  -libdir=* | --libdir=* | --libdi=* | --libd=*)
-    libdir=$ac_optarg ;;
-
-  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
-  | --libexe | --libex | --libe)
-    ac_prev=libexecdir ;;
-  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
-  | --libexe=* | --libex=* | --libe=*)
-    libexecdir=$ac_optarg ;;
-
-  -localedir | --localedir | --localedi | --localed | --locale)
-    ac_prev=localedir ;;
-  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
-    localedir=$ac_optarg ;;
-
-  -localstatedir | --localstatedir | --localstatedi | --localstated \
-  | --localstate | --localstat | --localsta | --localst | --locals)
-    ac_prev=localstatedir ;;
-  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
-  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
-    localstatedir=$ac_optarg ;;
-
-  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
-    ac_prev=mandir ;;
-  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
-    mandir=$ac_optarg ;;
-
-  -nfp | --nfp | --nf)
-    # Obsolete; use --without-fp.
-    with_fp=no ;;
-
-  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
-  | --no-cr | --no-c | -n)
-    no_create=yes ;;
-
-  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
-  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
-    no_recursion=yes ;;
-
-  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
-  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
-  | --oldin | --oldi | --old | --ol | --o)
-    ac_prev=oldincludedir ;;
-  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
-  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
-  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
-    oldincludedir=$ac_optarg ;;
-
-  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
-    ac_prev=prefix ;;
-  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
-    prefix=$ac_optarg ;;
-
-  -program-prefix | --program-prefix | --program-prefi | --program-pref \
-  | --program-pre | --program-pr | --program-p)
-    ac_prev=program_prefix ;;
-  -program-prefix=* | --program-prefix=* | --program-prefi=* \
-  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
-    program_prefix=$ac_optarg ;;
-
-  -program-suffix | --program-suffix | --program-suffi | --program-suff \
-  | --program-suf | --program-su | --program-s)
-    ac_prev=program_suffix ;;
-  -program-suffix=* | --program-suffix=* | --program-suffi=* \
-  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
-    program_suffix=$ac_optarg ;;
-
-  -program-transform-name | --program-transform-name \
-  | --program-transform-nam | --program-transform-na \
-  | --program-transform-n | --program-transform- \
-  | --program-transform | --program-transfor \
-  | --program-transfo | --program-transf \
-  | --program-trans | --program-tran \
-  | --progr-tra | --program-tr | --program-t)
-    ac_prev=program_transform_name ;;
-  -program-transform-name=* | --program-transform-name=* \
-  | --program-transform-nam=* | --program-transform-na=* \
-  | --program-transform-n=* | --program-transform-=* \
-  | --program-transform=* | --program-transfor=* \
-  | --program-transfo=* | --program-transf=* \
-  | --program-trans=* | --program-tran=* \
-  | --progr-tra=* | --program-tr=* | --program-t=*)
-    program_transform_name=$ac_optarg ;;
-
-  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
-    ac_prev=pdfdir ;;
-  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
-    pdfdir=$ac_optarg ;;
-
-  -psdir | --psdir | --psdi | --psd | --ps)
-    ac_prev=psdir ;;
-  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
-    psdir=$ac_optarg ;;
-
-  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
-  | -silent | --silent | --silen | --sile | --sil)
-    silent=yes ;;
-
-  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
-    ac_prev=sbindir ;;
-  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
-  | --sbi=* | --sb=*)
-    sbindir=$ac_optarg ;;
-
-  -sharedstatedir | --sharedstatedir | --sharedstatedi \
-  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
-  | --sharedst | --shareds | --shared | --share | --shar \
-  | --sha | --sh)
-    ac_prev=sharedstatedir ;;
-  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
-  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
-  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
-  | --sha=* | --sh=*)
-    sharedstatedir=$ac_optarg ;;
-
-  -site | --site | --sit)
-    ac_prev=site ;;
-  -site=* | --site=* | --sit=*)
-    site=$ac_optarg ;;
-
-  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
-    ac_prev=srcdir ;;
-  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
-    srcdir=$ac_optarg ;;
-
-  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
-  | --syscon | --sysco | --sysc | --sys | --sy)
-    ac_prev=sysconfdir ;;
-  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
-  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
-    sysconfdir=$ac_optarg ;;
-
-  -target | --target | --targe | --targ | --tar | --ta | --t)
-    ac_prev=target_alias ;;
-  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
-    target_alias=$ac_optarg ;;
-
-  -v | -verbose | --verbose | --verbos | --verbo | --verb)
-    verbose=yes ;;
-
-  -version | --version | --versio | --versi | --vers | -V)
-    ac_init_version=: ;;
-
-  -with-* | --with-*)
-    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
-    # Reject names that are not valid shell variable names.
-    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
-      { $as_echo "$as_me: error: invalid package name: $ac_useropt" >&2
-   { (exit 1); exit 1; }; }
-    ac_useropt_orig=$ac_useropt
-    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
-    case $ac_user_opts in
-      *"
-"with_$ac_useropt"
-"*) ;;
-      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
-	 ac_unrecognized_sep=', ';;
-    esac
-    eval with_$ac_useropt=\$ac_optarg ;;
-
-  -without-* | --without-*)
-    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
-    # Reject names that are not valid shell variable names.
-    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
-      { $as_echo "$as_me: error: invalid package name: $ac_useropt" >&2
-   { (exit 1); exit 1; }; }
-    ac_useropt_orig=$ac_useropt
-    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
-    case $ac_user_opts in
-      *"
-"with_$ac_useropt"
-"*) ;;
-      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
-	 ac_unrecognized_sep=', ';;
-    esac
-    eval with_$ac_useropt=no ;;
-
-  --x)
-    # Obsolete; use --with-x.
-    with_x=yes ;;
-
-  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
-  | --x-incl | --x-inc | --x-in | --x-i)
-    ac_prev=x_includes ;;
-  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
-  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
-    x_includes=$ac_optarg ;;
-
-  -x-libraries | --x-libraries | --x-librarie | --x-librari \
-  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
-    ac_prev=x_libraries ;;
-  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
-  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
-    x_libraries=$ac_optarg ;;
-
-  -*) { $as_echo "$as_me: error: unrecognized option: $ac_option
-Try \`$0 --help' for more information." >&2
-   { (exit 1); exit 1; }; }
-    ;;
-
-  *=*)
-    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
-    # Reject names that are not valid shell variable names.
-    expr "x$ac_envvar" : ".*[^_$as_cr_alnum]" >/dev/null &&
-      { $as_echo "$as_me: error: invalid variable name: $ac_envvar" >&2
-   { (exit 1); exit 1; }; }
-    eval $ac_envvar=\$ac_optarg
-    export $ac_envvar ;;
-
-  *)
-    # FIXME: should be removed in autoconf 3.0.
-    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
-    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
-      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
-    : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}
-    ;;
-
-  esac
-done
-
-if test -n "$ac_prev"; then
-  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
-  { $as_echo "$as_me: error: missing argument to $ac_option" >&2
-   { (exit 1); exit 1; }; }
-fi
-
-if test -n "$ac_unrecognized_opts"; then
-  case $enable_option_checking in
-    no) ;;
-    fatal) { $as_echo "$as_me: error: unrecognized options: $ac_unrecognized_opts" >&2
-   { (exit 1); exit 1; }; } ;;
-    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
-  esac
-fi
-
-# Check all directory arguments for consistency.
-for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
-		datadir sysconfdir sharedstatedir localstatedir includedir \
-		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
-		libdir localedir mandir
-do
-  eval ac_val=\$$ac_var
-  # Remove trailing slashes.
-  case $ac_val in
-    */ )
-      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
-      eval $ac_var=\$ac_val;;
-  esac
-  # Be sure to have absolute directory names.
-  case $ac_val in
-    [\\/$]* | ?:[\\/]* )  continue;;
-    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
-  esac
-  { $as_echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2
-   { (exit 1); exit 1; }; }
-done
-
-# There might be people who depend on the old broken behavior: `$host'
-# used to hold the argument of --host etc.
-# FIXME: To remove some day.
-build=$build_alias
-host=$host_alias
-target=$target_alias
-
-# FIXME: To remove some day.
-if test "x$host_alias" != x; then
-  if test "x$build_alias" = x; then
-    cross_compiling=maybe
-    $as_echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host.
-    If a cross compiler is detected then cross compile mode will be used." >&2
-  elif test "x$build_alias" != "x$host_alias"; then
-    cross_compiling=yes
-  fi
-fi
-
-ac_tool_prefix=
-test -n "$host_alias" && ac_tool_prefix=$host_alias-
-
-test "$silent" = yes && exec 6>/dev/null
-
-
-ac_pwd=`pwd` && test -n "$ac_pwd" &&
-ac_ls_di=`ls -di .` &&
-ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
-  { $as_echo "$as_me: error: working directory cannot be determined" >&2
-   { (exit 1); exit 1; }; }
-test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
-  { $as_echo "$as_me: error: pwd does not report name of working directory" >&2
-   { (exit 1); exit 1; }; }
-
-
-# Find the source files, if location was not specified.
-if test -z "$srcdir"; then
-  ac_srcdir_defaulted=yes
-  # Try the directory containing this script, then the parent directory.
-  ac_confdir=`$as_dirname -- "$as_myself" ||
-$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$as_myself" : 'X\(//\)[^/]' \| \
-	 X"$as_myself" : 'X\(//\)$' \| \
-	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$as_myself" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-  srcdir=$ac_confdir
-  if test ! -r "$srcdir/$ac_unique_file"; then
-    srcdir=..
-  fi
-else
-  ac_srcdir_defaulted=no
-fi
-if test ! -r "$srcdir/$ac_unique_file"; then
-  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
-  { $as_echo "$as_me: error: cannot find sources ($ac_unique_file) in $srcdir" >&2
-   { (exit 1); exit 1; }; }
-fi
-ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
-ac_abs_confdir=`(
-	cd "$srcdir" && test -r "./$ac_unique_file" || { $as_echo "$as_me: error: $ac_msg" >&2
-   { (exit 1); exit 1; }; }
-	pwd)`
-# When building in place, set srcdir=.
-if test "$ac_abs_confdir" = "$ac_pwd"; then
-  srcdir=.
-fi
-# Remove unnecessary trailing slashes from srcdir.
-# Double slashes in file names in object file debugging info
-# mess up M-x gdb in Emacs.
-case $srcdir in
-*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
-esac
-for ac_var in $ac_precious_vars; do
-  eval ac_env_${ac_var}_set=\${${ac_var}+set}
-  eval ac_env_${ac_var}_value=\$${ac_var}
-  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
-  eval ac_cv_env_${ac_var}_value=\$${ac_var}
-done
-
-#
-# Report the --help message.
-#
-if test "$ac_init_help" = "long"; then
-  # Omit some internal or obsolete options to make the list less imposing.
-  # This message is too long to be a string in the A/UX 3.1 sh.
-  cat <<_ACEOF
-\`configure' configures Parafly 0.1 to adapt to many kinds of systems.
-
-Usage: $0 [OPTION]... [VAR=VALUE]...
-
-To assign environment variables (e.g., CC, CFLAGS...), specify them as
-VAR=VALUE.  See below for descriptions of some of the useful variables.
-
-Defaults for the options are specified in brackets.
-
-Configuration:
-  -h, --help              display this help and exit
-      --help=short        display options specific to this package
-      --help=recursive    display the short help of all the included packages
-  -V, --version           display version information and exit
-  -q, --quiet, --silent   do not print \`checking...' messages
-      --cache-file=FILE   cache test results in FILE [disabled]
-  -C, --config-cache      alias for \`--cache-file=config.cache'
-  -n, --no-create         do not create output files
-      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
-
-Installation directories:
-  --prefix=PREFIX         install architecture-independent files in PREFIX
-                          [$ac_default_prefix]
-  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
-                          [PREFIX]
-
-By default, \`make install' will install all the files in
-\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
-an installation prefix other than \`$ac_default_prefix' using \`--prefix',
-for instance \`--prefix=\$HOME'.
-
-For better control, use the options below.
-
-Fine tuning of the installation directories:
-  --bindir=DIR            user executables [EPREFIX/bin]
-  --sbindir=DIR           system admin executables [EPREFIX/sbin]
-  --libexecdir=DIR        program executables [EPREFIX/libexec]
-  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
-  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
-  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
-  --libdir=DIR            object code libraries [EPREFIX/lib]
-  --includedir=DIR        C header files [PREFIX/include]
-  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
-  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
-  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
-  --infodir=DIR           info documentation [DATAROOTDIR/info]
-  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
-  --mandir=DIR            man documentation [DATAROOTDIR/man]
-  --docdir=DIR            documentation root [DATAROOTDIR/doc/parafly]
-  --htmldir=DIR           html documentation [DOCDIR]
-  --dvidir=DIR            dvi documentation [DOCDIR]
-  --pdfdir=DIR            pdf documentation [DOCDIR]
-  --psdir=DIR             ps documentation [DOCDIR]
-_ACEOF
-
-  cat <<\_ACEOF
-
-Program names:
-  --program-prefix=PREFIX            prepend PREFIX to installed program names
-  --program-suffix=SUFFIX            append SUFFIX to installed program names
-  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
-_ACEOF
-fi
-
-if test -n "$ac_init_help"; then
-  case $ac_init_help in
-     short | recursive ) echo "Configuration of Parafly 0.1:";;
-   esac
-  cat <<\_ACEOF
-
-Optional Features:
-  --disable-option-checking  ignore unrecognized --enable/--with options
-  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
-  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
-  --disable-dependency-tracking  speeds up one-time build
-  --enable-dependency-tracking   do not reject slow dependency extractors
-
-Some influential environment variables:
-  CXX         C++ compiler command
-  CXXFLAGS    C++ compiler flags
-  LDFLAGS     linker flags, e.g. -L<lib dir> if you have libraries in a
-              nonstandard directory <lib dir>
-  LIBS        libraries to pass to the linker, e.g. -l<library>
-  CPPFLAGS    C/C++/Objective C preprocessor flags, e.g. -I<include dir> if
-              you have headers in a nonstandard directory <include dir>
-
-Use these variables to override the choices made by `configure' or to help
-it to find libraries and programs with nonstandard names/locations.
-
-Report bugs to <bug-report at address>.
-_ACEOF
-ac_status=$?
-fi
-
-if test "$ac_init_help" = "recursive"; then
-  # If there are subdirs, report their specific --help.
-  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
-    test -d "$ac_dir" ||
-      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
-      continue
-    ac_builddir=.
-
-case "$ac_dir" in
-.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
-*)
-  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
-  # A ".." for each directory in $ac_dir_suffix.
-  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
-  case $ac_top_builddir_sub in
-  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
-  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
-  esac ;;
-esac
-ac_abs_top_builddir=$ac_pwd
-ac_abs_builddir=$ac_pwd$ac_dir_suffix
-# for backward compatibility:
-ac_top_builddir=$ac_top_build_prefix
-
-case $srcdir in
-  .)  # We are building in place.
-    ac_srcdir=.
-    ac_top_srcdir=$ac_top_builddir_sub
-    ac_abs_top_srcdir=$ac_pwd ;;
-  [\\/]* | ?:[\\/]* )  # Absolute name.
-    ac_srcdir=$srcdir$ac_dir_suffix;
-    ac_top_srcdir=$srcdir
-    ac_abs_top_srcdir=$srcdir ;;
-  *) # Relative name.
-    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
-    ac_top_srcdir=$ac_top_build_prefix$srcdir
-    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
-esac
-ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
-
-    cd "$ac_dir" || { ac_status=$?; continue; }
-    # Check for guested configure.
-    if test -f "$ac_srcdir/configure.gnu"; then
-      echo &&
-      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
-    elif test -f "$ac_srcdir/configure"; then
-      echo &&
-      $SHELL "$ac_srcdir/configure" --help=recursive
-    else
-      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
-    fi || ac_status=$?
-    cd "$ac_pwd" || { ac_status=$?; break; }
-  done
-fi
-
-test -n "$ac_init_help" && exit $ac_status
-if $ac_init_version; then
-  cat <<\_ACEOF
-Parafly configure 0.1
-generated by GNU Autoconf 2.63
-
-Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
-2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
-This configure script is free software; the Free Software Foundation
-gives unlimited permission to copy, distribute and modify it.
-_ACEOF
-  exit
-fi
-cat >config.log <<_ACEOF
-This file contains any messages produced by compilers while
-running configure, to aid debugging if configure makes a mistake.
-
-It was created by Parafly $as_me 0.1, which was
-generated by GNU Autoconf 2.63.  Invocation command line was
-
-  $ $0 $@
-
-_ACEOF
-exec 5>>config.log
-{
-cat <<_ASUNAME
-## --------- ##
-## Platform. ##
-## --------- ##
-
-hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
-uname -m = `(uname -m) 2>/dev/null || echo unknown`
-uname -r = `(uname -r) 2>/dev/null || echo unknown`
-uname -s = `(uname -s) 2>/dev/null || echo unknown`
-uname -v = `(uname -v) 2>/dev/null || echo unknown`
-
-/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
-/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
-
-/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
-/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
-/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
-/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
-/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
-/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
-/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
-
-_ASUNAME
-
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  $as_echo "PATH: $as_dir"
-done
-IFS=$as_save_IFS
-
-} >&5
-
-cat >&5 <<_ACEOF
-
-
-## ----------- ##
-## Core tests. ##
-## ----------- ##
-
-_ACEOF
-
-
-# Keep a trace of the command line.
-# Strip out --no-create and --no-recursion so they do not pile up.
-# Strip out --silent because we don't want to record it for future runs.
-# Also quote any args containing shell meta-characters.
-# Make two passes to allow for proper duplicate-argument suppression.
-ac_configure_args=
-ac_configure_args0=
-ac_configure_args1=
-ac_must_keep_next=false
-for ac_pass in 1 2
-do
-  for ac_arg
-  do
-    case $ac_arg in
-    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
-    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
-    | -silent | --silent | --silen | --sile | --sil)
-      continue ;;
-    *\'*)
-      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
-    esac
-    case $ac_pass in
-    1) ac_configure_args0="$ac_configure_args0 '$ac_arg'" ;;
-    2)
-      ac_configure_args1="$ac_configure_args1 '$ac_arg'"
-      if test $ac_must_keep_next = true; then
-	ac_must_keep_next=false # Got value, back to normal.
-      else
-	case $ac_arg in
-	  *=* | --config-cache | -C | -disable-* | --disable-* \
-	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
-	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
-	  | -with-* | --with-* | -without-* | --without-* | --x)
-	    case "$ac_configure_args0 " in
-	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
-	    esac
-	    ;;
-	  -* ) ac_must_keep_next=true ;;
-	esac
-      fi
-      ac_configure_args="$ac_configure_args '$ac_arg'"
-      ;;
-    esac
-  done
-done
-$as_unset ac_configure_args0 || test "${ac_configure_args0+set}" != set || { ac_configure_args0=; export ac_configure_args0; }
-$as_unset ac_configure_args1 || test "${ac_configure_args1+set}" != set || { ac_configure_args1=; export ac_configure_args1; }
-
-# When interrupted or exit'd, cleanup temporary files, and complete
-# config.log.  We remove comments because anyway the quotes in there
-# would cause problems or look ugly.
-# WARNING: Use '\'' to represent an apostrophe within the trap.
-# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
-trap 'exit_status=$?
-  # Save into config.log some information that might help in debugging.
-  {
-    echo
-
-    cat <<\_ASBOX
-## ---------------- ##
-## Cache variables. ##
-## ---------------- ##
-_ASBOX
-    echo
-    # The following way of writing the cache mishandles newlines in values,
-(
-  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
-    eval ac_val=\$$ac_var
-    case $ac_val in #(
-    *${as_nl}*)
-      case $ac_var in #(
-      *_cv_*) { $as_echo "$as_me:$LINENO: WARNING: cache variable $ac_var contains a newline" >&5
-$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
-      esac
-      case $ac_var in #(
-      _ | IFS | as_nl) ;; #(
-      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
-      *) $as_unset $ac_var ;;
-      esac ;;
-    esac
-  done
-  (set) 2>&1 |
-    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
-    *${as_nl}ac_space=\ *)
-      sed -n \
-	"s/'\''/'\''\\\\'\'''\''/g;
-	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
-      ;; #(
-    *)
-      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
-      ;;
-    esac |
-    sort
-)
-    echo
-
-    cat <<\_ASBOX
-## ----------------- ##
-## Output variables. ##
-## ----------------- ##
-_ASBOX
-    echo
-    for ac_var in $ac_subst_vars
-    do
-      eval ac_val=\$$ac_var
-      case $ac_val in
-      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
-      esac
-      $as_echo "$ac_var='\''$ac_val'\''"
-    done | sort
-    echo
-
-    if test -n "$ac_subst_files"; then
-      cat <<\_ASBOX
-## ------------------- ##
-## File substitutions. ##
-## ------------------- ##
-_ASBOX
-      echo
-      for ac_var in $ac_subst_files
-      do
-	eval ac_val=\$$ac_var
-	case $ac_val in
-	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
-	esac
-	$as_echo "$ac_var='\''$ac_val'\''"
-      done | sort
-      echo
-    fi
-
-    if test -s confdefs.h; then
-      cat <<\_ASBOX
-## ----------- ##
-## confdefs.h. ##
-## ----------- ##
-_ASBOX
-      echo
-      cat confdefs.h
-      echo
-    fi
-    test "$ac_signal" != 0 &&
-      $as_echo "$as_me: caught signal $ac_signal"
-    $as_echo "$as_me: exit $exit_status"
-  } >&5
-  rm -f core *.core core.conftest.* &&
-    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
-    exit $exit_status
-' 0
-for ac_signal in 1 2 13 15; do
-  trap 'ac_signal='$ac_signal'; { (exit 1); exit 1; }' $ac_signal
-done
-ac_signal=0
-
-# confdefs.h avoids OS command line length limits that DEFS can exceed.
-rm -f -r conftest* confdefs.h
-
-# Predefined preprocessor variables.
-
-cat >>confdefs.h <<_ACEOF
-#define PACKAGE_NAME "$PACKAGE_NAME"
-_ACEOF
-
-
-cat >>confdefs.h <<_ACEOF
-#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
-_ACEOF
-
-
-cat >>confdefs.h <<_ACEOF
-#define PACKAGE_VERSION "$PACKAGE_VERSION"
-_ACEOF
-
-
-cat >>confdefs.h <<_ACEOF
-#define PACKAGE_STRING "$PACKAGE_STRING"
-_ACEOF
-
-
-cat >>confdefs.h <<_ACEOF
-#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
-_ACEOF
-
-
-# Let the site file select an alternate cache file if it wants to.
-# Prefer an explicitly selected file to automatically selected ones.
-ac_site_file1=NONE
-ac_site_file2=NONE
-if test -n "$CONFIG_SITE"; then
-  ac_site_file1=$CONFIG_SITE
-elif test "x$prefix" != xNONE; then
-  ac_site_file1=$prefix/share/config.site
-  ac_site_file2=$prefix/etc/config.site
-else
-  ac_site_file1=$ac_default_prefix/share/config.site
-  ac_site_file2=$ac_default_prefix/etc/config.site
-fi
-for ac_site_file in "$ac_site_file1" "$ac_site_file2"
-do
-  test "x$ac_site_file" = xNONE && continue
-  if test -r "$ac_site_file"; then
-    { $as_echo "$as_me:$LINENO: loading site script $ac_site_file" >&5
-$as_echo "$as_me: loading site script $ac_site_file" >&6;}
-    sed 's/^/| /' "$ac_site_file" >&5
-    . "$ac_site_file"
-  fi
-done
-
-if test -r "$cache_file"; then
-  # Some versions of bash will fail to source /dev/null (special
-  # files actually), so we avoid doing that.
-  if test -f "$cache_file"; then
-    { $as_echo "$as_me:$LINENO: loading cache $cache_file" >&5
-$as_echo "$as_me: loading cache $cache_file" >&6;}
-    case $cache_file in
-      [\\/]* | ?:[\\/]* ) . "$cache_file";;
-      *)                      . "./$cache_file";;
-    esac
-  fi
-else
-  { $as_echo "$as_me:$LINENO: creating cache $cache_file" >&5
-$as_echo "$as_me: creating cache $cache_file" >&6;}
-  >$cache_file
-fi
-
-# Check that the precious variables saved in the cache have kept the same
-# value.
-ac_cache_corrupted=false
-for ac_var in $ac_precious_vars; do
-  eval ac_old_set=\$ac_cv_env_${ac_var}_set
-  eval ac_new_set=\$ac_env_${ac_var}_set
-  eval ac_old_val=\$ac_cv_env_${ac_var}_value
-  eval ac_new_val=\$ac_env_${ac_var}_value
-  case $ac_old_set,$ac_new_set in
-    set,)
-      { $as_echo "$as_me:$LINENO: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
-$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
-      ac_cache_corrupted=: ;;
-    ,set)
-      { $as_echo "$as_me:$LINENO: error: \`$ac_var' was not set in the previous run" >&5
-$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
-      ac_cache_corrupted=: ;;
-    ,);;
-    *)
-      if test "x$ac_old_val" != "x$ac_new_val"; then
-	# differences in whitespace do not lead to failure.
-	ac_old_val_w=`echo x $ac_old_val`
-	ac_new_val_w=`echo x $ac_new_val`
-	if test "$ac_old_val_w" != "$ac_new_val_w"; then
-	  { $as_echo "$as_me:$LINENO: error: \`$ac_var' has changed since the previous run:" >&5
-$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
-	  ac_cache_corrupted=:
-	else
-	  { $as_echo "$as_me:$LINENO: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
-$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
-	  eval $ac_var=\$ac_old_val
-	fi
-	{ $as_echo "$as_me:$LINENO:   former value:  \`$ac_old_val'" >&5
-$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
-	{ $as_echo "$as_me:$LINENO:   current value: \`$ac_new_val'" >&5
-$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
-      fi;;
-  esac
-  # Pass precious variables to config.status.
-  if test "$ac_new_set" = set; then
-    case $ac_new_val in
-    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
-    *) ac_arg=$ac_var=$ac_new_val ;;
-    esac
-    case " $ac_configure_args " in
-      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
-      *) ac_configure_args="$ac_configure_args '$ac_arg'" ;;
-    esac
-  fi
-done
-if $ac_cache_corrupted; then
-  { $as_echo "$as_me:$LINENO: error: in \`$ac_pwd':" >&5
-$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
-  { $as_echo "$as_me:$LINENO: error: changes in the environment can compromise the build" >&5
-$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
-  { { $as_echo "$as_me:$LINENO: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&5
-$as_echo "$as_me: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&2;}
-   { (exit 1); exit 1; }; }
-fi
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-ac_ext=c
-ac_cpp='$CPP $CPPFLAGS'
-ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
-ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
-ac_compiler_gnu=$ac_cv_c_compiler_gnu
-
-
-am__api_version='1.11'
-
-ac_aux_dir=
-for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
-  if test -f "$ac_dir/install-sh"; then
-    ac_aux_dir=$ac_dir
-    ac_install_sh="$ac_aux_dir/install-sh -c"
-    break
-  elif test -f "$ac_dir/install.sh"; then
-    ac_aux_dir=$ac_dir
-    ac_install_sh="$ac_aux_dir/install.sh -c"
-    break
-  elif test -f "$ac_dir/shtool"; then
-    ac_aux_dir=$ac_dir
-    ac_install_sh="$ac_aux_dir/shtool install -c"
-    break
-  fi
-done
-if test -z "$ac_aux_dir"; then
-  { { $as_echo "$as_me:$LINENO: error: cannot find install-sh or install.sh in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" >&5
-$as_echo "$as_me: error: cannot find install-sh or install.sh in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" >&2;}
-   { (exit 1); exit 1; }; }
-fi
-
-# These three variables are undocumented and unsupported,
-# and are intended to be withdrawn in a future Autoconf release.
-# They can cause serious problems if a builder's source tree is in a directory
-# whose full name contains unusual characters.
-ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
-ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
-ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
-
-
-# Find a good install program.  We prefer a C program (faster),
-# so one script is as good as another.  But avoid the broken or
-# incompatible versions:
-# SysV /etc/install, /usr/sbin/install
-# SunOS /usr/etc/install
-# IRIX /sbin/install
-# AIX /bin/install
-# AmigaOS /C/install, which installs bootblocks on floppy discs
-# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
-# AFS /usr/afsws/bin/install, which mishandles nonexistent args
-# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
-# OS/2's system install, which has a completely different semantic
-# ./install, which can be erroneously created by make from ./install.sh.
-# Reject install programs that cannot install multiple files.
-{ $as_echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5
-$as_echo_n "checking for a BSD-compatible install... " >&6; }
-if test -z "$INSTALL"; then
-if test "${ac_cv_path_install+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  # Account for people who put trailing slashes in PATH elements.
-case $as_dir/ in
-  ./ | .// | /cC/* | \
-  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
-  ?:\\/os2\\/install\\/* | ?:\\/OS2\\/INSTALL\\/* | \
-  /usr/ucb/* ) ;;
-  *)
-    # OSF1 and SCO ODT 3.0 have their own names for install.
-    # Don't use installbsd from OSF since it installs stuff as root
-    # by default.
-    for ac_prog in ginstall scoinst install; do
-      for ac_exec_ext in '' $ac_executable_extensions; do
-	if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then
-	  if test $ac_prog = install &&
-	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
-	    # AIX install.  It has an incompatible calling convention.
-	    :
-	  elif test $ac_prog = install &&
-	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
-	    # program-specific install script used by HP pwplus--don't use.
-	    :
-	  else
-	    rm -rf conftest.one conftest.two conftest.dir
-	    echo one > conftest.one
-	    echo two > conftest.two
-	    mkdir conftest.dir
-	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
-	      test -s conftest.one && test -s conftest.two &&
-	      test -s conftest.dir/conftest.one &&
-	      test -s conftest.dir/conftest.two
-	    then
-	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
-	      break 3
-	    fi
-	  fi
-	fi
-      done
-    done
-    ;;
-esac
-
-done
-IFS=$as_save_IFS
-
-rm -rf conftest.one conftest.two conftest.dir
-
-fi
-  if test "${ac_cv_path_install+set}" = set; then
-    INSTALL=$ac_cv_path_install
-  else
-    # As a last resort, use the slow shell script.  Don't cache a
-    # value for INSTALL within a source directory, because that will
-    # break other packages using the cache if that directory is
-    # removed, or if the value is a relative name.
-    INSTALL=$ac_install_sh
-  fi
-fi
-{ $as_echo "$as_me:$LINENO: result: $INSTALL" >&5
-$as_echo "$INSTALL" >&6; }
-
-# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
-# It thinks the first close brace ends the variable substitution.
-test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
-
-test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
-
-test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
-
-{ $as_echo "$as_me:$LINENO: checking whether build environment is sane" >&5
-$as_echo_n "checking whether build environment is sane... " >&6; }
-# Just in case
-sleep 1
-echo timestamp > conftest.file
-# Reject unsafe characters in $srcdir or the absolute working directory
-# name.  Accept space and tab only in the latter.
-am_lf='
-'
-case `pwd` in
-  *[\\\"\#\$\&\'\`$am_lf]*)
-    { { $as_echo "$as_me:$LINENO: error: unsafe absolute working directory name" >&5
-$as_echo "$as_me: error: unsafe absolute working directory name" >&2;}
-   { (exit 1); exit 1; }; };;
-esac
-case $srcdir in
-  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
-    { { $as_echo "$as_me:$LINENO: error: unsafe srcdir value: \`$srcdir'" >&5
-$as_echo "$as_me: error: unsafe srcdir value: \`$srcdir'" >&2;}
-   { (exit 1); exit 1; }; };;
-esac
-
-# Do `set' in a subshell so we don't clobber the current shell's
-# arguments.  Must try -L first in case configure is actually a
-# symlink; some systems play weird games with the mod time of symlinks
-# (eg FreeBSD returns the mod time of the symlink's containing
-# directory).
-if (
-   set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
-   if test "$*" = "X"; then
-      # -L didn't work.
-      set X `ls -t "$srcdir/configure" conftest.file`
-   fi
-   rm -f conftest.file
-   if test "$*" != "X $srcdir/configure conftest.file" \
-      && test "$*" != "X conftest.file $srcdir/configure"; then
-
-      # If neither matched, then we have a broken ls.  This can happen
-      # if, for instance, CONFIG_SHELL is bash and it inherits a
-      # broken ls alias from the environment.  This has actually
-      # happened.  Such a system could not be considered "sane".
-      { { $as_echo "$as_me:$LINENO: error: ls -t appears to fail.  Make sure there is not a broken
-alias in your environment" >&5
-$as_echo "$as_me: error: ls -t appears to fail.  Make sure there is not a broken
-alias in your environment" >&2;}
-   { (exit 1); exit 1; }; }
-   fi
-
-   test "$2" = conftest.file
-   )
-then
-   # Ok.
-   :
-else
-   { { $as_echo "$as_me:$LINENO: error: newly created file is older than distributed files!
-Check your system clock" >&5
-$as_echo "$as_me: error: newly created file is older than distributed files!
-Check your system clock" >&2;}
-   { (exit 1); exit 1; }; }
-fi
-{ $as_echo "$as_me:$LINENO: result: yes" >&5
-$as_echo "yes" >&6; }
-test "$program_prefix" != NONE &&
-  program_transform_name="s&^&$program_prefix&;$program_transform_name"
-# Use a double $ so make ignores it.
-test "$program_suffix" != NONE &&
-  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
-# Double any \ or $.
-# By default was `s,x,x', remove it if useless.
-ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
-program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
-
-# expand $ac_aux_dir to an absolute path
-am_aux_dir=`cd $ac_aux_dir && pwd`
-
-if test x"${MISSING+set}" != xset; then
-  case $am_aux_dir in
-  *\ * | *\	*)
-    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
-  *)
-    MISSING="\${SHELL} $am_aux_dir/missing" ;;
-  esac
-fi
-# Use eval to expand $SHELL
-if eval "$MISSING --run true"; then
-  am_missing_run="$MISSING --run "
-else
-  am_missing_run=
-  { $as_echo "$as_me:$LINENO: WARNING: \`missing' script is too old or missing" >&5
-$as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;}
-fi
-
-if test x"${install_sh}" != xset; then
-  case $am_aux_dir in
-  *\ * | *\	*)
-    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
-  *)
-    install_sh="\${SHELL} $am_aux_dir/install-sh"
-  esac
-fi
-
-# Installed binaries are usually stripped using `strip' when the user
-# run `make install-strip'.  However `strip' might not be the right
-# tool to use in cross-compilation environments, therefore Automake
-# will honor the `STRIP' environment variable to overrule this program.
-if test "$cross_compiling" != no; then
-  if test -n "$ac_tool_prefix"; then
-  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
-set dummy ${ac_tool_prefix}strip; ac_word=$2
-{ $as_echo "$as_me:$LINENO: checking for $ac_word" >&5
-$as_echo_n "checking for $ac_word... " >&6; }
-if test "${ac_cv_prog_STRIP+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  if test -n "$STRIP"; then
-  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
-else
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  for ac_exec_ext in '' $ac_executable_extensions; do
-  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
-    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
-    $as_echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
-    break 2
-  fi
-done
-done
-IFS=$as_save_IFS
-
-fi
-fi
-STRIP=$ac_cv_prog_STRIP
-if test -n "$STRIP"; then
-  { $as_echo "$as_me:$LINENO: result: $STRIP" >&5
-$as_echo "$STRIP" >&6; }
-else
-  { $as_echo "$as_me:$LINENO: result: no" >&5
-$as_echo "no" >&6; }
-fi
-
-
-fi
-if test -z "$ac_cv_prog_STRIP"; then
-  ac_ct_STRIP=$STRIP
-  # Extract the first word of "strip", so it can be a program name with args.
-set dummy strip; ac_word=$2
-{ $as_echo "$as_me:$LINENO: checking for $ac_word" >&5
-$as_echo_n "checking for $ac_word... " >&6; }
-if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  if test -n "$ac_ct_STRIP"; then
-  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
-else
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  for ac_exec_ext in '' $ac_executable_extensions; do
-  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
-    ac_cv_prog_ac_ct_STRIP="strip"
-    $as_echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
-    break 2
-  fi
-done
-done
-IFS=$as_save_IFS
-
-fi
-fi
-ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
-if test -n "$ac_ct_STRIP"; then
-  { $as_echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5
-$as_echo "$ac_ct_STRIP" >&6; }
-else
-  { $as_echo "$as_me:$LINENO: result: no" >&5
-$as_echo "no" >&6; }
-fi
-
-  if test "x$ac_ct_STRIP" = x; then
-    STRIP=":"
-  else
-    case $cross_compiling:$ac_tool_warned in
-yes:)
-{ $as_echo "$as_me:$LINENO: WARNING: using cross tools not prefixed with host triplet" >&5
-$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
-ac_tool_warned=yes ;;
-esac
-    STRIP=$ac_ct_STRIP
-  fi
-else
-  STRIP="$ac_cv_prog_STRIP"
-fi
-
-fi
-INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
-
-{ $as_echo "$as_me:$LINENO: checking for a thread-safe mkdir -p" >&5
-$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
-if test -z "$MKDIR_P"; then
-  if test "${ac_cv_path_mkdir+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  for ac_prog in mkdir gmkdir; do
-	 for ac_exec_ext in '' $ac_executable_extensions; do
-	   { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue
-	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
-	     'mkdir (GNU coreutils) '* | \
-	     'mkdir (coreutils) '* | \
-	     'mkdir (fileutils) '4.1*)
-	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
-	       break 3;;
-	   esac
-	 done
-       done
-done
-IFS=$as_save_IFS
-
-fi
-
-  if test "${ac_cv_path_mkdir+set}" = set; then
-    MKDIR_P="$ac_cv_path_mkdir -p"
-  else
-    # As a last resort, use the slow shell script.  Don't cache a
-    # value for MKDIR_P within a source directory, because that will
-    # break other packages using the cache if that directory is
-    # removed, or if the value is a relative name.
-    test -d ./--version && rmdir ./--version
-    MKDIR_P="$ac_install_sh -d"
-  fi
-fi
-{ $as_echo "$as_me:$LINENO: result: $MKDIR_P" >&5
-$as_echo "$MKDIR_P" >&6; }
-
-mkdir_p="$MKDIR_P"
-case $mkdir_p in
-  [\\/$]* | ?:[\\/]*) ;;
-  */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
-esac
-
-for ac_prog in gawk mawk nawk awk
-do
-  # Extract the first word of "$ac_prog", so it can be a program name with args.
-set dummy $ac_prog; ac_word=$2
-{ $as_echo "$as_me:$LINENO: checking for $ac_word" >&5
-$as_echo_n "checking for $ac_word... " >&6; }
-if test "${ac_cv_prog_AWK+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  if test -n "$AWK"; then
-  ac_cv_prog_AWK="$AWK" # Let the user override the test.
-else
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  for ac_exec_ext in '' $ac_executable_extensions; do
-  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
-    ac_cv_prog_AWK="$ac_prog"
-    $as_echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
-    break 2
-  fi
-done
-done
-IFS=$as_save_IFS
-
-fi
-fi
-AWK=$ac_cv_prog_AWK
-if test -n "$AWK"; then
-  { $as_echo "$as_me:$LINENO: result: $AWK" >&5
-$as_echo "$AWK" >&6; }
-else
-  { $as_echo "$as_me:$LINENO: result: no" >&5
-$as_echo "no" >&6; }
-fi
-
-
-  test -n "$AWK" && break
-done
-
-{ $as_echo "$as_me:$LINENO: checking whether ${MAKE-make} sets \$(MAKE)" >&5
-$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
-set x ${MAKE-make}
-ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
-if { as_var=ac_cv_prog_make_${ac_make}_set; eval "test \"\${$as_var+set}\" = set"; }; then
-  $as_echo_n "(cached) " >&6
-else
-  cat >conftest.make <<\_ACEOF
-SHELL = /bin/sh
-all:
-	@echo '@@@%%%=$(MAKE)=@@@%%%'
-_ACEOF
-# GNU make sometimes prints "make[1]: Entering...", which would confuse us.
-case `${MAKE-make} -f conftest.make 2>/dev/null` in
-  *@@@%%%=?*=@@@%%%*)
-    eval ac_cv_prog_make_${ac_make}_set=yes;;
-  *)
-    eval ac_cv_prog_make_${ac_make}_set=no;;
-esac
-rm -f conftest.make
-fi
-if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
-  { $as_echo "$as_me:$LINENO: result: yes" >&5
-$as_echo "yes" >&6; }
-  SET_MAKE=
-else
-  { $as_echo "$as_me:$LINENO: result: no" >&5
-$as_echo "no" >&6; }
-  SET_MAKE="MAKE=${MAKE-make}"
-fi
-
-rm -rf .tst 2>/dev/null
-mkdir .tst 2>/dev/null
-if test -d .tst; then
-  am__leading_dot=.
-else
-  am__leading_dot=_
-fi
-rmdir .tst 2>/dev/null
-
-if test "`cd $srcdir && pwd`" != "`pwd`"; then
-  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
-  # is not polluted with repeated "-I."
-  am__isrc=' -I$(srcdir)'
-  # test to see if srcdir already configured
-  if test -f $srcdir/config.status; then
-    { { $as_echo "$as_me:$LINENO: error: source directory already configured; run \"make distclean\" there first" >&5
-$as_echo "$as_me: error: source directory already configured; run \"make distclean\" there first" >&2;}
-   { (exit 1); exit 1; }; }
-  fi
-fi
-
-# test whether we have cygpath
-if test -z "$CYGPATH_W"; then
-  if (cygpath --version) >/dev/null 2>/dev/null; then
-    CYGPATH_W='cygpath -w'
-  else
-    CYGPATH_W=echo
-  fi
-fi
-
-
-# Define the identity of the package.
- PACKAGE='parafly'
- VERSION='0.1'
-
-
-cat >>confdefs.h <<_ACEOF
-#define PACKAGE "$PACKAGE"
-_ACEOF
-
-
-cat >>confdefs.h <<_ACEOF
-#define VERSION "$VERSION"
-_ACEOF
-
-# Some tools Automake needs.
-
-ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
-
-
-AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
-
-
-AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
-
-
-AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
-
-
-MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
-
-# We need awk for the "check" target.  The system "awk" is bad on
-# some platforms.
-# Always define AMTAR for backward compatibility.
-
-AMTAR=${AMTAR-"${am_missing_run}tar"}
-
-am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'
-
-
-
-
-
-ac_ext=cpp
-ac_cpp='$CXXCPP $CPPFLAGS'
-ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
-ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
-ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
-
-ac_ext=cpp
-ac_cpp='$CXXCPP $CPPFLAGS'
-ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
-ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
-ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
-if test -z "$CXX"; then
-  if test -n "$CCC"; then
-    CXX=$CCC
-  else
-    if test -n "$ac_tool_prefix"; then
-  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC
-  do
-    # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
-set dummy $ac_tool_prefix$ac_prog; ac_word=$2
-{ $as_echo "$as_me:$LINENO: checking for $ac_word" >&5
-$as_echo_n "checking for $ac_word... " >&6; }
-if test "${ac_cv_prog_CXX+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  if test -n "$CXX"; then
-  ac_cv_prog_CXX="$CXX" # Let the user override the test.
-else
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  for ac_exec_ext in '' $ac_executable_extensions; do
-  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
-    ac_cv_prog_CXX="$ac_tool_prefix$ac_prog"
-    $as_echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
-    break 2
-  fi
-done
-done
-IFS=$as_save_IFS
-
-fi
-fi
-CXX=$ac_cv_prog_CXX
-if test -n "$CXX"; then
-  { $as_echo "$as_me:$LINENO: result: $CXX" >&5
-$as_echo "$CXX" >&6; }
-else
-  { $as_echo "$as_me:$LINENO: result: no" >&5
-$as_echo "no" >&6; }
-fi
-
-
-    test -n "$CXX" && break
-  done
-fi
-if test -z "$CXX"; then
-  ac_ct_CXX=$CXX
-  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC
-do
-  # Extract the first word of "$ac_prog", so it can be a program name with args.
-set dummy $ac_prog; ac_word=$2
-{ $as_echo "$as_me:$LINENO: checking for $ac_word" >&5
-$as_echo_n "checking for $ac_word... " >&6; }
-if test "${ac_cv_prog_ac_ct_CXX+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  if test -n "$ac_ct_CXX"; then
-  ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test.
-else
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  for ac_exec_ext in '' $ac_executable_extensions; do
-  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
-    ac_cv_prog_ac_ct_CXX="$ac_prog"
-    $as_echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
-    break 2
-  fi
-done
-done
-IFS=$as_save_IFS
-
-fi
-fi
-ac_ct_CXX=$ac_cv_prog_ac_ct_CXX
-if test -n "$ac_ct_CXX"; then
-  { $as_echo "$as_me:$LINENO: result: $ac_ct_CXX" >&5
-$as_echo "$ac_ct_CXX" >&6; }
-else
-  { $as_echo "$as_me:$LINENO: result: no" >&5
-$as_echo "no" >&6; }
-fi
-
-
-  test -n "$ac_ct_CXX" && break
-done
-
-  if test "x$ac_ct_CXX" = x; then
-    CXX="g++"
-  else
-    case $cross_compiling:$ac_tool_warned in
-yes:)
-{ $as_echo "$as_me:$LINENO: WARNING: using cross tools not prefixed with host triplet" >&5
-$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
-ac_tool_warned=yes ;;
-esac
-    CXX=$ac_ct_CXX
-  fi
-fi
-
-  fi
-fi
-# Provide some information about the compiler.
-$as_echo "$as_me:$LINENO: checking for C++ compiler version" >&5
-set X $ac_compile
-ac_compiler=$2
-{ (ac_try="$ac_compiler --version >&5"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compiler --version >&5") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }
-{ (ac_try="$ac_compiler -v >&5"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compiler -v >&5") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }
-{ (ac_try="$ac_compiler -V >&5"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compiler -V >&5") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }
-
-cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-int
-main ()
-{
-
-  ;
-  return 0;
-}
-_ACEOF
-ac_clean_files_save=$ac_clean_files
-ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out"
-# Try to create an executable without -o first, disregard a.out.
-# It will help us diagnose broken compilers, and finding out an intuition
-# of exeext.
-{ $as_echo "$as_me:$LINENO: checking for C++ compiler default output file name" >&5
-$as_echo_n "checking for C++ compiler default output file name... " >&6; }
-ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'`
-
-# The possible output files:
-ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*"
-
-ac_rmfiles=
-for ac_file in $ac_files
-do
-  case $ac_file in
-    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;
-    * ) ac_rmfiles="$ac_rmfiles $ac_file";;
-  esac
-done
-rm -f $ac_rmfiles
-
-if { (ac_try="$ac_link_default"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_link_default") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }; then
-  # Autoconf-2.13 could set the ac_cv_exeext variable to `no'.
-# So ignore a value of `no', otherwise this would lead to `EXEEXT = no'
-# in a Makefile.  We should not override ac_cv_exeext if it was cached,
-# so that the user can short-circuit this test for compilers unknown to
-# Autoconf.
-for ac_file in $ac_files ''
-do
-  test -f "$ac_file" || continue
-  case $ac_file in
-    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj )
-	;;
-    [ab].out )
-	# We found the default executable, but exeext='' is most
-	# certainly right.
-	break;;
-    *.* )
-        if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no;
-	then :; else
-	   ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'`
-	fi
-	# We set ac_cv_exeext here because the later test for it is not
-	# safe: cross compilers may not add the suffix if given an `-o'
-	# argument, so we may need to know it at that point already.
-	# Even if this section looks crufty: it has the advantage of
-	# actually working.
-	break;;
-    * )
-	break;;
-  esac
-done
-test "$ac_cv_exeext" = no && ac_cv_exeext=
-
-else
-  ac_file=''
-fi
-
-{ $as_echo "$as_me:$LINENO: result: $ac_file" >&5
-$as_echo "$ac_file" >&6; }
-if test -z "$ac_file"; then
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-{ { $as_echo "$as_me:$LINENO: error: in \`$ac_pwd':" >&5
-$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
-{ { $as_echo "$as_me:$LINENO: error: C++ compiler cannot create executables
-See \`config.log' for more details." >&5
-$as_echo "$as_me: error: C++ compiler cannot create executables
-See \`config.log' for more details." >&2;}
-   { (exit 77); exit 77; }; }; }
-fi
-
-ac_exeext=$ac_cv_exeext
-
-# Check that the compiler produces executables we can run.  If not, either
-# the compiler is broken, or we cross compile.
-{ $as_echo "$as_me:$LINENO: checking whether the C++ compiler works" >&5
-$as_echo_n "checking whether the C++ compiler works... " >&6; }
-# FIXME: These cross compiler hacks should be removed for Autoconf 3.0
-# If not cross compiling, check that we can run a simple program.
-if test "$cross_compiling" != yes; then
-  if { ac_try='./$ac_file'
-  { (case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_try") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }; }; then
-    cross_compiling=no
-  else
-    if test "$cross_compiling" = maybe; then
-	cross_compiling=yes
-    else
-	{ { $as_echo "$as_me:$LINENO: error: in \`$ac_pwd':" >&5
-$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
-{ { $as_echo "$as_me:$LINENO: error: cannot run C++ compiled programs.
-If you meant to cross compile, use \`--host'.
-See \`config.log' for more details." >&5
-$as_echo "$as_me: error: cannot run C++ compiled programs.
-If you meant to cross compile, use \`--host'.
-See \`config.log' for more details." >&2;}
-   { (exit 1); exit 1; }; }; }
-    fi
-  fi
-fi
-{ $as_echo "$as_me:$LINENO: result: yes" >&5
-$as_echo "yes" >&6; }
-
-rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out
-ac_clean_files=$ac_clean_files_save
-# Check that the compiler produces executables we can run.  If not, either
-# the compiler is broken, or we cross compile.
-{ $as_echo "$as_me:$LINENO: checking whether we are cross compiling" >&5
-$as_echo_n "checking whether we are cross compiling... " >&6; }
-{ $as_echo "$as_me:$LINENO: result: $cross_compiling" >&5
-$as_echo "$cross_compiling" >&6; }
-
-{ $as_echo "$as_me:$LINENO: checking for suffix of executables" >&5
-$as_echo_n "checking for suffix of executables... " >&6; }
-if { (ac_try="$ac_link"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_link") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }; then
-  # If both `conftest.exe' and `conftest' are `present' (well, observable)
-# catch `conftest.exe'.  For instance with Cygwin, `ls conftest' will
-# work properly (i.e., refer to `conftest.exe'), while it won't with
-# `rm'.
-for ac_file in conftest.exe conftest conftest.*; do
-  test -f "$ac_file" || continue
-  case $ac_file in
-    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;
-    *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'`
-	  break;;
-    * ) break;;
-  esac
-done
-else
-  { { $as_echo "$as_me:$LINENO: error: in \`$ac_pwd':" >&5
-$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
-{ { $as_echo "$as_me:$LINENO: error: cannot compute suffix of executables: cannot compile and link
-See \`config.log' for more details." >&5
-$as_echo "$as_me: error: cannot compute suffix of executables: cannot compile and link
-See \`config.log' for more details." >&2;}
-   { (exit 1); exit 1; }; }; }
-fi
-
-rm -f conftest$ac_cv_exeext
-{ $as_echo "$as_me:$LINENO: result: $ac_cv_exeext" >&5
-$as_echo "$ac_cv_exeext" >&6; }
-
-rm -f conftest.$ac_ext
-EXEEXT=$ac_cv_exeext
-ac_exeext=$EXEEXT
-{ $as_echo "$as_me:$LINENO: checking for suffix of object files" >&5
-$as_echo_n "checking for suffix of object files... " >&6; }
-if test "${ac_cv_objext+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-int
-main ()
-{
-
-  ;
-  return 0;
-}
-_ACEOF
-rm -f conftest.o conftest.obj
-if { (ac_try="$ac_compile"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compile") 2>&5
-  ac_status=$?
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); }; then
-  for ac_file in conftest.o conftest.obj conftest.*; do
-  test -f "$ac_file" || continue;
-  case $ac_file in
-    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;;
-    *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'`
-       break;;
-  esac
-done
-else
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-{ { $as_echo "$as_me:$LINENO: error: in \`$ac_pwd':" >&5
-$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
-{ { $as_echo "$as_me:$LINENO: error: cannot compute suffix of object files: cannot compile
-See \`config.log' for more details." >&5
-$as_echo "$as_me: error: cannot compute suffix of object files: cannot compile
-See \`config.log' for more details." >&2;}
-   { (exit 1); exit 1; }; }; }
-fi
-
-rm -f conftest.$ac_cv_objext conftest.$ac_ext
-fi
-{ $as_echo "$as_me:$LINENO: result: $ac_cv_objext" >&5
-$as_echo "$ac_cv_objext" >&6; }
-OBJEXT=$ac_cv_objext
-ac_objext=$OBJEXT
-{ $as_echo "$as_me:$LINENO: checking whether we are using the GNU C++ compiler" >&5
-$as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; }
-if test "${ac_cv_cxx_compiler_gnu+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-int
-main ()
-{
-#ifndef __GNUC__
-       choke me
-#endif
-
-  ;
-  return 0;
-}
-_ACEOF
-rm -f conftest.$ac_objext
-if { (ac_try="$ac_compile"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compile") 2>conftest.er1
-  ac_status=$?
-  grep -v '^ *+' conftest.er1 >conftest.err
-  rm -f conftest.er1
-  cat conftest.err >&5
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); } && {
-	 test -z "$ac_cxx_werror_flag" ||
-	 test ! -s conftest.err
-       } && test -s conftest.$ac_objext; then
-  ac_compiler_gnu=yes
-else
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-	ac_compiler_gnu=no
-fi
-
-rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
-ac_cv_cxx_compiler_gnu=$ac_compiler_gnu
-
-fi
-{ $as_echo "$as_me:$LINENO: result: $ac_cv_cxx_compiler_gnu" >&5
-$as_echo "$ac_cv_cxx_compiler_gnu" >&6; }
-if test $ac_compiler_gnu = yes; then
-  GXX=yes
-else
-  GXX=
-fi
-ac_test_CXXFLAGS=${CXXFLAGS+set}
-ac_save_CXXFLAGS=$CXXFLAGS
-{ $as_echo "$as_me:$LINENO: checking whether $CXX accepts -g" >&5
-$as_echo_n "checking whether $CXX accepts -g... " >&6; }
-if test "${ac_cv_prog_cxx_g+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  ac_save_cxx_werror_flag=$ac_cxx_werror_flag
-   ac_cxx_werror_flag=yes
-   ac_cv_prog_cxx_g=no
-   CXXFLAGS="-g"
-   cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-int
-main ()
-{
-
-  ;
-  return 0;
-}
-_ACEOF
-rm -f conftest.$ac_objext
-if { (ac_try="$ac_compile"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compile") 2>conftest.er1
-  ac_status=$?
-  grep -v '^ *+' conftest.er1 >conftest.err
-  rm -f conftest.er1
-  cat conftest.err >&5
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); } && {
-	 test -z "$ac_cxx_werror_flag" ||
-	 test ! -s conftest.err
-       } && test -s conftest.$ac_objext; then
-  ac_cv_prog_cxx_g=yes
-else
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-	CXXFLAGS=""
-      cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-int
-main ()
-{
-
-  ;
-  return 0;
-}
-_ACEOF
-rm -f conftest.$ac_objext
-if { (ac_try="$ac_compile"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compile") 2>conftest.er1
-  ac_status=$?
-  grep -v '^ *+' conftest.er1 >conftest.err
-  rm -f conftest.er1
-  cat conftest.err >&5
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); } && {
-	 test -z "$ac_cxx_werror_flag" ||
-	 test ! -s conftest.err
-       } && test -s conftest.$ac_objext; then
-  :
-else
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-	ac_cxx_werror_flag=$ac_save_cxx_werror_flag
-	 CXXFLAGS="-g"
-	 cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-int
-main ()
-{
-
-  ;
-  return 0;
-}
-_ACEOF
-rm -f conftest.$ac_objext
-if { (ac_try="$ac_compile"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_compile") 2>conftest.er1
-  ac_status=$?
-  grep -v '^ *+' conftest.er1 >conftest.err
-  rm -f conftest.er1
-  cat conftest.err >&5
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); } && {
-	 test -z "$ac_cxx_werror_flag" ||
-	 test ! -s conftest.err
-       } && test -s conftest.$ac_objext; then
-  ac_cv_prog_cxx_g=yes
-else
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-
-fi
-
-rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
-fi
-
-rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
-fi
-
-rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
-   ac_cxx_werror_flag=$ac_save_cxx_werror_flag
-fi
-{ $as_echo "$as_me:$LINENO: result: $ac_cv_prog_cxx_g" >&5
-$as_echo "$ac_cv_prog_cxx_g" >&6; }
-if test "$ac_test_CXXFLAGS" = set; then
-  CXXFLAGS=$ac_save_CXXFLAGS
-elif test $ac_cv_prog_cxx_g = yes; then
-  if test "$GXX" = yes; then
-    CXXFLAGS="-g -O2"
-  else
-    CXXFLAGS="-g"
-  fi
-else
-  if test "$GXX" = yes; then
-    CXXFLAGS="-O2"
-  else
-    CXXFLAGS=
-  fi
-fi
-ac_ext=cpp
-ac_cpp='$CXXCPP $CPPFLAGS'
-ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
-ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
-ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
-DEPDIR="${am__leading_dot}deps"
-
-ac_config_commands="$ac_config_commands depfiles"
-
-
-am_make=${MAKE-make}
-cat > confinc << 'END'
-am__doit:
-	@echo this is the am__doit target
-.PHONY: am__doit
-END
-# If we don't find an include directive, just comment out the code.
-{ $as_echo "$as_me:$LINENO: checking for style of include used by $am_make" >&5
-$as_echo_n "checking for style of include used by $am_make... " >&6; }
-am__include="#"
-am__quote=
-_am_result=none
-# First try GNU make style include.
-echo "include confinc" > confmf
-# Ignore all kinds of additional output from `make'.
-case `$am_make -s -f confmf 2> /dev/null` in #(
-*the\ am__doit\ target*)
-  am__include=include
-  am__quote=
-  _am_result=GNU
-  ;;
-esac
-# Now try BSD make style include.
-if test "$am__include" = "#"; then
-   echo '.include "confinc"' > confmf
-   case `$am_make -s -f confmf 2> /dev/null` in #(
-   *the\ am__doit\ target*)
-     am__include=.include
-     am__quote="\""
-     _am_result=BSD
-     ;;
-   esac
-fi
-
-
-{ $as_echo "$as_me:$LINENO: result: $_am_result" >&5
-$as_echo "$_am_result" >&6; }
-rm -f confinc confmf
-
-# Check whether --enable-dependency-tracking was given.
-if test "${enable_dependency_tracking+set}" = set; then
-  enableval=$enable_dependency_tracking;
-fi
-
-if test "x$enable_dependency_tracking" != xno; then
-  am_depcomp="$ac_aux_dir/depcomp"
-  AMDEPBACKSLASH='\'
-fi
- if test "x$enable_dependency_tracking" != xno; then
-  AMDEP_TRUE=
-  AMDEP_FALSE='#'
-else
-  AMDEP_TRUE='#'
-  AMDEP_FALSE=
-fi
-
-
-
-depcc="$CXX"  am_compiler_list=
-
-{ $as_echo "$as_me:$LINENO: checking dependency style of $depcc" >&5
-$as_echo_n "checking dependency style of $depcc... " >&6; }
-if test "${am_cv_CXX_dependencies_compiler_type+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
-  # We make a subdir and do the tests there.  Otherwise we can end up
-  # making bogus files that we don't know about and never remove.  For
-  # instance it was reported that on HP-UX the gcc test will end up
-  # making a dummy file named `D' -- because `-MD' means `put the output
-  # in D'.
-  mkdir conftest.dir
-  # Copy depcomp to subdir because otherwise we won't find it if we're
-  # using a relative directory.
-  cp "$am_depcomp" conftest.dir
-  cd conftest.dir
-  # We will build objects and dependencies in a subdirectory because
-  # it helps to detect inapplicable dependency modes.  For instance
-  # both Tru64's cc and ICC support -MD to output dependencies as a
-  # side effect of compilation, but ICC will put the dependencies in
-  # the current directory while Tru64 will put them in the object
-  # directory.
-  mkdir sub
-
-  am_cv_CXX_dependencies_compiler_type=none
-  if test "$am_compiler_list" = ""; then
-     am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp`
-  fi
-  am__universal=false
-  case " $depcc " in #(
-     *\ -arch\ *\ -arch\ *) am__universal=true ;;
-     esac
-
-  for depmode in $am_compiler_list; do
-    # Setup a source with many dependencies, because some compilers
-    # like to wrap large dependency lists on column 80 (with \), and
-    # we should not choose a depcomp mode which is confused by this.
-    #
-    # We need to recreate these files for each test, as the compiler may
-    # overwrite some of them when testing with obscure command lines.
-    # This happens at least with the AIX C compiler.
-    : > sub/conftest.c
-    for i in 1 2 3 4 5 6; do
-      echo '#include "conftst'$i'.h"' >> sub/conftest.c
-      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
-      # Solaris 8's {/usr,}/bin/sh.
-      touch sub/conftst$i.h
-    done
-    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
-
-    # We check with `-c' and `-o' for the sake of the "dashmstdout"
-    # mode.  It turns out that the SunPro C++ compiler does not properly
-    # handle `-M -o', and we need to detect this.  Also, some Intel
-    # versions had trouble with output in subdirs
-    am__obj=sub/conftest.${OBJEXT-o}
-    am__minus_obj="-o $am__obj"
-    case $depmode in
-    gcc)
-      # This depmode causes a compiler race in universal mode.
-      test "$am__universal" = false || continue
-      ;;
-    nosideeffect)
-      # after this tag, mechanisms are not by side-effect, so they'll
-      # only be used when explicitly requested
-      if test "x$enable_dependency_tracking" = xyes; then
-	continue
-      else
-	break
-      fi
-      ;;
-    msvisualcpp | msvcmsys)
-      # This compiler won't grok `-c -o', but also, the minuso test has
-      # not run yet.  These depmodes are late enough in the game, and
-      # so weak that their functioning should not be impacted.
-      am__obj=conftest.${OBJEXT-o}
-      am__minus_obj=
-      ;;
-    none) break ;;
-    esac
-    if depmode=$depmode \
-       source=sub/conftest.c object=$am__obj \
-       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
-       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
-         >/dev/null 2>conftest.err &&
-       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
-       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
-       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
-       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
-      # icc doesn't choke on unknown options, it will just issue warnings
-      # or remarks (even with -Werror).  So we grep stderr for any message
-      # that says an option was ignored or not supported.
-      # When given -MP, icc 7.0 and 7.1 complain thusly:
-      #   icc: Command line warning: ignoring option '-M'; no argument required
-      # The diagnosis changed in icc 8.0:
-      #   icc: Command line remark: option '-MP' not supported
-      if (grep 'ignoring option' conftest.err ||
-          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
-        am_cv_CXX_dependencies_compiler_type=$depmode
-        break
-      fi
-    fi
-  done
-
-  cd ..
-  rm -rf conftest.dir
-else
-  am_cv_CXX_dependencies_compiler_type=none
-fi
-
-fi
-{ $as_echo "$as_me:$LINENO: result: $am_cv_CXX_dependencies_compiler_type" >&5
-$as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; }
-CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type
-
- if
-  test "x$enable_dependency_tracking" != xno \
-  && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then
-  am__fastdepCXX_TRUE=
-  am__fastdepCXX_FALSE='#'
-else
-  am__fastdepCXX_TRUE='#'
-  am__fastdepCXX_FALSE=
-fi
-
-
-#AC_OPENMP # requires autoconf >= 2.62
-AM_CXXFLAGS=-m64
-
-case $CXX in
-  g++*) AM_CXXFLAGS="-pedantic -fopenmp -Wall -Wextra -Wno-long-long -Wno-deprecated $AM_CXXFLAGS"
-;;
-  sunCC*) AM_CXXFLAGS="-library=stlport4 -xopenmp -xvpara -fast $AM_CXXFLAGS"
- ;;
-  icpc*) AM_CXXFLAGS="-Wall -openmp $AM_CXXFLAGS"
- ;;
-esac
-
-{ $as_echo "$as_me:$LINENO: checking for library containing cos" >&5
-$as_echo_n "checking for library containing cos... " >&6; }
-if test "${ac_cv_search_cos+set}" = set; then
-  $as_echo_n "(cached) " >&6
-else
-  ac_func_search_save_LIBS=$LIBS
-cat >conftest.$ac_ext <<_ACEOF
-/* confdefs.h.  */
-_ACEOF
-cat confdefs.h >>conftest.$ac_ext
-cat >>conftest.$ac_ext <<_ACEOF
-/* end confdefs.h.  */
-
-/* Override any GCC internal prototype to avoid an error.
-   Use char because int might match the return type of a GCC
-   builtin and then its argument prototype would still apply.  */
-#ifdef __cplusplus
-extern "C"
-#endif
-char cos ();
-int
-main ()
-{
-return cos ();
-  ;
-  return 0;
-}
-_ACEOF
-for ac_lib in '' m; do
-  if test -z "$ac_lib"; then
-    ac_res="none required"
-  else
-    ac_res=-l$ac_lib
-    LIBS="-l$ac_lib  $ac_func_search_save_LIBS"
-  fi
-  rm -f conftest.$ac_objext conftest$ac_exeext
-if { (ac_try="$ac_link"
-case "(($ac_try" in
-  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
-  *) ac_try_echo=$ac_try;;
-esac
-eval ac_try_echo="\"\$as_me:$LINENO: $ac_try_echo\""
-$as_echo "$ac_try_echo") >&5
-  (eval "$ac_link") 2>conftest.er1
-  ac_status=$?
-  grep -v '^ *+' conftest.er1 >conftest.err
-  rm -f conftest.er1
-  cat conftest.err >&5
-  $as_echo "$as_me:$LINENO: \$? = $ac_status" >&5
-  (exit $ac_status); } && {
-	 test -z "$ac_cxx_werror_flag" ||
-	 test ! -s conftest.err
-       } && test -s conftest$ac_exeext && {
-	 test "$cross_compiling" = yes ||
-	 $as_test_x conftest$ac_exeext
-       }; then
-  ac_cv_search_cos=$ac_res
-else
-  $as_echo "$as_me: failed program was:" >&5
-sed 's/^/| /' conftest.$ac_ext >&5
-
-
-fi
-
-rm -rf conftest.dSYM
-rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
-      conftest$ac_exeext
-  if test "${ac_cv_search_cos+set}" = set; then
-  break
-fi
-done
-if test "${ac_cv_search_cos+set}" = set; then
-  :
-else
-  ac_cv_search_cos=no
-fi
-rm conftest.$ac_ext
-LIBS=$ac_func_search_save_LIBS
-fi
-{ $as_echo "$as_me:$LINENO: result: $ac_cv_search_cos" >&5
-$as_echo "$ac_cv_search_cos" >&6; }
-ac_res=$ac_cv_search_cos
-if test "$ac_res" != no; then
-  test "$ac_res" = "none required" || LIBS="$ac_res $LIBS"
-
-fi
-
-ac_config_headers="$ac_config_headers config.h"
-
-ac_config_files="$ac_config_files Makefile src/Makefile"
-
-cat >confcache <<\_ACEOF
-# This file is a shell script that caches the results of configure
-# tests run on this system so they can be shared between configure
-# scripts and configure runs, see configure's option --config-cache.
-# It is not useful on other systems.  If it contains results you don't
-# want to keep, you may remove or edit it.
-#
-# config.status only pays attention to the cache file if you give it
-# the --recheck option to rerun configure.
-#
-# `ac_cv_env_foo' variables (set or unset) will be overridden when
-# loading this file, other *unset* `ac_cv_foo' will be assigned the
-# following values.
-
-_ACEOF
-
-# The following way of writing the cache mishandles newlines in values,
-# but we know of no workaround that is simple, portable, and efficient.
-# So, we kill variables containing newlines.
-# Ultrix sh set writes to stderr and can't be redirected directly,
-# and sets the high bit in the cache file unless we assign to the vars.
-(
-  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
-    eval ac_val=\$$ac_var
-    case $ac_val in #(
-    *${as_nl}*)
-      case $ac_var in #(
-      *_cv_*) { $as_echo "$as_me:$LINENO: WARNING: cache variable $ac_var contains a newline" >&5
-$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
-      esac
-      case $ac_var in #(
-      _ | IFS | as_nl) ;; #(
-      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
-      *) $as_unset $ac_var ;;
-      esac ;;
-    esac
-  done
-
-  (set) 2>&1 |
-    case $as_nl`(ac_space=' '; set) 2>&1` in #(
-    *${as_nl}ac_space=\ *)
-      # `set' does not quote correctly, so add quotes (double-quote
-      # substitution turns \\\\ into \\, and sed turns \\ into \).
-      sed -n \
-	"s/'/'\\\\''/g;
-	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
-      ;; #(
-    *)
-      # `set' quotes correctly as required by POSIX, so do not add quotes.
-      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
-      ;;
-    esac |
-    sort
-) |
-  sed '
-     /^ac_cv_env_/b end
-     t clear
-     :clear
-     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
-     t end
-     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
-     :end' >>confcache
-if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
-  if test -w "$cache_file"; then
-    test "x$cache_file" != "x/dev/null" &&
-      { $as_echo "$as_me:$LINENO: updating cache $cache_file" >&5
-$as_echo "$as_me: updating cache $cache_file" >&6;}
-    cat confcache >$cache_file
-  else
-    { $as_echo "$as_me:$LINENO: not updating unwritable cache $cache_file" >&5
-$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
-  fi
-fi
-rm -f confcache
-
-test "x$prefix" = xNONE && prefix=$ac_default_prefix
-# Let make expand exec_prefix.
-test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
-
-DEFS=-DHAVE_CONFIG_H
-
-ac_libobjs=
-ac_ltlibobjs=
-for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
-  # 1. Remove the extension, and $U if already installed.
-  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
-  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
-  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
-  #    will be set to the directory where LIBOBJS objects are built.
-  ac_libobjs="$ac_libobjs \${LIBOBJDIR}$ac_i\$U.$ac_objext"
-  ac_ltlibobjs="$ac_ltlibobjs \${LIBOBJDIR}$ac_i"'$U.lo'
-done
-LIBOBJS=$ac_libobjs
-
-LTLIBOBJS=$ac_ltlibobjs
-
-
- if test -n "$EXEEXT"; then
-  am__EXEEXT_TRUE=
-  am__EXEEXT_FALSE='#'
-else
-  am__EXEEXT_TRUE='#'
-  am__EXEEXT_FALSE=
-fi
-
-if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then
-  { { $as_echo "$as_me:$LINENO: error: conditional \"AMDEP\" was never defined.
-Usually this means the macro was only invoked conditionally." >&5
-$as_echo "$as_me: error: conditional \"AMDEP\" was never defined.
-Usually this means the macro was only invoked conditionally." >&2;}
-   { (exit 1); exit 1; }; }
-fi
-if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then
-  { { $as_echo "$as_me:$LINENO: error: conditional \"am__fastdepCXX\" was never defined.
-Usually this means the macro was only invoked conditionally." >&5
-$as_echo "$as_me: error: conditional \"am__fastdepCXX\" was never defined.
-Usually this means the macro was only invoked conditionally." >&2;}
-   { (exit 1); exit 1; }; }
-fi
-
-: ${CONFIG_STATUS=./config.status}
-ac_write_fail=0
-ac_clean_files_save=$ac_clean_files
-ac_clean_files="$ac_clean_files $CONFIG_STATUS"
-{ $as_echo "$as_me:$LINENO: creating $CONFIG_STATUS" >&5
-$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
-cat >$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-#! $SHELL
-# Generated by $as_me.
-# Run this file to recreate the current configuration.
-# Compiler output produced by configure, useful for debugging
-# configure, is in config.log if it exists.
-
-debug=false
-ac_cs_recheck=false
-ac_cs_silent=false
-SHELL=\${CONFIG_SHELL-$SHELL}
-_ACEOF
-
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-## --------------------- ##
-## M4sh Initialization.  ##
-## --------------------- ##
-
-# Be more Bourne compatible
-DUALCASE=1; export DUALCASE # for MKS sh
-if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
-  emulate sh
-  NULLCMD=:
-  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
-  # is contrary to our usage.  Disable this feature.
-  alias -g '${1+"$@"}'='"$@"'
-  setopt NO_GLOB_SUBST
-else
-  case `(set -o) 2>/dev/null` in
-  *posix*) set -o posix ;;
-esac
-
-fi
-
-
-
-
-# PATH needs CR
-# Avoid depending upon Character Ranges.
-as_cr_letters='abcdefghijklmnopqrstuvwxyz'
-as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
-as_cr_Letters=$as_cr_letters$as_cr_LETTERS
-as_cr_digits='0123456789'
-as_cr_alnum=$as_cr_Letters$as_cr_digits
-
-as_nl='
-'
-export as_nl
-# Printing a long string crashes Solaris 7 /usr/bin/printf.
-as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
-as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
-as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
-if (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
-  as_echo='printf %s\n'
-  as_echo_n='printf %s'
-else
-  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
-    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
-    as_echo_n='/usr/ucb/echo -n'
-  else
-    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
-    as_echo_n_body='eval
-      arg=$1;
-      case $arg in
-      *"$as_nl"*)
-	expr "X$arg" : "X\\(.*\\)$as_nl";
-	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
-      esac;
-      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
-    '
-    export as_echo_n_body
-    as_echo_n='sh -c $as_echo_n_body as_echo'
-  fi
-  export as_echo_body
-  as_echo='sh -c $as_echo_body as_echo'
-fi
-
-# The user is always right.
-if test "${PATH_SEPARATOR+set}" != set; then
-  PATH_SEPARATOR=:
-  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
-    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
-      PATH_SEPARATOR=';'
-  }
-fi
-
-# Support unset when possible.
-if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then
-  as_unset=unset
-else
-  as_unset=false
-fi
-
-
-# IFS
-# We need space, tab and new line, in precisely that order.  Quoting is
-# there to prevent editors from complaining about space-tab.
-# (If _AS_PATH_WALK were called with IFS unset, it would disable word
-# splitting by setting IFS to empty value.)
-IFS=" ""	$as_nl"
-
-# Find who we are.  Look in the path if we contain no directory separator.
-case $0 in
-  *[\\/]* ) as_myself=$0 ;;
-  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
-for as_dir in $PATH
-do
-  IFS=$as_save_IFS
-  test -z "$as_dir" && as_dir=.
-  test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
-done
-IFS=$as_save_IFS
-
-     ;;
-esac
-# We did not find ourselves, most probably we were run as `sh COMMAND'
-# in which case we are not to be found in the path.
-if test "x$as_myself" = x; then
-  as_myself=$0
-fi
-if test ! -f "$as_myself"; then
-  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
-  { (exit 1); exit 1; }
-fi
-
-# Work around bugs in pre-3.0 UWIN ksh.
-for as_var in ENV MAIL MAILPATH
-do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
-done
-PS1='$ '
-PS2='> '
-PS4='+ '
-
-# NLS nuisances.
-LC_ALL=C
-export LC_ALL
-LANGUAGE=C
-export LANGUAGE
-
-# Required to use basename.
-if expr a : '\(a\)' >/dev/null 2>&1 &&
-   test "X`expr 00001 : '.*\(...\)'`" = X001; then
-  as_expr=expr
-else
-  as_expr=false
-fi
-
-if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
-  as_basename=basename
-else
-  as_basename=false
-fi
-
-
-# Name of the executable.
-as_me=`$as_basename -- "$0" ||
-$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
-	 X"$0" : 'X\(//\)$' \| \
-	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X/"$0" |
-    sed '/^.*\/\([^/][^/]*\)\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\/\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\/\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-
-# CDPATH.
-$as_unset CDPATH
-
-
-
-  as_lineno_1=$LINENO
-  as_lineno_2=$LINENO
-  test "x$as_lineno_1" != "x$as_lineno_2" &&
-  test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2" || {
-
-  # Create $as_me.lineno as a copy of $as_myself, but with $LINENO
-  # uniformly replaced by the line number.  The first 'sed' inserts a
-  # line-number line after each line using $LINENO; the second 'sed'
-  # does the real work.  The second script uses 'N' to pair each
-  # line-number line with the line containing $LINENO, and appends
-  # trailing '-' during substitution so that $LINENO is not a special
-  # case at line end.
-  # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the
-  # scripts with optimization help from Paolo Bonzini.  Blame Lee
-  # E. McMahon (1931-1989) for sed's syntax.  :-)
-  sed -n '
-    p
-    /[$]LINENO/=
-  ' <$as_myself |
-    sed '
-      s/[$]LINENO.*/&-/
-      t lineno
-      b
-      :lineno
-      N
-      :loop
-      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
-      t loop
-      s/-\n.*//
-    ' >$as_me.lineno &&
-  chmod +x "$as_me.lineno" ||
-    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2
-   { (exit 1); exit 1; }; }
-
-  # Don't try to exec as it changes $[0], causing all sort of problems
-  # (the dirname of $[0] is not the place where we might find the
-  # original and so on.  Autoconf is especially sensitive to this).
-  . "./$as_me.lineno"
-  # Exit status is that of the last command.
-  exit
-}
-
-
-if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
-  as_dirname=dirname
-else
-  as_dirname=false
-fi
-
-ECHO_C= ECHO_N= ECHO_T=
-case `echo -n x` in
--n*)
-  case `echo 'x\c'` in
-  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
-  *)   ECHO_C='\c';;
-  esac;;
-*)
-  ECHO_N='-n';;
-esac
-if expr a : '\(a\)' >/dev/null 2>&1 &&
-   test "X`expr 00001 : '.*\(...\)'`" = X001; then
-  as_expr=expr
-else
-  as_expr=false
-fi
-
-rm -f conf$$ conf$$.exe conf$$.file
-if test -d conf$$.dir; then
-  rm -f conf$$.dir/conf$$.file
-else
-  rm -f conf$$.dir
-  mkdir conf$$.dir 2>/dev/null
-fi
-if (echo >conf$$.file) 2>/dev/null; then
-  if ln -s conf$$.file conf$$ 2>/dev/null; then
-    as_ln_s='ln -s'
-    # ... but there are two gotchas:
-    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
-    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
-    # In both cases, we have to default to `cp -p'.
-    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
-      as_ln_s='cp -p'
-  elif ln conf$$.file conf$$ 2>/dev/null; then
-    as_ln_s=ln
-  else
-    as_ln_s='cp -p'
-  fi
-else
-  as_ln_s='cp -p'
-fi
-rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
-rmdir conf$$.dir 2>/dev/null
-
-if mkdir -p . 2>/dev/null; then
-  as_mkdir_p=:
-else
-  test -d ./-p && rmdir ./-p
-  as_mkdir_p=false
-fi
-
-if test -x / >/dev/null 2>&1; then
-  as_test_x='test -x'
-else
-  if ls -dL / >/dev/null 2>&1; then
-    as_ls_L_option=L
-  else
-    as_ls_L_option=
-  fi
-  as_test_x='
-    eval sh -c '\''
-      if test -d "$1"; then
-	test -d "$1/.";
-      else
-	case $1 in
-	-*)set "./$1";;
-	esac;
-	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in
-	???[sx]*):;;*)false;;esac;fi
-    '\'' sh
-  '
-fi
-as_executable_p=$as_test_x
-
-# Sed expression to map a string onto a valid CPP name.
-as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
-
-# Sed expression to map a string onto a valid variable name.
-as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
-
-
-exec 6>&1
-
-# Save the log message, to keep $[0] and so on meaningful, and to
-# report actual input values of CONFIG_FILES etc. instead of their
-# values after options handling.
-ac_log="
-This file was extended by Parafly $as_me 0.1, which was
-generated by GNU Autoconf 2.63.  Invocation command line was
-
-  CONFIG_FILES    = $CONFIG_FILES
-  CONFIG_HEADERS  = $CONFIG_HEADERS
-  CONFIG_LINKS    = $CONFIG_LINKS
-  CONFIG_COMMANDS = $CONFIG_COMMANDS
-  $ $0 $@
-
-on `(hostname || uname -n) 2>/dev/null | sed 1q`
-"
-
-_ACEOF
-
-case $ac_config_files in *"
-"*) set x $ac_config_files; shift; ac_config_files=$*;;
-esac
-
-case $ac_config_headers in *"
-"*) set x $ac_config_headers; shift; ac_config_headers=$*;;
-esac
-
-
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-# Files that config.status was made for.
-config_files="$ac_config_files"
-config_headers="$ac_config_headers"
-config_commands="$ac_config_commands"
-
-_ACEOF
-
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-ac_cs_usage="\
-\`$as_me' instantiates files from templates according to the
-current configuration.
-
-Usage: $0 [OPTION]... [FILE]...
-
-  -h, --help       print this help, then exit
-  -V, --version    print version number and configuration settings, then exit
-  -q, --quiet, --silent
-                   do not print progress messages
-  -d, --debug      don't remove temporary files
-      --recheck    update $as_me by reconfiguring in the same conditions
-      --file=FILE[:TEMPLATE]
-                   instantiate the configuration file FILE
-      --header=FILE[:TEMPLATE]
-                   instantiate the configuration header FILE
-
-Configuration files:
-$config_files
-
-Configuration headers:
-$config_headers
-
-Configuration commands:
-$config_commands
-
-Report bugs to <bug-autoconf at gnu.org>."
-
-_ACEOF
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-ac_cs_version="\\
-Parafly config.status 0.1
-configured by $0, generated by GNU Autoconf 2.63,
-  with options \\"`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`\\"
-
-Copyright (C) 2008 Free Software Foundation, Inc.
-This config.status script is free software; the Free Software Foundation
-gives unlimited permission to copy, distribute and modify it."
-
-ac_pwd='$ac_pwd'
-srcdir='$srcdir'
-INSTALL='$INSTALL'
-MKDIR_P='$MKDIR_P'
-AWK='$AWK'
-test -n "\$AWK" || AWK=awk
-_ACEOF
-
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-# The default lists apply if the user does not specify any file.
-ac_need_defaults=:
-while test $# != 0
-do
-  case $1 in
-  --*=*)
-    ac_option=`expr "X$1" : 'X\([^=]*\)='`
-    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
-    ac_shift=:
-    ;;
-  *)
-    ac_option=$1
-    ac_optarg=$2
-    ac_shift=shift
-    ;;
-  esac
-
-  case $ac_option in
-  # Handling of the options.
-  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
-    ac_cs_recheck=: ;;
-  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
-    $as_echo "$ac_cs_version"; exit ;;
-  --debug | --debu | --deb | --de | --d | -d )
-    debug=: ;;
-  --file | --fil | --fi | --f )
-    $ac_shift
-    case $ac_optarg in
-    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
-    esac
-    CONFIG_FILES="$CONFIG_FILES '$ac_optarg'"
-    ac_need_defaults=false;;
-  --header | --heade | --head | --hea )
-    $ac_shift
-    case $ac_optarg in
-    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
-    esac
-    CONFIG_HEADERS="$CONFIG_HEADERS '$ac_optarg'"
-    ac_need_defaults=false;;
-  --he | --h)
-    # Conflict between --help and --header
-    { $as_echo "$as_me: error: ambiguous option: $1
-Try \`$0 --help' for more information." >&2
-   { (exit 1); exit 1; }; };;
-  --help | --hel | -h )
-    $as_echo "$ac_cs_usage"; exit ;;
-  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
-  | -silent | --silent | --silen | --sile | --sil | --si | --s)
-    ac_cs_silent=: ;;
-
-  # This is an error.
-  -*) { $as_echo "$as_me: error: unrecognized option: $1
-Try \`$0 --help' for more information." >&2
-   { (exit 1); exit 1; }; } ;;
-
-  *) ac_config_targets="$ac_config_targets $1"
-     ac_need_defaults=false ;;
-
-  esac
-  shift
-done
-
-ac_configure_extra_args=
-
-if $ac_cs_silent; then
-  exec 6>/dev/null
-  ac_configure_extra_args="$ac_configure_extra_args --silent"
-fi
-
-_ACEOF
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-if \$ac_cs_recheck; then
-  set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
-  shift
-  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
-  CONFIG_SHELL='$SHELL'
-  export CONFIG_SHELL
-  exec "\$@"
-fi
-
-_ACEOF
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-exec 5>>config.log
-{
-  echo
-  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
-## Running $as_me. ##
-_ASBOX
-  $as_echo "$ac_log"
-} >&5
-
-_ACEOF
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-#
-# INIT-COMMANDS
-#
-AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"
-
-_ACEOF
-
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-
-# Handling of arguments.
-for ac_config_target in $ac_config_targets
-do
-  case $ac_config_target in
-    "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;;
-    "config.h") CONFIG_HEADERS="$CONFIG_HEADERS config.h" ;;
-    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
-    "src/Makefile") CONFIG_FILES="$CONFIG_FILES src/Makefile" ;;
-
-  *) { { $as_echo "$as_me:$LINENO: error: invalid argument: $ac_config_target" >&5
-$as_echo "$as_me: error: invalid argument: $ac_config_target" >&2;}
-   { (exit 1); exit 1; }; };;
-  esac
-done
-
-
-# If the user did not use the arguments to specify the items to instantiate,
-# then the envvar interface is used.  Set only those that are not.
-# We use the long form for the default assignment because of an extremely
-# bizarre bug on SunOS 4.1.3.
-if $ac_need_defaults; then
-  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
-  test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers
-  test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands
-fi
-
-# Have a temporary directory for convenience.  Make it in the build tree
-# simply because there is no reason against having it here, and in addition,
-# creating and moving files from /tmp can sometimes cause problems.
-# Hook for its removal unless debugging.
-# Note that there is a small window in which the directory will not be cleaned:
-# after its creation but before its name has been assigned to `$tmp'.
-$debug ||
-{
-  tmp=
-  trap 'exit_status=$?
-  { test -z "$tmp" || test ! -d "$tmp" || rm -fr "$tmp"; } && exit $exit_status
-' 0
-  trap '{ (exit 1); exit 1; }' 1 2 13 15
-}
-# Create a (secure) tmp directory for tmp files.
-
-{
-  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
-  test -n "$tmp" && test -d "$tmp"
-}  ||
-{
-  tmp=./conf$$-$RANDOM
-  (umask 077 && mkdir "$tmp")
-} ||
-{
-   $as_echo "$as_me: cannot create a temporary directory in ." >&2
-   { (exit 1); exit 1; }
-}
-
-# Set up the scripts for CONFIG_FILES section.
-# No need to generate them if there are no CONFIG_FILES.
-# This happens for instance with `./config.status config.h'.
-if test -n "$CONFIG_FILES"; then
-
-
-ac_cr='
'
-ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
-if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
-  ac_cs_awk_cr='\\r'
-else
-  ac_cs_awk_cr=$ac_cr
-fi
-
-echo 'BEGIN {' >"$tmp/subs1.awk" &&
-_ACEOF
-
-
-{
-  echo "cat >conf$$subs.awk <<_ACEOF" &&
-  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
-  echo "_ACEOF"
-} >conf$$subs.sh ||
-  { { $as_echo "$as_me:$LINENO: error: could not make $CONFIG_STATUS" >&5
-$as_echo "$as_me: error: could not make $CONFIG_STATUS" >&2;}
-   { (exit 1); exit 1; }; }
-ac_delim_num=`echo "$ac_subst_vars" | grep -c '$'`
-ac_delim='%!_!# '
-for ac_last_try in false false false false false :; do
-  . ./conf$$subs.sh ||
-    { { $as_echo "$as_me:$LINENO: error: could not make $CONFIG_STATUS" >&5
-$as_echo "$as_me: error: could not make $CONFIG_STATUS" >&2;}
-   { (exit 1); exit 1; }; }
-
-  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
-  if test $ac_delim_n = $ac_delim_num; then
-    break
-  elif $ac_last_try; then
-    { { $as_echo "$as_me:$LINENO: error: could not make $CONFIG_STATUS" >&5
-$as_echo "$as_me: error: could not make $CONFIG_STATUS" >&2;}
-   { (exit 1); exit 1; }; }
-  else
-    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
-  fi
-done
-rm -f conf$$subs.sh
-
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-cat >>"\$tmp/subs1.awk" <<\\_ACAWK &&
-_ACEOF
-sed -n '
-h
-s/^/S["/; s/!.*/"]=/
-p
-g
-s/^[^!]*!//
-:repl
-t repl
-s/'"$ac_delim"'$//
-t delim
-:nl
-h
-s/\(.\{148\}\).*/\1/
-t more1
-s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
-p
-n
-b repl
-:more1
-s/["\\]/\\&/g; s/^/"/; s/$/"\\/
-p
-g
-s/.\{148\}//
-t nl
-:delim
-h
-s/\(.\{148\}\).*/\1/
-t more2
-s/["\\]/\\&/g; s/^/"/; s/$/"/
-p
-b
-:more2
-s/["\\]/\\&/g; s/^/"/; s/$/"\\/
-p
-g
-s/.\{148\}//
-t delim
-' <conf$$subs.awk | sed '
-/^[^""]/{
-  N
-  s/\n//
-}
-' >>$CONFIG_STATUS || ac_write_fail=1
-rm -f conf$$subs.awk
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-_ACAWK
-cat >>"\$tmp/subs1.awk" <<_ACAWK &&
-  for (key in S) S_is_set[key] = 1
-  FS = ""
-
-}
-{
-  line = $ 0
-  nfields = split(line, field, "@")
-  substed = 0
-  len = length(field[1])
-  for (i = 2; i < nfields; i++) {
-    key = field[i]
-    keylen = length(key)
-    if (S_is_set[key]) {
-      value = S[key]
-      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
-      len += length(value) + length(field[++i])
-      substed = 1
-    } else
-      len += 1 + keylen
-  }
-
-  print line
-}
-
-_ACAWK
-_ACEOF
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
-  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
-else
-  cat
-fi < "$tmp/subs1.awk" > "$tmp/subs.awk" \
-  || { { $as_echo "$as_me:$LINENO: error: could not setup config files machinery" >&5
-$as_echo "$as_me: error: could not setup config files machinery" >&2;}
-   { (exit 1); exit 1; }; }
-_ACEOF
-
-# VPATH may cause trouble with some makes, so we remove $(srcdir),
-# ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and
-# trailing colons and then remove the whole line if VPATH becomes empty
-# (actually we leave an empty line to preserve line numbers).
-if test "x$srcdir" = x.; then
-  ac_vpsub='/^[	 ]*VPATH[	 ]*=/{
-s/:*\$(srcdir):*/:/
-s/:*\${srcdir}:*/:/
-s/:*@srcdir@:*/:/
-s/^\([^=]*=[	 ]*\):*/\1/
-s/:*$//
-s/^[^=]*=[	 ]*$//
-}'
-fi
-
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-fi # test -n "$CONFIG_FILES"
-
-# Set up the scripts for CONFIG_HEADERS section.
-# No need to generate them if there are no CONFIG_HEADERS.
-# This happens for instance with `./config.status Makefile'.
-if test -n "$CONFIG_HEADERS"; then
-cat >"$tmp/defines.awk" <<\_ACAWK ||
-BEGIN {
-_ACEOF
-
-# Transform confdefs.h into an awk script `defines.awk', embedded as
-# here-document in config.status, that substitutes the proper values into
-# config.h.in to produce config.h.
-
-# Create a delimiter string that does not exist in confdefs.h, to ease
-# handling of long lines.
-ac_delim='%!_!# '
-for ac_last_try in false false :; do
-  ac_t=`sed -n "/$ac_delim/p" confdefs.h`
-  if test -z "$ac_t"; then
-    break
-  elif $ac_last_try; then
-    { { $as_echo "$as_me:$LINENO: error: could not make $CONFIG_HEADERS" >&5
-$as_echo "$as_me: error: could not make $CONFIG_HEADERS" >&2;}
-   { (exit 1); exit 1; }; }
-  else
-    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
-  fi
-done
-
-# For the awk script, D is an array of macro values keyed by name,
-# likewise P contains macro parameters if any.  Preserve backslash
-# newline sequences.
-
-ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]*
-sed -n '
-s/.\{148\}/&'"$ac_delim"'/g
-t rset
-:rset
-s/^[	 ]*#[	 ]*define[	 ][	 ]*/ /
-t def
-d
-:def
-s/\\$//
-t bsnl
-s/["\\]/\\&/g
-s/^ \('"$ac_word_re"'\)\(([^()]*)\)[	 ]*\(.*\)/P["\1"]="\2"\
-D["\1"]=" \3"/p
-s/^ \('"$ac_word_re"'\)[	 ]*\(.*\)/D["\1"]=" \2"/p
-d
-:bsnl
-s/["\\]/\\&/g
-s/^ \('"$ac_word_re"'\)\(([^()]*)\)[	 ]*\(.*\)/P["\1"]="\2"\
-D["\1"]=" \3\\\\\\n"\\/p
-t cont
-s/^ \('"$ac_word_re"'\)[	 ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p
-t cont
-d
-:cont
-n
-s/.\{148\}/&'"$ac_delim"'/g
-t clear
-:clear
-s/\\$//
-t bsnlc
-s/["\\]/\\&/g; s/^/"/; s/$/"/p
-d
-:bsnlc
-s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p
-b cont
-' <confdefs.h | sed '
-s/'"$ac_delim"'/"\\\
-"/g' >>$CONFIG_STATUS || ac_write_fail=1
-
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-  for (key in D) D_is_set[key] = 1
-  FS = ""
-}
-/^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ {
-  line = \$ 0
-  split(line, arg, " ")
-  if (arg[1] == "#") {
-    defundef = arg[2]
-    mac1 = arg[3]
-  } else {
-    defundef = substr(arg[1], 2)
-    mac1 = arg[2]
-  }
-  split(mac1, mac2, "(") #)
-  macro = mac2[1]
-  prefix = substr(line, 1, index(line, defundef) - 1)
-  if (D_is_set[macro]) {
-    # Preserve the white space surrounding the "#".
-    print prefix "define", macro P[macro] D[macro]
-    next
-  } else {
-    # Replace #undef with comments.  This is necessary, for example,
-    # in the case of _POSIX_SOURCE, which is predefined and required
-    # on some systems where configure will not decide to define it.
-    if (defundef == "undef") {
-      print "/*", prefix defundef, macro, "*/"
-      next
-    }
-  }
-}
-{ print }
-_ACAWK
-_ACEOF
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-  { { $as_echo "$as_me:$LINENO: error: could not setup config headers machinery" >&5
-$as_echo "$as_me: error: could not setup config headers machinery" >&2;}
-   { (exit 1); exit 1; }; }
-fi # test -n "$CONFIG_HEADERS"
-
-
-eval set X "  :F $CONFIG_FILES  :H $CONFIG_HEADERS    :C $CONFIG_COMMANDS"
-shift
-for ac_tag
-do
-  case $ac_tag in
-  :[FHLC]) ac_mode=$ac_tag; continue;;
-  esac
-  case $ac_mode$ac_tag in
-  :[FHL]*:*);;
-  :L* | :C*:*) { { $as_echo "$as_me:$LINENO: error: invalid tag $ac_tag" >&5
-$as_echo "$as_me: error: invalid tag $ac_tag" >&2;}
-   { (exit 1); exit 1; }; };;
-  :[FH]-) ac_tag=-:-;;
-  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
-  esac
-  ac_save_IFS=$IFS
-  IFS=:
-  set x $ac_tag
-  IFS=$ac_save_IFS
-  shift
-  ac_file=$1
-  shift
-
-  case $ac_mode in
-  :L) ac_source=$1;;
-  :[FH])
-    ac_file_inputs=
-    for ac_f
-    do
-      case $ac_f in
-      -) ac_f="$tmp/stdin";;
-      *) # Look for the file first in the build tree, then in the source tree
-	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
-	 # because $ac_f cannot contain `:'.
-	 test -f "$ac_f" ||
-	   case $ac_f in
-	   [\\/$]*) false;;
-	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
-	   esac ||
-	   { { $as_echo "$as_me:$LINENO: error: cannot find input file: $ac_f" >&5
-$as_echo "$as_me: error: cannot find input file: $ac_f" >&2;}
-   { (exit 1); exit 1; }; };;
-      esac
-      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
-      ac_file_inputs="$ac_file_inputs '$ac_f'"
-    done
-
-    # Let's still pretend it is `configure' which instantiates (i.e., don't
-    # use $as_me), people would be surprised to read:
-    #    /* config.h.  Generated by config.status.  */
-    configure_input='Generated from '`
-	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
-	`' by configure.'
-    if test x"$ac_file" != x-; then
-      configure_input="$ac_file.  $configure_input"
-      { $as_echo "$as_me:$LINENO: creating $ac_file" >&5
-$as_echo "$as_me: creating $ac_file" >&6;}
-    fi
-    # Neutralize special characters interpreted by sed in replacement strings.
-    case $configure_input in #(
-    *\&* | *\|* | *\\* )
-       ac_sed_conf_input=`$as_echo "$configure_input" |
-       sed 's/[\\\\&|]/\\\\&/g'`;; #(
-    *) ac_sed_conf_input=$configure_input;;
-    esac
-
-    case $ac_tag in
-    *:-:* | *:-) cat >"$tmp/stdin" \
-      || { { $as_echo "$as_me:$LINENO: error: could not create $ac_file" >&5
-$as_echo "$as_me: error: could not create $ac_file" >&2;}
-   { (exit 1); exit 1; }; } ;;
-    esac
-    ;;
-  esac
-
-  ac_dir=`$as_dirname -- "$ac_file" ||
-$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$ac_file" : 'X\(//\)[^/]' \| \
-	 X"$ac_file" : 'X\(//\)$' \| \
-	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$ac_file" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-  { as_dir="$ac_dir"
-  case $as_dir in #(
-  -*) as_dir=./$as_dir;;
-  esac
-  test -d "$as_dir" || { $as_mkdir_p && mkdir -p "$as_dir"; } || {
-    as_dirs=
-    while :; do
-      case $as_dir in #(
-      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
-      *) as_qdir=$as_dir;;
-      esac
-      as_dirs="'$as_qdir' $as_dirs"
-      as_dir=`$as_dirname -- "$as_dir" ||
-$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$as_dir" : 'X\(//\)[^/]' \| \
-	 X"$as_dir" : 'X\(//\)$' \| \
-	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$as_dir" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-      test -d "$as_dir" && break
-    done
-    test -z "$as_dirs" || eval "mkdir $as_dirs"
-  } || test -d "$as_dir" || { { $as_echo "$as_me:$LINENO: error: cannot create directory $as_dir" >&5
-$as_echo "$as_me: error: cannot create directory $as_dir" >&2;}
-   { (exit 1); exit 1; }; }; }
-  ac_builddir=.
-
-case "$ac_dir" in
-.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
-*)
-  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
-  # A ".." for each directory in $ac_dir_suffix.
-  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
-  case $ac_top_builddir_sub in
-  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
-  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
-  esac ;;
-esac
-ac_abs_top_builddir=$ac_pwd
-ac_abs_builddir=$ac_pwd$ac_dir_suffix
-# for backward compatibility:
-ac_top_builddir=$ac_top_build_prefix
-
-case $srcdir in
-  .)  # We are building in place.
-    ac_srcdir=.
-    ac_top_srcdir=$ac_top_builddir_sub
-    ac_abs_top_srcdir=$ac_pwd ;;
-  [\\/]* | ?:[\\/]* )  # Absolute name.
-    ac_srcdir=$srcdir$ac_dir_suffix;
-    ac_top_srcdir=$srcdir
-    ac_abs_top_srcdir=$srcdir ;;
-  *) # Relative name.
-    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
-    ac_top_srcdir=$ac_top_build_prefix$srcdir
-    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
-esac
-ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
-
-
-  case $ac_mode in
-  :F)
-  #
-  # CONFIG_FILE
-  #
-
-  case $INSTALL in
-  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
-  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
-  esac
-  ac_MKDIR_P=$MKDIR_P
-  case $MKDIR_P in
-  [\\/$]* | ?:[\\/]* ) ;;
-  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
-  esac
-_ACEOF
-
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-# If the template does not know about datarootdir, expand it.
-# FIXME: This hack should be removed a few years after 2.60.
-ac_datarootdir_hack=; ac_datarootdir_seen=
-
-ac_sed_dataroot='
-/datarootdir/ {
-  p
-  q
-}
-/@datadir@/p
-/@docdir@/p
-/@infodir@/p
-/@localedir@/p
-/@mandir@/p
-'
-case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
-*datarootdir*) ac_datarootdir_seen=yes;;
-*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
-  { $as_echo "$as_me:$LINENO: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
-$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
-_ACEOF
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-  ac_datarootdir_hack='
-  s&@datadir@&$datadir&g
-  s&@docdir@&$docdir&g
-  s&@infodir@&$infodir&g
-  s&@localedir@&$localedir&g
-  s&@mandir@&$mandir&g
-    s&\\\${datarootdir}&$datarootdir&g' ;;
-esac
-_ACEOF
-
-# Neutralize VPATH when `$srcdir' = `.'.
-# Shell code in configure.ac might set extrasub.
-# FIXME: do we really want to maintain this feature?
-cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
-ac_sed_extra="$ac_vpsub
-$extrasub
-_ACEOF
-cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
-:t
-/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
-s|@configure_input@|$ac_sed_conf_input|;t t
-s&@top_builddir@&$ac_top_builddir_sub&;t t
-s&@top_build_prefix@&$ac_top_build_prefix&;t t
-s&@srcdir@&$ac_srcdir&;t t
-s&@abs_srcdir@&$ac_abs_srcdir&;t t
-s&@top_srcdir@&$ac_top_srcdir&;t t
-s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
-s&@builddir@&$ac_builddir&;t t
-s&@abs_builddir@&$ac_abs_builddir&;t t
-s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
-s&@INSTALL@&$ac_INSTALL&;t t
-s&@MKDIR_P@&$ac_MKDIR_P&;t t
-$ac_datarootdir_hack
-"
-eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$tmp/subs.awk" >$tmp/out \
-  || { { $as_echo "$as_me:$LINENO: error: could not create $ac_file" >&5
-$as_echo "$as_me: error: could not create $ac_file" >&2;}
-   { (exit 1); exit 1; }; }
-
-test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
-  { ac_out=`sed -n '/\${datarootdir}/p' "$tmp/out"`; test -n "$ac_out"; } &&
-  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' "$tmp/out"`; test -z "$ac_out"; } &&
-  { $as_echo "$as_me:$LINENO: WARNING: $ac_file contains a reference to the variable \`datarootdir'
-which seems to be undefined.  Please make sure it is defined." >&5
-$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
-which seems to be undefined.  Please make sure it is defined." >&2;}
-
-  rm -f "$tmp/stdin"
-  case $ac_file in
-  -) cat "$tmp/out" && rm -f "$tmp/out";;
-  *) rm -f "$ac_file" && mv "$tmp/out" "$ac_file";;
-  esac \
-  || { { $as_echo "$as_me:$LINENO: error: could not create $ac_file" >&5
-$as_echo "$as_me: error: could not create $ac_file" >&2;}
-   { (exit 1); exit 1; }; }
- ;;
-  :H)
-  #
-  # CONFIG_HEADER
-  #
-  if test x"$ac_file" != x-; then
-    {
-      $as_echo "/* $configure_input  */" \
-      && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs"
-    } >"$tmp/config.h" \
-      || { { $as_echo "$as_me:$LINENO: error: could not create $ac_file" >&5
-$as_echo "$as_me: error: could not create $ac_file" >&2;}
-   { (exit 1); exit 1; }; }
-    if diff "$ac_file" "$tmp/config.h" >/dev/null 2>&1; then
-      { $as_echo "$as_me:$LINENO: $ac_file is unchanged" >&5
-$as_echo "$as_me: $ac_file is unchanged" >&6;}
-    else
-      rm -f "$ac_file"
-      mv "$tmp/config.h" "$ac_file" \
-	|| { { $as_echo "$as_me:$LINENO: error: could not create $ac_file" >&5
-$as_echo "$as_me: error: could not create $ac_file" >&2;}
-   { (exit 1); exit 1; }; }
-    fi
-  else
-    $as_echo "/* $configure_input  */" \
-      && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" \
-      || { { $as_echo "$as_me:$LINENO: error: could not create -" >&5
-$as_echo "$as_me: error: could not create -" >&2;}
-   { (exit 1); exit 1; }; }
-  fi
-# Compute "$ac_file"'s index in $config_headers.
-_am_arg="$ac_file"
-_am_stamp_count=1
-for _am_header in $config_headers :; do
-  case $_am_header in
-    $_am_arg | $_am_arg:* )
-      break ;;
-    * )
-      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
-  esac
-done
-echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" ||
-$as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$_am_arg" : 'X\(//\)[^/]' \| \
-	 X"$_am_arg" : 'X\(//\)$' \| \
-	 X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$_am_arg" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`/stamp-h$_am_stamp_count
- ;;
-
-  :C)  { $as_echo "$as_me:$LINENO: executing $ac_file commands" >&5
-$as_echo "$as_me: executing $ac_file commands" >&6;}
- ;;
-  esac
-
-
-  case $ac_file$ac_mode in
-    "depfiles":C) test x"$AMDEP_TRUE" != x"" || {
-  # Autoconf 2.62 quotes --file arguments for eval, but not when files
-  # are listed without --file.  Let's play safe and only enable the eval
-  # if we detect the quoting.
-  case $CONFIG_FILES in
-  *\'*) eval set x "$CONFIG_FILES" ;;
-  *)   set x $CONFIG_FILES ;;
-  esac
-  shift
-  for mf
-  do
-    # Strip MF so we end up with the name of the file.
-    mf=`echo "$mf" | sed -e 's/:.*$//'`
-    # Check whether this is an Automake generated Makefile or not.
-    # We used to match only the files named `Makefile.in', but
-    # some people rename them; so instead we look at the file content.
-    # Grep'ing the first line is not enough: some people post-process
-    # each Makefile.in and add a new line on top of each file to say so.
-    # Grep'ing the whole file is not good either: AIX grep has a line
-    # limit of 2048, but all sed's we know have understand at least 4000.
-    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
-      dirpart=`$as_dirname -- "$mf" ||
-$as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$mf" : 'X\(//\)[^/]' \| \
-	 X"$mf" : 'X\(//\)$' \| \
-	 X"$mf" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$mf" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-    else
-      continue
-    fi
-    # Extract the definition of DEPDIR, am__include, and am__quote
-    # from the Makefile without running `make'.
-    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
-    test -z "$DEPDIR" && continue
-    am__include=`sed -n 's/^am__include = //p' < "$mf"`
-    test -z "am__include" && continue
-    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
-    # When using ansi2knr, U may be empty or an underscore; expand it
-    U=`sed -n 's/^U = //p' < "$mf"`
-    # Find all dependency output files, they are included files with
-    # $(DEPDIR) in their names.  We invoke sed twice because it is the
-    # simplest approach to changing $(DEPDIR) to its actual value in the
-    # expansion.
-    for file in `sed -n "
-      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
-	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do
-      # Make sure the directory exists.
-      test -f "$dirpart/$file" && continue
-      fdir=`$as_dirname -- "$file" ||
-$as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$file" : 'X\(//\)[^/]' \| \
-	 X"$file" : 'X\(//\)$' \| \
-	 X"$file" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$file" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-      { as_dir=$dirpart/$fdir
-  case $as_dir in #(
-  -*) as_dir=./$as_dir;;
-  esac
-  test -d "$as_dir" || { $as_mkdir_p && mkdir -p "$as_dir"; } || {
-    as_dirs=
-    while :; do
-      case $as_dir in #(
-      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
-      *) as_qdir=$as_dir;;
-      esac
-      as_dirs="'$as_qdir' $as_dirs"
-      as_dir=`$as_dirname -- "$as_dir" ||
-$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	 X"$as_dir" : 'X\(//\)[^/]' \| \
-	 X"$as_dir" : 'X\(//\)$' \| \
-	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
-$as_echo X"$as_dir" |
-    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)[^/].*/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\/\)$/{
-	    s//\1/
-	    q
-	  }
-	  /^X\(\/\).*/{
-	    s//\1/
-	    q
-	  }
-	  s/.*/./; q'`
-      test -d "$as_dir" && break
-    done
-    test -z "$as_dirs" || eval "mkdir $as_dirs"
-  } || test -d "$as_dir" || { { $as_echo "$as_me:$LINENO: error: cannot create directory $as_dir" >&5
-$as_echo "$as_me: error: cannot create directory $as_dir" >&2;}
-   { (exit 1); exit 1; }; }; }
-      # echo "creating $dirpart/$file"
-      echo '# dummy' > "$dirpart/$file"
-    done
-  done
-}
- ;;
-
-  esac
-done # for ac_tag
-
-
-{ (exit 0); exit 0; }
-_ACEOF
-chmod +x $CONFIG_STATUS
-ac_clean_files=$ac_clean_files_save
-
-test $ac_write_fail = 0 ||
-  { { $as_echo "$as_me:$LINENO: error: write failure creating $CONFIG_STATUS" >&5
-$as_echo "$as_me: error: write failure creating $CONFIG_STATUS" >&2;}
-   { (exit 1); exit 1; }; }
-
-
-# configure is writing to config.log, and then calls config.status.
-# config.status does its own redirection, appending to config.log.
-# Unfortunately, on DOS this fails, as config.log is still kept open
-# by configure, so config.status won't be able to write to it; its
-# output is simply discarded.  So we exec the FD to /dev/null,
-# effectively closing config.log, so it can be properly (re)opened and
-# appended to by config.status.  When coming back to configure, we
-# need to make the FD available again.
-if test "$no_create" != yes; then
-  ac_cs_success=:
-  ac_config_status_args=
-  test "$silent" = yes &&
-    ac_config_status_args="$ac_config_status_args --quiet"
-  exec 5>/dev/null
-  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
-  exec 5>>config.log
-  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
-  # would make configure fail if this is the last instruction.
-  $ac_cs_success || { (exit 1); exit 1; }
-fi
-if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
-  { $as_echo "$as_me:$LINENO: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
-$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
-fi
-
diff --git a/trinity-plugins/parafly-code/configure.ac b/trinity-plugins/parafly-code/configure.ac
deleted file mode 100644
index aa22549..0000000
--- a/trinity-plugins/parafly-code/configure.ac
+++ /dev/null
@@ -1,15 +0,0 @@
-AC_INIT([Parafly], [0.1], [bug-report at address])
-AM_INIT_AUTOMAKE([foreign -Wall -Werror])
-AC_LANG([C++])
-AC_PROG_CXX
-#AC_OPENMP # requires autoconf >= 2.62
-AC_SUBST([AM_CXXFLAGS], [-m64])
-case $CXX in
-  g++*) AC_SUBST([AM_CXXFLAGS],["-pedantic -fopenmp -Wall -Wextra -Wno-long-long -Wno-deprecated $AM_CXXFLAGS"]);;
-  sunCC*) AC_SUBST([AM_CXXFLAGS], ["-library=stlport4 -xopenmp -xvpara -fast $AM_CXXFLAGS"]) ;;
-  icpc*) AC_SUBST([AM_CXXFLAGS], ["-Wall -openmp $AM_CXXFLAGS"]) ;;
-esac
-AC_SEARCH_LIBS([cos], [m])
-AC_CONFIG_HEADERS([config.h])
-AC_CONFIG_FILES([Makefile src/Makefile])
-AC_OUTPUT
diff --git a/trinity-plugins/parafly-code/depcomp b/trinity-plugins/parafly-code/depcomp
deleted file mode 100755
index bd0ac08..0000000
--- a/trinity-plugins/parafly-code/depcomp
+++ /dev/null
@@ -1,688 +0,0 @@
-#! /bin/sh
-# depcomp - compile a program generating dependencies as side-effects
-
-scriptversion=2011-12-04.11; # UTC
-
-# Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007, 2009, 2010,
-# 2011 Free Software Foundation, Inc.
-
-# 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, 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, see <http://www.gnu.org/licenses/>.
-
-# As a special exception to the GNU General Public License, if you
-# distribute this file as part of a program that contains a
-# configuration script generated by Autoconf, you may include it under
-# the same distribution terms that you use for the rest of that program.
-
-# Originally written by Alexandre Oliva <oliva at dcc.unicamp.br>.
-
-case $1 in
-  '')
-     echo "$0: No command.  Try \`$0 --help' for more information." 1>&2
-     exit 1;
-     ;;
-  -h | --h*)
-    cat <<\EOF
-Usage: depcomp [--help] [--version] PROGRAM [ARGS]
-
-Run PROGRAMS ARGS to compile a file, generating dependencies
-as side-effects.
-
-Environment variables:
-  depmode     Dependency tracking mode.
-  source      Source file read by `PROGRAMS ARGS'.
-  object      Object file output by `PROGRAMS ARGS'.
-  DEPDIR      directory where to store dependencies.
-  depfile     Dependency file to output.
-  tmpdepfile  Temporary file to use when outputting dependencies.
-  libtool     Whether libtool is used (yes/no).
-
-Report bugs to <bug-automake at gnu.org>.
-EOF
-    exit $?
-    ;;
-  -v | --v*)
-    echo "depcomp $scriptversion"
-    exit $?
-    ;;
-esac
-
-if test -z "$depmode" || test -z "$source" || test -z "$object"; then
-  echo "depcomp: Variables source, object and depmode must be set" 1>&2
-  exit 1
-fi
-
-# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.
-depfile=${depfile-`echo "$object" |
-  sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`}
-tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`}
-
-rm -f "$tmpdepfile"
-
-# Some modes work just like other modes, but use different flags.  We
-# parameterize here, but still list the modes in the big case below,
-# to make depend.m4 easier to write.  Note that we *cannot* use a case
-# here, because this file can only contain one case statement.
-if test "$depmode" = hp; then
-  # HP compiler uses -M and no extra arg.
-  gccflag=-M
-  depmode=gcc
-fi
-
-if test "$depmode" = dashXmstdout; then
-   # This is just like dashmstdout with a different argument.
-   dashmflag=-xM
-   depmode=dashmstdout
-fi
-
-cygpath_u="cygpath -u -f -"
-if test "$depmode" = msvcmsys; then
-   # This is just like msvisualcpp but w/o cygpath translation.
-   # Just convert the backslash-escaped backslashes to single forward
-   # slashes to satisfy depend.m4
-   cygpath_u='sed s,\\\\,/,g'
-   depmode=msvisualcpp
-fi
-
-if test "$depmode" = msvc7msys; then
-   # This is just like msvc7 but w/o cygpath translation.
-   # Just convert the backslash-escaped backslashes to single forward
-   # slashes to satisfy depend.m4
-   cygpath_u='sed s,\\\\,/,g'
-   depmode=msvc7
-fi
-
-case "$depmode" in
-gcc3)
-## gcc 3 implements dependency tracking that does exactly what
-## we want.  Yay!  Note: for some reason libtool 1.4 doesn't like
-## it if -MD -MP comes after the -MF stuff.  Hmm.
-## Unfortunately, FreeBSD c89 acceptance of flags depends upon
-## the command line argument order; so add the flags where they
-## appear in depend2.am.  Note that the slowdown incurred here
-## affects only configure: in makefiles, %FASTDEP% shortcuts this.
-  for arg
-  do
-    case $arg in
-    -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;;
-    *)  set fnord "$@" "$arg" ;;
-    esac
-    shift # fnord
-    shift # $arg
-  done
-  "$@"
-  stat=$?
-  if test $stat -eq 0; then :
-  else
-    rm -f "$tmpdepfile"
-    exit $stat
-  fi
-  mv "$tmpdepfile" "$depfile"
-  ;;
-
-gcc)
-## There are various ways to get dependency output from gcc.  Here's
-## why we pick this rather obscure method:
-## - Don't want to use -MD because we'd like the dependencies to end
-##   up in a subdir.  Having to rename by hand is ugly.
-##   (We might end up doing this anyway to support other compilers.)
-## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
-##   -MM, not -M (despite what the docs say).
-## - Using -M directly means running the compiler twice (even worse
-##   than renaming).
-  if test -z "$gccflag"; then
-    gccflag=-MD,
-  fi
-  "$@" -Wp,"$gccflag$tmpdepfile"
-  stat=$?
-  if test $stat -eq 0; then :
-  else
-    rm -f "$tmpdepfile"
-    exit $stat
-  fi
-  rm -f "$depfile"
-  echo "$object : \\" > "$depfile"
-  alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
-## The second -e expression handles DOS-style file names with drive letters.
-  sed -e 's/^[^:]*: / /' \
-      -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile"
-## This next piece of magic avoids the `deleted header file' problem.
-## The problem is that when a header file which appears in a .P file
-## is deleted, the dependency causes make to die (because there is
-## typically no way to rebuild the header).  We avoid this by adding
-## dummy dependencies for each header file.  Too bad gcc doesn't do
-## this for us directly.
-  tr ' ' '
-' < "$tmpdepfile" |
-## Some versions of gcc put a space before the `:'.  On the theory
-## that the space means something, we add a space to the output as
-## well.  hp depmode also adds that space, but also prefixes the VPATH
-## to the object.  Take care to not repeat it in the output.
-## Some versions of the HPUX 10.20 sed can't process this invocation
-## correctly.  Breaking it into two sed invocations is a workaround.
-    sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \
-      | sed -e 's/$/ :/' >> "$depfile"
-  rm -f "$tmpdepfile"
-  ;;
-
-hp)
-  # This case exists only to let depend.m4 do its work.  It works by
-  # looking at the text of this script.  This case will never be run,
-  # since it is checked for above.
-  exit 1
-  ;;
-
-sgi)
-  if test "$libtool" = yes; then
-    "$@" "-Wp,-MDupdate,$tmpdepfile"
-  else
-    "$@" -MDupdate "$tmpdepfile"
-  fi
-  stat=$?
-  if test $stat -eq 0; then :
-  else
-    rm -f "$tmpdepfile"
-    exit $stat
-  fi
-  rm -f "$depfile"
-
-  if test -f "$tmpdepfile"; then  # yes, the sourcefile depend on other files
-    echo "$object : \\" > "$depfile"
-
-    # Clip off the initial element (the dependent).  Don't try to be
-    # clever and replace this with sed code, as IRIX sed won't handle
-    # lines with more than a fixed number of characters (4096 in
-    # IRIX 6.2 sed, 8192 in IRIX 6.5).  We also remove comment lines;
-    # the IRIX cc adds comments like `#:fec' to the end of the
-    # dependency line.
-    tr ' ' '
-' < "$tmpdepfile" \
-    | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \
-    tr '
-' ' ' >> "$depfile"
-    echo >> "$depfile"
-
-    # The second pass generates a dummy entry for each header file.
-    tr ' ' '
-' < "$tmpdepfile" \
-   | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \
-   >> "$depfile"
-  else
-    # The sourcefile does not contain any dependencies, so just
-    # store a dummy comment line, to avoid errors with the Makefile
-    # "include basename.Plo" scheme.
-    echo "#dummy" > "$depfile"
-  fi
-  rm -f "$tmpdepfile"
-  ;;
-
-aix)
-  # The C for AIX Compiler uses -M and outputs the dependencies
-  # in a .u file.  In older versions, this file always lives in the
-  # current directory.  Also, the AIX compiler puts `$object:' at the
-  # start of each line; $object doesn't have directory information.
-  # Version 6 uses the directory in both cases.
-  dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
-  test "x$dir" = "x$object" && dir=
-  base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
-  if test "$libtool" = yes; then
-    tmpdepfile1=$dir$base.u
-    tmpdepfile2=$base.u
-    tmpdepfile3=$dir.libs/$base.u
-    "$@" -Wc,-M
-  else
-    tmpdepfile1=$dir$base.u
-    tmpdepfile2=$dir$base.u
-    tmpdepfile3=$dir$base.u
-    "$@" -M
-  fi
-  stat=$?
-
-  if test $stat -eq 0; then :
-  else
-    rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
-    exit $stat
-  fi
-
-  for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
-  do
-    test -f "$tmpdepfile" && break
-  done
-  if test -f "$tmpdepfile"; then
-    # Each line is of the form `foo.o: dependent.h'.
-    # Do two passes, one to just change these to
-    # `$object: dependent.h' and one to simply `dependent.h:'.
-    sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
-    # That's a tab and a space in the [].
-    sed -e 's,^.*\.[a-z]*:[	 ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
-  else
-    # The sourcefile does not contain any dependencies, so just
-    # store a dummy comment line, to avoid errors with the Makefile
-    # "include basename.Plo" scheme.
-    echo "#dummy" > "$depfile"
-  fi
-  rm -f "$tmpdepfile"
-  ;;
-
-icc)
-  # Intel's C compiler understands `-MD -MF file'.  However on
-  #    icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c
-  # ICC 7.0 will fill foo.d with something like
-  #    foo.o: sub/foo.c
-  #    foo.o: sub/foo.h
-  # which is wrong.  We want:
-  #    sub/foo.o: sub/foo.c
-  #    sub/foo.o: sub/foo.h
-  #    sub/foo.c:
-  #    sub/foo.h:
-  # ICC 7.1 will output
-  #    foo.o: sub/foo.c sub/foo.h
-  # and will wrap long lines using \ :
-  #    foo.o: sub/foo.c ... \
-  #     sub/foo.h ... \
-  #     ...
-
-  "$@" -MD -MF "$tmpdepfile"
-  stat=$?
-  if test $stat -eq 0; then :
-  else
-    rm -f "$tmpdepfile"
-    exit $stat
-  fi
-  rm -f "$depfile"
-  # Each line is of the form `foo.o: dependent.h',
-  # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'.
-  # Do two passes, one to just change these to
-  # `$object: dependent.h' and one to simply `dependent.h:'.
-  sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
-  # Some versions of the HPUX 10.20 sed can't process this invocation
-  # correctly.  Breaking it into two sed invocations is a workaround.
-  sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" |
-    sed -e 's/$/ :/' >> "$depfile"
-  rm -f "$tmpdepfile"
-  ;;
-
-hp2)
-  # The "hp" stanza above does not work with aCC (C++) and HP's ia64
-  # compilers, which have integrated preprocessors.  The correct option
-  # to use with these is +Maked; it writes dependencies to a file named
-  # 'foo.d', which lands next to the object file, wherever that
-  # happens to be.
-  # Much of this is similar to the tru64 case; see comments there.
-  dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
-  test "x$dir" = "x$object" && dir=
-  base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
-  if test "$libtool" = yes; then
-    tmpdepfile1=$dir$base.d
-    tmpdepfile2=$dir.libs/$base.d
-    "$@" -Wc,+Maked
-  else
-    tmpdepfile1=$dir$base.d
-    tmpdepfile2=$dir$base.d
-    "$@" +Maked
-  fi
-  stat=$?
-  if test $stat -eq 0; then :
-  else
-     rm -f "$tmpdepfile1" "$tmpdepfile2"
-     exit $stat
-  fi
-
-  for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2"
-  do
-    test -f "$tmpdepfile" && break
-  done
-  if test -f "$tmpdepfile"; then
-    sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile"
-    # Add `dependent.h:' lines.
-    sed -ne '2,${
-	       s/^ *//
-	       s/ \\*$//
-	       s/$/:/
-	       p
-	     }' "$tmpdepfile" >> "$depfile"
-  else
-    echo "#dummy" > "$depfile"
-  fi
-  rm -f "$tmpdepfile" "$tmpdepfile2"
-  ;;
-
-tru64)
-   # The Tru64 compiler uses -MD to generate dependencies as a side
-   # effect.  `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'.
-   # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put
-   # dependencies in `foo.d' instead, so we check for that too.
-   # Subdirectories are respected.
-   dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
-   test "x$dir" = "x$object" && dir=
-   base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
-
-   if test "$libtool" = yes; then
-      # With Tru64 cc, shared objects can also be used to make a
-      # static library.  This mechanism is used in libtool 1.4 series to
-      # handle both shared and static libraries in a single compilation.
-      # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d.
-      #
-      # With libtool 1.5 this exception was removed, and libtool now
-      # generates 2 separate objects for the 2 libraries.  These two
-      # compilations output dependencies in $dir.libs/$base.o.d and
-      # in $dir$base.o.d.  We have to check for both files, because
-      # one of the two compilations can be disabled.  We should prefer
-      # $dir$base.o.d over $dir.libs/$base.o.d because the latter is
-      # automatically cleaned when .libs/ is deleted, while ignoring
-      # the former would cause a distcleancheck panic.
-      tmpdepfile1=$dir.libs/$base.lo.d   # libtool 1.4
-      tmpdepfile2=$dir$base.o.d          # libtool 1.5
-      tmpdepfile3=$dir.libs/$base.o.d    # libtool 1.5
-      tmpdepfile4=$dir.libs/$base.d      # Compaq CCC V6.2-504
-      "$@" -Wc,-MD
-   else
-      tmpdepfile1=$dir$base.o.d
-      tmpdepfile2=$dir$base.d
-      tmpdepfile3=$dir$base.d
-      tmpdepfile4=$dir$base.d
-      "$@" -MD
-   fi
-
-   stat=$?
-   if test $stat -eq 0; then :
-   else
-      rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
-      exit $stat
-   fi
-
-   for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
-   do
-     test -f "$tmpdepfile" && break
-   done
-   if test -f "$tmpdepfile"; then
-      sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
-      # That's a tab and a space in the [].
-      sed -e 's,^.*\.[a-z]*:[	 ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
-   else
-      echo "#dummy" > "$depfile"
-   fi
-   rm -f "$tmpdepfile"
-   ;;
-
-msvc7)
-  if test "$libtool" = yes; then
-    showIncludes=-Wc,-showIncludes
-  else
-    showIncludes=-showIncludes
-  fi
-  "$@" $showIncludes > "$tmpdepfile"
-  stat=$?
-  grep -v '^Note: including file: ' "$tmpdepfile"
-  if test "$stat" = 0; then :
-  else
-    rm -f "$tmpdepfile"
-    exit $stat
-  fi
-  rm -f "$depfile"
-  echo "$object : \\" > "$depfile"
-  # The first sed program below extracts the file names and escapes
-  # backslashes for cygpath.  The second sed program outputs the file
-  # name when reading, but also accumulates all include files in the
-  # hold buffer in order to output them again at the end.  This only
-  # works with sed implementations that can handle large buffers.
-  sed < "$tmpdepfile" -n '
-/^Note: including file:  *\(.*\)/ {
-  s//\1/
-  s/\\/\\\\/g
-  p
-}' | $cygpath_u | sort -u | sed -n '
-s/ /\\ /g
-s/\(.*\)/	\1 \\/p
-s/.\(.*\) \\/\1:/
-H
-$ {
-  s/.*/	/
-  G
-  p
-}' >> "$depfile"
-  rm -f "$tmpdepfile"
-  ;;
-
-msvc7msys)
-  # This case exists only to let depend.m4 do its work.  It works by
-  # looking at the text of this script.  This case will never be run,
-  # since it is checked for above.
-  exit 1
-  ;;
-
-#nosideeffect)
-  # This comment above is used by automake to tell side-effect
-  # dependency tracking mechanisms from slower ones.
-
-dashmstdout)
-  # Important note: in order to support this mode, a compiler *must*
-  # always write the preprocessed file to stdout, regardless of -o.
-  "$@" || exit $?
-
-  # Remove the call to Libtool.
-  if test "$libtool" = yes; then
-    while test "X$1" != 'X--mode=compile'; do
-      shift
-    done
-    shift
-  fi
-
-  # Remove `-o $object'.
-  IFS=" "
-  for arg
-  do
-    case $arg in
-    -o)
-      shift
-      ;;
-    $object)
-      shift
-      ;;
-    *)
-      set fnord "$@" "$arg"
-      shift # fnord
-      shift # $arg
-      ;;
-    esac
-  done
-
-  test -z "$dashmflag" && dashmflag=-M
-  # Require at least two characters before searching for `:'
-  # in the target name.  This is to cope with DOS-style filenames:
-  # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise.
-  "$@" $dashmflag |
-    sed 's:^[  ]*[^: ][^:][^:]*\:[    ]*:'"$object"'\: :' > "$tmpdepfile"
-  rm -f "$depfile"
-  cat < "$tmpdepfile" > "$depfile"
-  tr ' ' '
-' < "$tmpdepfile" | \
-## Some versions of the HPUX 10.20 sed can't process this invocation
-## correctly.  Breaking it into two sed invocations is a workaround.
-    sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
-  rm -f "$tmpdepfile"
-  ;;
-
-dashXmstdout)
-  # This case only exists to satisfy depend.m4.  It is never actually
-  # run, as this mode is specially recognized in the preamble.
-  exit 1
-  ;;
-
-makedepend)
-  "$@" || exit $?
-  # Remove any Libtool call
-  if test "$libtool" = yes; then
-    while test "X$1" != 'X--mode=compile'; do
-      shift
-    done
-    shift
-  fi
-  # X makedepend
-  shift
-  cleared=no eat=no
-  for arg
-  do
-    case $cleared in
-    no)
-      set ""; shift
-      cleared=yes ;;
-    esac
-    if test $eat = yes; then
-      eat=no
-      continue
-    fi
-    case "$arg" in
-    -D*|-I*)
-      set fnord "$@" "$arg"; shift ;;
-    # Strip any option that makedepend may not understand.  Remove
-    # the object too, otherwise makedepend will parse it as a source file.
-    -arch)
-      eat=yes ;;
-    -*|$object)
-      ;;
-    *)
-      set fnord "$@" "$arg"; shift ;;
-    esac
-  done
-  obj_suffix=`echo "$object" | sed 's/^.*\././'`
-  touch "$tmpdepfile"
-  ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@"
-  rm -f "$depfile"
-  # makedepend may prepend the VPATH from the source file name to the object.
-  # No need to regex-escape $object, excess matching of '.' is harmless.
-  sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile"
-  sed '1,2d' "$tmpdepfile" | tr ' ' '
-' | \
-## Some versions of the HPUX 10.20 sed can't process this invocation
-## correctly.  Breaking it into two sed invocations is a workaround.
-    sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
-  rm -f "$tmpdepfile" "$tmpdepfile".bak
-  ;;
-
-cpp)
-  # Important note: in order to support this mode, a compiler *must*
-  # always write the preprocessed file to stdout.
-  "$@" || exit $?
-
-  # Remove the call to Libtool.
-  if test "$libtool" = yes; then
-    while test "X$1" != 'X--mode=compile'; do
-      shift
-    done
-    shift
-  fi
-
-  # Remove `-o $object'.
-  IFS=" "
-  for arg
-  do
-    case $arg in
-    -o)
-      shift
-      ;;
-    $object)
-      shift
-      ;;
-    *)
-      set fnord "$@" "$arg"
-      shift # fnord
-      shift # $arg
-      ;;
-    esac
-  done
-
-  "$@" -E |
-    sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \
-       -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' |
-    sed '$ s: \\$::' > "$tmpdepfile"
-  rm -f "$depfile"
-  echo "$object : \\" > "$depfile"
-  cat < "$tmpdepfile" >> "$depfile"
-  sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile"
-  rm -f "$tmpdepfile"
-  ;;
-
-msvisualcpp)
-  # Important note: in order to support this mode, a compiler *must*
-  # always write the preprocessed file to stdout.
-  "$@" || exit $?
-
-  # Remove the call to Libtool.
-  if test "$libtool" = yes; then
-    while test "X$1" != 'X--mode=compile'; do
-      shift
-    done
-    shift
-  fi
-
-  IFS=" "
-  for arg
-  do
-    case "$arg" in
-    -o)
-      shift
-      ;;
-    $object)
-      shift
-      ;;
-    "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI")
-	set fnord "$@"
-	shift
-	shift
-	;;
-    *)
-	set fnord "$@" "$arg"
-	shift
-	shift
-	;;
-    esac
-  done
-  "$@" -E 2>/dev/null |
-  sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile"
-  rm -f "$depfile"
-  echo "$object : \\" > "$depfile"
-  sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::	\1 \\:p' >> "$depfile"
-  echo "	" >> "$depfile"
-  sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile"
-  rm -f "$tmpdepfile"
-  ;;
-
-msvcmsys)
-  # This case exists only to let depend.m4 do its work.  It works by
-  # looking at the text of this script.  This case will never be run,
-  # since it is checked for above.
-  exit 1
-  ;;
-
-none)
-  exec "$@"
-  ;;
-
-*)
-  echo "Unknown depmode $depmode" 1>&2
-  exit 1
-  ;;
-esac
-
-exit 0
-
-# Local Variables:
-# mode: shell-script
-# sh-indentation: 2
-# eval: (add-hook 'write-file-hooks 'time-stamp)
-# time-stamp-start: "scriptversion="
-# time-stamp-format: "%:y-%02m-%02d.%02H"
-# time-stamp-time-zone: "UTC"
-# time-stamp-end: "; # UTC"
-# End:
diff --git a/trinity-plugins/parafly-code/install-sh b/trinity-plugins/parafly-code/install-sh
deleted file mode 100755
index a9244eb..0000000
--- a/trinity-plugins/parafly-code/install-sh
+++ /dev/null
@@ -1,527 +0,0 @@
-#!/bin/sh
-# install - install a program, script, or datafile
-
-scriptversion=2011-01-19.21; # UTC
-
-# This originates from X11R5 (mit/util/scripts/install.sh), which was
-# later released in X11R6 (xc/config/util/install.sh) with the
-# following copyright and license.
-#
-# Copyright (C) 1994 X Consortium
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to
-# deal in the Software without restriction, including without limitation the
-# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-# sell copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-#
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
-# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
-# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
-# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-#
-# Except as contained in this notice, the name of the X Consortium shall not
-# be used in advertising or otherwise to promote the sale, use or other deal-
-# ings in this Software without prior written authorization from the X Consor-
-# tium.
-#
-#
-# FSF changes to this file are in the public domain.
-#
-# Calling this script install-sh is preferred over install.sh, to prevent
-# `make' implicit rules from creating a file called install from it
-# when there is no Makefile.
-#
-# This script is compatible with the BSD install script, but was written
-# from scratch.
-
-nl='
-'
-IFS=" ""	$nl"
-
-# set DOITPROG to echo to test this script
-
-# Don't use :- since 4.3BSD and earlier shells don't like it.
-doit=${DOITPROG-}
-if test -z "$doit"; then
-  doit_exec=exec
-else
-  doit_exec=$doit
-fi
-
-# Put in absolute file names if you don't have them in your path;
-# or use environment vars.
-
-chgrpprog=${CHGRPPROG-chgrp}
-chmodprog=${CHMODPROG-chmod}
-chownprog=${CHOWNPROG-chown}
-cmpprog=${CMPPROG-cmp}
-cpprog=${CPPROG-cp}
-mkdirprog=${MKDIRPROG-mkdir}
-mvprog=${MVPROG-mv}
-rmprog=${RMPROG-rm}
-stripprog=${STRIPPROG-strip}
-
-posix_glob='?'
-initialize_posix_glob='
-  test "$posix_glob" != "?" || {
-    if (set -f) 2>/dev/null; then
-      posix_glob=
-    else
-      posix_glob=:
-    fi
-  }
-'
-
-posix_mkdir=
-
-# Desired mode of installed file.
-mode=0755
-
-chgrpcmd=
-chmodcmd=$chmodprog
-chowncmd=
-mvcmd=$mvprog
-rmcmd="$rmprog -f"
-stripcmd=
-
-src=
-dst=
-dir_arg=
-dst_arg=
-
-copy_on_change=false
-no_target_directory=
-
-usage="\
-Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
-   or: $0 [OPTION]... SRCFILES... DIRECTORY
-   or: $0 [OPTION]... -t DIRECTORY SRCFILES...
-   or: $0 [OPTION]... -d DIRECTORIES...
-
-In the 1st form, copy SRCFILE to DSTFILE.
-In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
-In the 4th, create DIRECTORIES.
-
-Options:
-     --help     display this help and exit.
-     --version  display version info and exit.
-
-  -c            (ignored)
-  -C            install only if different (preserve the last data modification time)
-  -d            create directories instead of installing files.
-  -g GROUP      $chgrpprog installed files to GROUP.
-  -m MODE       $chmodprog installed files to MODE.
-  -o USER       $chownprog installed files to USER.
-  -s            $stripprog installed files.
-  -t DIRECTORY  install into DIRECTORY.
-  -T            report an error if DSTFILE is a directory.
-
-Environment variables override the default commands:
-  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
-  RMPROG STRIPPROG
-"
-
-while test $# -ne 0; do
-  case $1 in
-    -c) ;;
-
-    -C) copy_on_change=true;;
-
-    -d) dir_arg=true;;
-
-    -g) chgrpcmd="$chgrpprog $2"
-	shift;;
-
-    --help) echo "$usage"; exit $?;;
-
-    -m) mode=$2
-	case $mode in
-	  *' '* | *'	'* | *'
-'*	  | *'*'* | *'?'* | *'['*)
-	    echo "$0: invalid mode: $mode" >&2
-	    exit 1;;
-	esac
-	shift;;
-
-    -o) chowncmd="$chownprog $2"
-	shift;;
-
-    -s) stripcmd=$stripprog;;
-
-    -t) dst_arg=$2
-	# Protect names problematic for `test' and other utilities.
-	case $dst_arg in
-	  -* | [=\(\)!]) dst_arg=./$dst_arg;;
-	esac
-	shift;;
-
-    -T) no_target_directory=true;;
-
-    --version) echo "$0 $scriptversion"; exit $?;;
-
-    --)	shift
-	break;;
-
-    -*)	echo "$0: invalid option: $1" >&2
-	exit 1;;
-
-    *)  break;;
-  esac
-  shift
-done
-
-if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
-  # When -d is used, all remaining arguments are directories to create.
-  # When -t is used, the destination is already specified.
-  # Otherwise, the last argument is the destination.  Remove it from $@.
-  for arg
-  do
-    if test -n "$dst_arg"; then
-      # $@ is not empty: it contains at least $arg.
-      set fnord "$@" "$dst_arg"
-      shift # fnord
-    fi
-    shift # arg
-    dst_arg=$arg
-    # Protect names problematic for `test' and other utilities.
-    case $dst_arg in
-      -* | [=\(\)!]) dst_arg=./$dst_arg;;
-    esac
-  done
-fi
-
-if test $# -eq 0; then
-  if test -z "$dir_arg"; then
-    echo "$0: no input file specified." >&2
-    exit 1
-  fi
-  # It's OK to call `install-sh -d' without argument.
-  # This can happen when creating conditional directories.
-  exit 0
-fi
-
-if test -z "$dir_arg"; then
-  do_exit='(exit $ret); exit $ret'
-  trap "ret=129; $do_exit" 1
-  trap "ret=130; $do_exit" 2
-  trap "ret=141; $do_exit" 13
-  trap "ret=143; $do_exit" 15
-
-  # Set umask so as not to create temps with too-generous modes.
-  # However, 'strip' requires both read and write access to temps.
-  case $mode in
-    # Optimize common cases.
-    *644) cp_umask=133;;
-    *755) cp_umask=22;;
-
-    *[0-7])
-      if test -z "$stripcmd"; then
-	u_plus_rw=
-      else
-	u_plus_rw='% 200'
-      fi
-      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
-    *)
-      if test -z "$stripcmd"; then
-	u_plus_rw=
-      else
-	u_plus_rw=,u+rw
-      fi
-      cp_umask=$mode$u_plus_rw;;
-  esac
-fi
-
-for src
-do
-  # Protect names problematic for `test' and other utilities.
-  case $src in
-    -* | [=\(\)!]) src=./$src;;
-  esac
-
-  if test -n "$dir_arg"; then
-    dst=$src
-    dstdir=$dst
-    test -d "$dstdir"
-    dstdir_status=$?
-  else
-
-    # Waiting for this to be detected by the "$cpprog $src $dsttmp" command
-    # might cause directories to be created, which would be especially bad
-    # if $src (and thus $dsttmp) contains '*'.
-    if test ! -f "$src" && test ! -d "$src"; then
-      echo "$0: $src does not exist." >&2
-      exit 1
-    fi
-
-    if test -z "$dst_arg"; then
-      echo "$0: no destination specified." >&2
-      exit 1
-    fi
-    dst=$dst_arg
-
-    # If destination is a directory, append the input filename; won't work
-    # if double slashes aren't ignored.
-    if test -d "$dst"; then
-      if test -n "$no_target_directory"; then
-	echo "$0: $dst_arg: Is a directory" >&2
-	exit 1
-      fi
-      dstdir=$dst
-      dst=$dstdir/`basename "$src"`
-      dstdir_status=0
-    else
-      # Prefer dirname, but fall back on a substitute if dirname fails.
-      dstdir=`
-	(dirname "$dst") 2>/dev/null ||
-	expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
-	     X"$dst" : 'X\(//\)[^/]' \| \
-	     X"$dst" : 'X\(//\)$' \| \
-	     X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
-	echo X"$dst" |
-	    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
-		   s//\1/
-		   q
-		 }
-		 /^X\(\/\/\)[^/].*/{
-		   s//\1/
-		   q
-		 }
-		 /^X\(\/\/\)$/{
-		   s//\1/
-		   q
-		 }
-		 /^X\(\/\).*/{
-		   s//\1/
-		   q
-		 }
-		 s/.*/./; q'
-      `
-
-      test -d "$dstdir"
-      dstdir_status=$?
-    fi
-  fi
-
-  obsolete_mkdir_used=false
-
-  if test $dstdir_status != 0; then
-    case $posix_mkdir in
-      '')
-	# Create intermediate dirs using mode 755 as modified by the umask.
-	# This is like FreeBSD 'install' as of 1997-10-28.
-	umask=`umask`
-	case $stripcmd.$umask in
-	  # Optimize common cases.
-	  *[2367][2367]) mkdir_umask=$umask;;
-	  .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
-
-	  *[0-7])
-	    mkdir_umask=`expr $umask + 22 \
-	      - $umask % 100 % 40 + $umask % 20 \
-	      - $umask % 10 % 4 + $umask % 2
-	    `;;
-	  *) mkdir_umask=$umask,go-w;;
-	esac
-
-	# With -d, create the new directory with the user-specified mode.
-	# Otherwise, rely on $mkdir_umask.
-	if test -n "$dir_arg"; then
-	  mkdir_mode=-m$mode
-	else
-	  mkdir_mode=
-	fi
-
-	posix_mkdir=false
-	case $umask in
-	  *[123567][0-7][0-7])
-	    # POSIX mkdir -p sets u+wx bits regardless of umask, which
-	    # is incompatible with FreeBSD 'install' when (umask & 300) != 0.
-	    ;;
-	  *)
-	    tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
-	    trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
-
-	    if (umask $mkdir_umask &&
-		exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
-	    then
-	      if test -z "$dir_arg" || {
-		   # Check for POSIX incompatibilities with -m.
-		   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
-		   # other-writeable bit of parent directory when it shouldn't.
-		   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
-		   ls_ld_tmpdir=`ls -ld "$tmpdir"`
-		   case $ls_ld_tmpdir in
-		     d????-?r-*) different_mode=700;;
-		     d????-?--*) different_mode=755;;
-		     *) false;;
-		   esac &&
-		   $mkdirprog -m$different_mode -p -- "$tmpdir" && {
-		     ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
-		     test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
-		   }
-		 }
-	      then posix_mkdir=:
-	      fi
-	      rmdir "$tmpdir/d" "$tmpdir"
-	    else
-	      # Remove any dirs left behind by ancient mkdir implementations.
-	      rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
-	    fi
-	    trap '' 0;;
-	esac;;
-    esac
-
-    if
-      $posix_mkdir && (
-	umask $mkdir_umask &&
-	$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
-      )
-    then :
-    else
-
-      # The umask is ridiculous, or mkdir does not conform to POSIX,
-      # or it failed possibly due to a race condition.  Create the
-      # directory the slow way, step by step, checking for races as we go.
-
-      case $dstdir in
-	/*) prefix='/';;
-	[-=\(\)!]*) prefix='./';;
-	*)  prefix='';;
-      esac
-
-      eval "$initialize_posix_glob"
-
-      oIFS=$IFS
-      IFS=/
-      $posix_glob set -f
-      set fnord $dstdir
-      shift
-      $posix_glob set +f
-      IFS=$oIFS
-
-      prefixes=
-
-      for d
-      do
-	test X"$d" = X && continue
-
-	prefix=$prefix$d
-	if test -d "$prefix"; then
-	  prefixes=
-	else
-	  if $posix_mkdir; then
-	    (umask=$mkdir_umask &&
-	     $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
-	    # Don't fail if two instances are running concurrently.
-	    test -d "$prefix" || exit 1
-	  else
-	    case $prefix in
-	      *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
-	      *) qprefix=$prefix;;
-	    esac
-	    prefixes="$prefixes '$qprefix'"
-	  fi
-	fi
-	prefix=$prefix/
-      done
-
-      if test -n "$prefixes"; then
-	# Don't fail if two instances are running concurrently.
-	(umask $mkdir_umask &&
-	 eval "\$doit_exec \$mkdirprog $prefixes") ||
-	  test -d "$dstdir" || exit 1
-	obsolete_mkdir_used=true
-      fi
-    fi
-  fi
-
-  if test -n "$dir_arg"; then
-    { test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
-    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
-    { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
-      test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
-  else
-
-    # Make a couple of temp file names in the proper directory.
-    dsttmp=$dstdir/_inst.$$_
-    rmtmp=$dstdir/_rm.$$_
-
-    # Trap to clean up those temp files at exit.
-    trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
-
-    # Copy the file name to the temp name.
-    (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
-
-    # and set any options; do chmod last to preserve setuid bits.
-    #
-    # If any of these fail, we abort the whole thing.  If we want to
-    # ignore errors from any of these, just make sure not to ignore
-    # errors from the above "$doit $cpprog $src $dsttmp" command.
-    #
-    { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
-    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
-    { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
-    { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
-
-    # If -C, don't bother to copy if it wouldn't change the file.
-    if $copy_on_change &&
-       old=`LC_ALL=C ls -dlL "$dst"	2>/dev/null` &&
-       new=`LC_ALL=C ls -dlL "$dsttmp"	2>/dev/null` &&
-
-       eval "$initialize_posix_glob" &&
-       $posix_glob set -f &&
-       set X $old && old=:$2:$4:$5:$6 &&
-       set X $new && new=:$2:$4:$5:$6 &&
-       $posix_glob set +f &&
-
-       test "$old" = "$new" &&
-       $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
-    then
-      rm -f "$dsttmp"
-    else
-      # Rename the file to the real destination.
-      $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
-
-      # The rename failed, perhaps because mv can't rename something else
-      # to itself, or perhaps because mv is so ancient that it does not
-      # support -f.
-      {
-	# Now remove or move aside any old file at destination location.
-	# We try this two ways since rm can't unlink itself on some
-	# systems and the destination file might be busy for other
-	# reasons.  In this case, the final cleanup might fail but the new
-	# file should still install successfully.
-	{
-	  test ! -f "$dst" ||
-	  $doit $rmcmd -f "$dst" 2>/dev/null ||
-	  { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
-	    { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
-	  } ||
-	  { echo "$0: cannot unlink or rename $dst" >&2
-	    (exit 1); exit 1
-	  }
-	} &&
-
-	# Now rename the file to the real destination.
-	$doit $mvcmd "$dsttmp" "$dst"
-      }
-    fi || exit 1
-
-    trap '' 0
-  fi
-done
-
-# Local variables:
-# eval: (add-hook 'write-file-hooks 'time-stamp)
-# time-stamp-start: "scriptversion="
-# time-stamp-format: "%:y-%02m-%02d.%02H"
-# time-stamp-time-zone: "UTC"
-# time-stamp-end: "; # UTC"
-# End:
diff --git a/trinity-plugins/parafly-code/missing b/trinity-plugins/parafly-code/missing
deleted file mode 100755
index 86a8fc3..0000000
--- a/trinity-plugins/parafly-code/missing
+++ /dev/null
@@ -1,331 +0,0 @@
-#! /bin/sh
-# Common stub for a few missing GNU programs while installing.
-
-scriptversion=2012-01-06.13; # UTC
-
-# Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006,
-# 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
-# Originally by Fran,cois Pinard <pinard at iro.umontreal.ca>, 1996.
-
-# 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, 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, see <http://www.gnu.org/licenses/>.
-
-# As a special exception to the GNU General Public License, if you
-# distribute this file as part of a program that contains a
-# configuration script generated by Autoconf, you may include it under
-# the same distribution terms that you use for the rest of that program.
-
-if test $# -eq 0; then
-  echo 1>&2 "Try \`$0 --help' for more information"
-  exit 1
-fi
-
-run=:
-sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p'
-sed_minuso='s/.* -o \([^ ]*\).*/\1/p'
-
-# In the cases where this matters, `missing' is being run in the
-# srcdir already.
-if test -f configure.ac; then
-  configure_ac=configure.ac
-else
-  configure_ac=configure.in
-fi
-
-msg="missing on your system"
-
-case $1 in
---run)
-  # Try to run requested program, and just exit if it succeeds.
-  run=
-  shift
-  "$@" && exit 0
-  # Exit code 63 means version mismatch.  This often happens
-  # when the user try to use an ancient version of a tool on
-  # a file that requires a minimum version.  In this case we
-  # we should proceed has if the program had been absent, or
-  # if --run hadn't been passed.
-  if test $? = 63; then
-    run=:
-    msg="probably too old"
-  fi
-  ;;
-
-  -h|--h|--he|--hel|--help)
-    echo "\
-$0 [OPTION]... PROGRAM [ARGUMENT]...
-
-Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an
-error status if there is no known handling for PROGRAM.
-
-Options:
-  -h, --help      display this help and exit
-  -v, --version   output version information and exit
-  --run           try to run the given command, and emulate it if it fails
-
-Supported PROGRAM values:
-  aclocal      touch file \`aclocal.m4'
-  autoconf     touch file \`configure'
-  autoheader   touch file \`config.h.in'
-  autom4te     touch the output file, or create a stub one
-  automake     touch all \`Makefile.in' files
-  bison        create \`y.tab.[ch]', if possible, from existing .[ch]
-  flex         create \`lex.yy.c', if possible, from existing .c
-  help2man     touch the output file
-  lex          create \`lex.yy.c', if possible, from existing .c
-  makeinfo     touch the output file
-  yacc         create \`y.tab.[ch]', if possible, from existing .[ch]
-
-Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and
-\`g' are ignored when checking the name.
-
-Send bug reports to <bug-automake at gnu.org>."
-    exit $?
-    ;;
-
-  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)
-    echo "missing $scriptversion (GNU Automake)"
-    exit $?
-    ;;
-
-  -*)
-    echo 1>&2 "$0: Unknown \`$1' option"
-    echo 1>&2 "Try \`$0 --help' for more information"
-    exit 1
-    ;;
-
-esac
-
-# normalize program name to check for.
-program=`echo "$1" | sed '
-  s/^gnu-//; t
-  s/^gnu//; t
-  s/^g//; t'`
-
-# Now exit if we have it, but it failed.  Also exit now if we
-# don't have it and --version was passed (most likely to detect
-# the program).  This is about non-GNU programs, so use $1 not
-# $program.
-case $1 in
-  lex*|yacc*)
-    # Not GNU programs, they don't have --version.
-    ;;
-
-  *)
-    if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
-       # We have it, but it failed.
-       exit 1
-    elif test "x$2" = "x--version" || test "x$2" = "x--help"; then
-       # Could not run --version or --help.  This is probably someone
-       # running `$TOOL --version' or `$TOOL --help' to check whether
-       # $TOOL exists and not knowing $TOOL uses missing.
-       exit 1
-    fi
-    ;;
-esac
-
-# If it does not exist, or fails to run (possibly an outdated version),
-# try to emulate it.
-case $program in
-  aclocal*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-         you modified \`acinclude.m4' or \`${configure_ac}'.  You might want
-         to install the \`Automake' and \`Perl' packages.  Grab them from
-         any GNU archive site."
-    touch aclocal.m4
-    ;;
-
-  autoconf*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-         you modified \`${configure_ac}'.  You might want to install the
-         \`Autoconf' and \`GNU m4' packages.  Grab them from any GNU
-         archive site."
-    touch configure
-    ;;
-
-  autoheader*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-         you modified \`acconfig.h' or \`${configure_ac}'.  You might want
-         to install the \`Autoconf' and \`GNU m4' packages.  Grab them
-         from any GNU archive site."
-    files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}`
-    test -z "$files" && files="config.h"
-    touch_files=
-    for f in $files; do
-      case $f in
-      *:*) touch_files="$touch_files "`echo "$f" |
-				       sed -e 's/^[^:]*://' -e 's/:.*//'`;;
-      *) touch_files="$touch_files $f.in";;
-      esac
-    done
-    touch $touch_files
-    ;;
-
-  automake*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-         you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'.
-         You might want to install the \`Automake' and \`Perl' packages.
-         Grab them from any GNU archive site."
-    find . -type f -name Makefile.am -print |
-	   sed 's/\.am$/.in/' |
-	   while read f; do touch "$f"; done
-    ;;
-
-  autom4te*)
-    echo 1>&2 "\
-WARNING: \`$1' is needed, but is $msg.
-         You might have modified some files without having the
-         proper tools for further handling them.
-         You can get \`$1' as part of \`Autoconf' from any GNU
-         archive site."
-
-    file=`echo "$*" | sed -n "$sed_output"`
-    test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
-    if test -f "$file"; then
-	touch $file
-    else
-	test -z "$file" || exec >$file
-	echo "#! /bin/sh"
-	echo "# Created by GNU Automake missing as a replacement of"
-	echo "#  $ $@"
-	echo "exit 0"
-	chmod +x $file
-	exit 1
-    fi
-    ;;
-
-  bison*|yacc*)
-    echo 1>&2 "\
-WARNING: \`$1' $msg.  You should only need it if
-         you modified a \`.y' file.  You may need the \`Bison' package
-         in order for those modifications to take effect.  You can get
-         \`Bison' from any GNU archive site."
-    rm -f y.tab.c y.tab.h
-    if test $# -ne 1; then
-        eval LASTARG=\${$#}
-	case $LASTARG in
-	*.y)
-	    SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'`
-	    if test -f "$SRCFILE"; then
-	         cp "$SRCFILE" y.tab.c
-	    fi
-	    SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'`
-	    if test -f "$SRCFILE"; then
-	         cp "$SRCFILE" y.tab.h
-	    fi
-	  ;;
-	esac
-    fi
-    if test ! -f y.tab.h; then
-	echo >y.tab.h
-    fi
-    if test ! -f y.tab.c; then
-	echo 'main() { return 0; }' >y.tab.c
-    fi
-    ;;
-
-  lex*|flex*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-         you modified a \`.l' file.  You may need the \`Flex' package
-         in order for those modifications to take effect.  You can get
-         \`Flex' from any GNU archive site."
-    rm -f lex.yy.c
-    if test $# -ne 1; then
-        eval LASTARG=\${$#}
-	case $LASTARG in
-	*.l)
-	    SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'`
-	    if test -f "$SRCFILE"; then
-	         cp "$SRCFILE" lex.yy.c
-	    fi
-	  ;;
-	esac
-    fi
-    if test ! -f lex.yy.c; then
-	echo 'main() { return 0; }' >lex.yy.c
-    fi
-    ;;
-
-  help2man*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-	 you modified a dependency of a manual page.  You may need the
-	 \`Help2man' package in order for those modifications to take
-	 effect.  You can get \`Help2man' from any GNU archive site."
-
-    file=`echo "$*" | sed -n "$sed_output"`
-    test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
-    if test -f "$file"; then
-	touch $file
-    else
-	test -z "$file" || exec >$file
-	echo ".ab help2man is required to generate this page"
-	exit $?
-    fi
-    ;;
-
-  makeinfo*)
-    echo 1>&2 "\
-WARNING: \`$1' is $msg.  You should only need it if
-         you modified a \`.texi' or \`.texinfo' file, or any other file
-         indirectly affecting the aspect of the manual.  The spurious
-         call might also be the consequence of using a buggy \`make' (AIX,
-         DU, IRIX).  You might want to install the \`Texinfo' package or
-         the \`GNU make' package.  Grab either from any GNU archive site."
-    # The file to touch is that specified with -o ...
-    file=`echo "$*" | sed -n "$sed_output"`
-    test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
-    if test -z "$file"; then
-      # ... or it is the one specified with @setfilename ...
-      infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'`
-      file=`sed -n '
-	/^@setfilename/{
-	  s/.* \([^ ]*\) *$/\1/
-	  p
-	  q
-	}' $infile`
-      # ... or it is derived from the source name (dir/f.texi becomes f.info)
-      test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info
-    fi
-    # If the file does not exist, the user really needs makeinfo;
-    # let's fail without touching anything.
-    test -f $file || exit 1
-    touch $file
-    ;;
-
-  *)
-    echo 1>&2 "\
-WARNING: \`$1' is needed, and is $msg.
-         You might have modified some files without having the
-         proper tools for further handling them.  Check the \`README' file,
-         it often tells you about the needed prerequisites for installing
-         this package.  You may also peek at any GNU archive site, in case
-         some other package would contain this missing \`$1' program."
-    exit 1
-    ;;
-esac
-
-exit 0
-
-# Local variables:
-# eval: (add-hook 'write-file-hooks 'time-stamp)
-# time-stamp-start: "scriptversion="
-# time-stamp-format: "%:y-%02m-%02d.%02H"
-# time-stamp-time-zone: "UTC"
-# time-stamp-end: "; # UTC"
-# End:
diff --git a/trinity-plugins/parafly-code/src/Makefile.am b/trinity-plugins/parafly-code/src/Makefile.am
deleted file mode 100644
index 46252a4..0000000
--- a/trinity-plugins/parafly-code/src/Makefile.am
+++ /dev/null
@@ -1,6 +0,0 @@
-AUTOMAKE_OPTIONS = foreign
-
-bin_PROGRAMS = ParaFly
-
-ParaFly_SOURCES = ParaFly.cpp argProcessor.cpp
-
diff --git a/trinity-plugins/parafly-code/src/Makefile.in b/trinity-plugins/parafly-code/src/Makefile.in
deleted file mode 100644
index 70b6925..0000000
--- a/trinity-plugins/parafly-code/src/Makefile.in
+++ /dev/null
@@ -1,449 +0,0 @@
-# Makefile.in generated by automake 1.11.1 from Makefile.am.
-# @configure_input@
-
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009  Free Software Foundation,
-# Inc.
-# This Makefile.in is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
-# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
-# PARTICULAR PURPOSE.
-
- at SET_MAKE@
-
-VPATH = @srcdir@
-pkgdatadir = $(datadir)/@PACKAGE@
-pkgincludedir = $(includedir)/@PACKAGE@
-pkglibdir = $(libdir)/@PACKAGE@
-pkglibexecdir = $(libexecdir)/@PACKAGE@
-am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
-install_sh_DATA = $(install_sh) -c -m 644
-install_sh_PROGRAM = $(install_sh) -c
-install_sh_SCRIPT = $(install_sh) -c
-INSTALL_HEADER = $(INSTALL_DATA)
-transform = $(program_transform_name)
-NORMAL_INSTALL = :
-PRE_INSTALL = :
-POST_INSTALL = :
-NORMAL_UNINSTALL = :
-PRE_UNINSTALL = :
-POST_UNINSTALL = :
-bin_PROGRAMS = ParaFly$(EXEEXT)
-subdir = src
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
-ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
-am__aclocal_m4_deps = $(top_srcdir)/configure.ac
-am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
-	$(ACLOCAL_M4)
-mkinstalldirs = $(install_sh) -d
-CONFIG_HEADER = $(top_builddir)/config.h
-CONFIG_CLEAN_FILES =
-CONFIG_CLEAN_VPATH_FILES =
-am__installdirs = "$(DESTDIR)$(bindir)"
-PROGRAMS = $(bin_PROGRAMS)
-am_ParaFly_OBJECTS = ParaFly.$(OBJEXT) argProcessor.$(OBJEXT)
-ParaFly_OBJECTS = $(am_ParaFly_OBJECTS)
-ParaFly_LDADD = $(LDADD)
-DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
-depcomp = $(SHELL) $(top_srcdir)/depcomp
-am__depfiles_maybe = depfiles
-am__mv = mv -f
-CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
-	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
-CXXLD = $(CXX)
-CXXLINK = $(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) \
-	-o $@
-SOURCES = $(ParaFly_SOURCES)
-DIST_SOURCES = $(ParaFly_SOURCES)
-ETAGS = etags
-CTAGS = ctags
-DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
-ACLOCAL = @ACLOCAL@
-AMTAR = @AMTAR@
-AM_CXXFLAGS = @AM_CXXFLAGS@
-AUTOCONF = @AUTOCONF@
-AUTOHEADER = @AUTOHEADER@
-AUTOMAKE = @AUTOMAKE@
-AWK = @AWK@
-CPPFLAGS = @CPPFLAGS@
-CXX = @CXX@
-CXXDEPMODE = @CXXDEPMODE@
-CXXFLAGS = @CXXFLAGS@
-CYGPATH_W = @CYGPATH_W@
-DEFS = @DEFS@
-DEPDIR = @DEPDIR@
-ECHO_C = @ECHO_C@
-ECHO_N = @ECHO_N@
-ECHO_T = @ECHO_T@
-EXEEXT = @EXEEXT@
-INSTALL = @INSTALL@
-INSTALL_DATA = @INSTALL_DATA@
-INSTALL_PROGRAM = @INSTALL_PROGRAM@
-INSTALL_SCRIPT = @INSTALL_SCRIPT@
-INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
-LDFLAGS = @LDFLAGS@
-LIBOBJS = @LIBOBJS@
-LIBS = @LIBS@
-LTLIBOBJS = @LTLIBOBJS@
-MAKEINFO = @MAKEINFO@
-MKDIR_P = @MKDIR_P@
-OBJEXT = @OBJEXT@
-PACKAGE = @PACKAGE@
-PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
-PACKAGE_NAME = @PACKAGE_NAME@
-PACKAGE_STRING = @PACKAGE_STRING@
-PACKAGE_TARNAME = @PACKAGE_TARNAME@
-PACKAGE_VERSION = @PACKAGE_VERSION@
-PATH_SEPARATOR = @PATH_SEPARATOR@
-SET_MAKE = @SET_MAKE@
-SHELL = @SHELL@
-STRIP = @STRIP@
-VERSION = @VERSION@
-abs_builddir = @abs_builddir@
-abs_srcdir = @abs_srcdir@
-abs_top_builddir = @abs_top_builddir@
-abs_top_srcdir = @abs_top_srcdir@
-ac_ct_CXX = @ac_ct_CXX@
-am__include = @am__include@
-am__leading_dot = @am__leading_dot@
-am__quote = @am__quote@
-am__tar = @am__tar@
-am__untar = @am__untar@
-bindir = @bindir@
-build_alias = @build_alias@
-builddir = @builddir@
-datadir = @datadir@
-datarootdir = @datarootdir@
-docdir = @docdir@
-dvidir = @dvidir@
-exec_prefix = @exec_prefix@
-host_alias = @host_alias@
-htmldir = @htmldir@
-includedir = @includedir@
-infodir = @infodir@
-install_sh = @install_sh@
-libdir = @libdir@
-libexecdir = @libexecdir@
-localedir = @localedir@
-localstatedir = @localstatedir@
-mandir = @mandir@
-mkdir_p = @mkdir_p@
-oldincludedir = @oldincludedir@
-pdfdir = @pdfdir@
-prefix = @prefix@
-program_transform_name = @program_transform_name@
-psdir = @psdir@
-sbindir = @sbindir@
-sharedstatedir = @sharedstatedir@
-srcdir = @srcdir@
-sysconfdir = @sysconfdir@
-target_alias = @target_alias@
-top_build_prefix = @top_build_prefix@
-top_builddir = @top_builddir@
-top_srcdir = @top_srcdir@
-AUTOMAKE_OPTIONS = foreign
-ParaFly_SOURCES = ParaFly.cpp argProcessor.cpp
-all: all-am
-
-.SUFFIXES:
-.SUFFIXES: .cpp .o .obj
-$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
-	@for dep in $?; do \
-	  case '$(am__configure_deps)' in \
-	    *$$dep*) \
-	      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
-	        && { if test -f $@; then exit 0; else break; fi; }; \
-	      exit 1;; \
-	  esac; \
-	done; \
-	echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/Makefile'; \
-	$(am__cd) $(top_srcdir) && \
-	  $(AUTOMAKE) --foreign src/Makefile
-.PRECIOUS: Makefile
-Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
-	@case '$?' in \
-	  *config.status*) \
-	    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
-	  *) \
-	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
-	    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
-	esac;
-
-$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
-	cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
-
-$(top_srcdir)/configure:  $(am__configure_deps)
-	cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
-$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
-	cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
-$(am__aclocal_m4_deps):
-install-binPROGRAMS: $(bin_PROGRAMS)
-	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
-	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
-	for p in $$list; do echo "$$p $$p"; done | \
-	sed 's/$(EXEEXT)$$//' | \
-	while read p p1; do if test -f $$p; \
-	  then echo "$$p"; echo "$$p"; else :; fi; \
-	done | \
-	sed -e 'p;s,.*/,,;n;h' -e 's|.*|.|' \
-	    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \
-	sed 'N;N;N;s,\n, ,g' | \
-	$(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \
-	  { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \
-	    if ($$2 == $$4) files[d] = files[d] " " $$1; \
-	    else { print "f", $$3 "/" $$4, $$1; } } \
-	  END { for (d in files) print "f", d, files[d] }' | \
-	while read type dir files; do \
-	    if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \
-	    test -z "$$files" || { \
-	      echo " $(INSTALL_PROGRAM_ENV) $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \
-	      $(INSTALL_PROGRAM_ENV) $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \
-	    } \
-	; done
-
-uninstall-binPROGRAMS:
-	@$(NORMAL_UNINSTALL)
-	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
-	files=`for p in $$list; do echo "$$p"; done | \
-	  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \
-	      -e 's/$$/$(EXEEXT)/' `; \
-	test -n "$$list" || exit 0; \
-	echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \
-	cd "$(DESTDIR)$(bindir)" && rm -f $$files
-
-clean-binPROGRAMS:
-	-test -z "$(bin_PROGRAMS)" || rm -f $(bin_PROGRAMS)
-ParaFly$(EXEEXT): $(ParaFly_OBJECTS) $(ParaFly_DEPENDENCIES) 
-	@rm -f ParaFly$(EXEEXT)
-	$(CXXLINK) $(ParaFly_OBJECTS) $(ParaFly_LDADD) $(LIBS)
-
-mostlyclean-compile:
-	-rm -f *.$(OBJEXT)
-
-distclean-compile:
-	-rm -f *.tab.c
-
- at AMDEP_TRUE@@am__include@ @am__quote at ./$(DEPDIR)/ParaFly.Po at am__quote@
- at AMDEP_TRUE@@am__include@ @am__quote at ./$(DEPDIR)/argProcessor.Po at am__quote@
-
-.cpp.o:
- at am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
- at am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
- at AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
- at AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
- at am__fastdepCXX_FALSE@	$(CXXCOMPILE) -c -o $@ $<
-
-.cpp.obj:
- at am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
- at am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
- at AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
- at AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
- at am__fastdepCXX_FALSE@	$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`
-
-ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
-	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
-	unique=`for i in $$list; do \
-	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
-	  done | \
-	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
-	      END { if (nonempty) { for (i in files) print i; }; }'`; \
-	mkid -fID $$unique
-tags: TAGS
-
-TAGS:  $(HEADERS) $(SOURCES)  $(TAGS_DEPENDENCIES) \
-		$(TAGS_FILES) $(LISP)
-	set x; \
-	here=`pwd`; \
-	list='$(SOURCES) $(HEADERS)  $(LISP) $(TAGS_FILES)'; \
-	unique=`for i in $$list; do \
-	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
-	  done | \
-	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
-	      END { if (nonempty) { for (i in files) print i; }; }'`; \
-	shift; \
-	if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
-	  test -n "$$unique" || unique=$$empty_fix; \
-	  if test $$# -gt 0; then \
-	    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
-	      "$$@" $$unique; \
-	  else \
-	    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
-	      $$unique; \
-	  fi; \
-	fi
-ctags: CTAGS
-CTAGS:  $(HEADERS) $(SOURCES)  $(TAGS_DEPENDENCIES) \
-		$(TAGS_FILES) $(LISP)
-	list='$(SOURCES) $(HEADERS)  $(LISP) $(TAGS_FILES)'; \
-	unique=`for i in $$list; do \
-	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
-	  done | \
-	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
-	      END { if (nonempty) { for (i in files) print i; }; }'`; \
-	test -z "$(CTAGS_ARGS)$$unique" \
-	  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
-	     $$unique
-
-GTAGS:
-	here=`$(am__cd) $(top_builddir) && pwd` \
-	  && $(am__cd) $(top_srcdir) \
-	  && gtags -i $(GTAGS_ARGS) "$$here"
-
-distclean-tags:
-	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
-
-distdir: $(DISTFILES)
-	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
-	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
-	list='$(DISTFILES)'; \
-	  dist_files=`for file in $$list; do echo $$file; done | \
-	  sed -e "s|^$$srcdirstrip/||;t" \
-	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
-	case $$dist_files in \
-	  */*) $(MKDIR_P) `echo "$$dist_files" | \
-			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
-			   sort -u` ;; \
-	esac; \
-	for file in $$dist_files; do \
-	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
-	  if test -d $$d/$$file; then \
-	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
-	    if test -d "$(distdir)/$$file"; then \
-	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
-	    fi; \
-	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
-	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
-	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
-	    fi; \
-	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
-	  else \
-	    test -f "$(distdir)/$$file" \
-	    || cp -p $$d/$$file "$(distdir)/$$file" \
-	    || exit 1; \
-	  fi; \
-	done
-check-am: all-am
-check: check-am
-all-am: Makefile $(PROGRAMS)
-installdirs:
-	for dir in "$(DESTDIR)$(bindir)"; do \
-	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
-	done
-install: install-am
-install-exec: install-exec-am
-install-data: install-data-am
-uninstall: uninstall-am
-
-install-am: all-am
-	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
-
-installcheck: installcheck-am
-install-strip:
-	$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
-	  install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
-	  `test -z '$(STRIP)' || \
-	    echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
-mostlyclean-generic:
-
-clean-generic:
-
-distclean-generic:
-	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
-
-maintainer-clean-generic:
-	@echo "This command is intended for maintainers to use"
-	@echo "it deletes files that may require special tools to rebuild."
-clean: clean-am
-
-clean-am: clean-binPROGRAMS clean-generic mostlyclean-am
-
-distclean: distclean-am
-	-rm -rf ./$(DEPDIR)
-	-rm -f Makefile
-distclean-am: clean-am distclean-compile distclean-generic \
-	distclean-tags
-
-dvi: dvi-am
-
-dvi-am:
-
-html: html-am
-
-html-am:
-
-info: info-am
-
-info-am:
-
-install-data-am:
-
-install-dvi: install-dvi-am
-
-install-dvi-am:
-
-install-exec-am: install-binPROGRAMS
-
-install-html: install-html-am
-
-install-html-am:
-
-install-info: install-info-am
-
-install-info-am:
-
-install-man:
-
-install-pdf: install-pdf-am
-
-install-pdf-am:
-
-install-ps: install-ps-am
-
-install-ps-am:
-
-installcheck-am:
-
-maintainer-clean: maintainer-clean-am
-	-rm -rf ./$(DEPDIR)
-	-rm -f Makefile
-maintainer-clean-am: distclean-am maintainer-clean-generic
-
-mostlyclean: mostlyclean-am
-
-mostlyclean-am: mostlyclean-compile mostlyclean-generic
-
-pdf: pdf-am
-
-pdf-am:
-
-ps: ps-am
-
-ps-am:
-
-uninstall-am: uninstall-binPROGRAMS
-
-.MAKE: install-am install-strip
-
-.PHONY: CTAGS GTAGS all all-am check check-am clean clean-binPROGRAMS \
-	clean-generic ctags distclean distclean-compile \
-	distclean-generic distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-binPROGRAMS \
-	install-data install-data-am install-dvi install-dvi-am \
-	install-exec install-exec-am install-html install-html-am \
-	install-info install-info-am install-man install-pdf \
-	install-pdf-am install-ps install-ps-am install-strip \
-	installcheck installcheck-am installdirs maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-compile \
-	mostlyclean-generic pdf pdf-am ps ps-am tags uninstall \
-	uninstall-am uninstall-binPROGRAMS
-
-
-# Tell versions [3.59,3.63) of GNU make to not export all variables.
-# Otherwise a system limit (for SysV at least) may be exceeded.
-.NOEXPORT:
diff --git a/trinity-plugins/parafly-code/src/ParaFly.cpp b/trinity-plugins/parafly-code/src/ParaFly.cpp
deleted file mode 100644
index fdf1437..0000000
--- a/trinity-plugins/parafly-code/src/ParaFly.cpp
+++ /dev/null
@@ -1,268 +0,0 @@
-#include <iostream>
-#include <string>
-#include <fstream>
-#include <cstdlib>
-#include <sstream>
-#include <omp.h>
-#include <vector>
-#include <map>
-#include <algorithm>
-#include <signal.h>
-#include <sys/wait.h>
-
-#include "argProcessor.hpp"
-
-
-string usage();
-
-
-using namespace std;
-
-
-static int VERBOSE_LEVEL = 0;
-
-int main(int argc, char* argv[]) {
-    
-    /* This program executes  commands in Parallel using C++, the program is a wrapper designed for the orignal Trinity Program
-       for seemless parallel OPENMP execution, Authors of this wrapper are MB Couger (mbcouger(AT Symbol)gmail.com, Matt Stowe mstowe(AT Symbol)okstate.edu*/ 
-    // code modified by bhaas for general cmd-line processing
-
-
-    ArgProcessor args(argc, argv);
-    
-    bool shuffle_flag = false;
-
-
-    if (args.isArgSet("-help") 
-        || ! (args.isArgSet("-c") ) 
-        || ! (args.isArgSet("-CPU") ) 
-        ) {
-        cerr << usage() << endl << endl;
-        return(1);
-    }
-    
-    if (args.isArgSet("-v")) {
-        VERBOSE_LEVEL = 1;
-    }
-    else if (args.isArgSet("-vv")) {
-        VERBOSE_LEVEL = 2;
-    }
-
-    if (args.isArgSet("-shuffle")) {
-        shuffle_flag = true;
-    }
-    
-
-    string commands_file = args.getStringVal("-c");
-    
-    int num_cpus = args.getIntVal("-CPU");
-        
-    
-    string failed_commands_filename = "FailedCommands";
-    if (args.isArgSet("-failed_cmds")) {
-        failed_commands_filename = args.getStringVal("-failed_cmds");
-    }
-    
-    //declare variables start input stream
-    ifstream in;    // Create an input file stream.
-    in.open(commands_file.c_str());  // Use it to read from a file named data.txt.
-    if ( ! in ) {
-        stringstream errstr;
-        errstr << "Error, cannot open file : " << commands_file << endl;
-        cerr << errstr.str();
-        exit(1);
-    }
-    
-
-    // check to see if any commands had completed
-    map<string,bool> previously_completed_commands;
-    bool have_previously_completed_commands = false;
-    
-    ofstream successfully_completed_fh;
-
-    {
-        ifstream prev_completed_fh;
-        stringstream completed_commands_filename_ss;
-        completed_commands_filename_ss << commands_file << ".completed";
-        string completed_commands_filename = completed_commands_filename_ss.str();
-        prev_completed_fh.open(completed_commands_filename.c_str());
-        
-        if (prev_completed_fh) {
-            have_previously_completed_commands = true;
-            
-            string command_line;
-            getline(prev_completed_fh, command_line);
-            while(! prev_completed_fh.eof()) {
-                previously_completed_commands[command_line] = true;
-                getline(prev_completed_fh, command_line);
-            }
-            prev_completed_fh.close();
-        }
-
-        successfully_completed_fh.open(completed_commands_filename.c_str(), ios_base::app); // open for append
-    }
-    
-    long int NumberofCommands;
-    NumberofCommands=0;
-    
-    vector<string> commandsArray;
-
-    string line;
-    getline(in,line);
-    
-    while (! in.eof()) {
-
-        if (have_previously_completed_commands 
-            &&
-            previously_completed_commands.find(line) != previously_completed_commands.end()) {
-            
-            // this command has been run before successfully, not running it again.
-            if (VERBOSE_LEVEL) {
-                cerr << "warning, command: " << line << " has successfully completed from a previous run.  Skipping it here." << endl;
-            }
-            
-            
-        }
-        else {
-            NumberofCommands++;
-            commandsArray.push_back(line);
-        }
-        getline(in,line);
-    }
-
-    if (VERBOSE_LEVEL) {
-        cerr << "Number of Commands: " <<  NumberofCommands << endl;
-    }
-    
-    //Parrell Execution of Individual Commands 
-    vector<string> failedCommands;
-    int num_failed_commands = 0;
-    int num_succeeded_commands = 0;
-
-    if (shuffle_flag) {
-        random_shuffle(commandsArray.begin(), commandsArray.end());
-    }
-
-    omp_set_dynamic(0);
-    omp_set_num_threads(num_cpus);
-
-    #pragma omp parallel for schedule (dynamic)
-    for (long int i=0;i<NumberofCommands;i++) {
-        string command = commandsArray[i];         
-        
-        if (VERBOSE_LEVEL == 2) {
-
-            int thread_no = omp_get_thread_num();
-
-            #pragma omp critical (standard_error)
-            {
-                cerr << "CMD[" << i << "], thread[" << thread_no << "]: " << command << endl;
-            }
-        }
-        
-        int ret = system(command.c_str());
-
-        // exit if child received SIGINT or SIGQUIT
-        if (WIFSIGNALED(ret) &&
-            (WTERMSIG(ret) == SIGINT || WTERMSIG(ret) == SIGQUIT)) {
-            #pragma omp critical (exit_critical)
-            exit(ret); // behavior undefined if exit() called more than once
-        }
-        else if (ret != 0) {
-                        
-            #pragma omp critical (capture_failed_command)
-            {
-                num_failed_commands++;
-                failedCommands.push_back(command);
-            }
-            
-
-            if (VERBOSE_LEVEL == 2) {
-                #pragma omp critical (standard_error)
-                {
-                    cerr << "FAILURE:[" << i << "]  " << command << endl;
-                }
-            }
-
-        }
-        else {
-            #pragma omp critical (report_success)
-            {
-                num_succeeded_commands++;
-            
-                successfully_completed_fh << command << endl;
-            }
-                
-            if (VERBOSE_LEVEL == 2) {
-            #pragma omp critical (standard_error)
-                cerr << "SUCCESS:[" << i << "]  " << command << endl;
-            }
-        }
-        
-        if (VERBOSE_LEVEL == 1) {
-            
-            stringstream ss;
-            ss << "\rsucceeded(" << num_succeeded_commands << ")";
-            if (num_failed_commands > 0) {
-                ss << ", failed(" << num_failed_commands << ")";
-            }
-            int total_executed = num_succeeded_commands + num_failed_commands;
-            float percent_done = (float)total_executed/NumberofCommands * 100;
-            
-            ss << "   " << percent_done << "% completed.    ";
-
-            #pragma omp critical (standard_error)
-            cerr << ss.str();
-        }
-    }
-    
-    successfully_completed_fh.close();
-    
-
-    //ErrorCheckingOut
-    if (num_failed_commands != 0) {
-        ofstream outdata(failed_commands_filename.c_str());
-        for (int t=0;t<num_failed_commands; ++t) {
-            outdata << failedCommands[t]  << endl;
-        }
-        outdata.close();
-        cout << endl << endl << "We are sorry, commands in file: [" << failed_commands_filename << "] failed.  :-( " << endl << endl;
-        
-        exit(1);
-    }
-    else {
-        if (VERBOSE_LEVEL) {
-            cout << endl << endl << "All commands completed successfully. :-)" << endl << endl;
-        }
-        exit(0); // used to be return(0), but sometimes in OMP land this would not exit 0....?!?!
-    }
-    
-}
-
-string usage () {
-
-    stringstream ss;
-
-    ss << endl 
-       << "##########################################################" << endl
-       << "#" << endl
-       << "# Usage: ParaFly (opts)" << endl
-       << "#" << endl
-       << "# Required: " << endl
-       << "#   -c <str>              :filename containing list of bash-style commands to execute." << endl
-       << "#   -CPU <int>            :number_of_threads" << endl
-       << "#" << endl
-       << "# Optional:" << endl
-       << "#   -shuffle              :randomly shuffles the command order. " << endl
-       << "#   -failed_cmds <str>    :filename to capture failed commands.  default(\"FailedCommands\")" << endl
-       << "#   -v                    :simple progress monitoring." << endl
-       << "#   -vv                   :increased verbosity in progress monitoring." << endl
-       << "#" << endl
-       << "##########################################################" << endl << endl;
-    
-    ss << "Note: This process creates a file named based on your commands filename with a .completed extension." << endl
-       << "This enables a resume functionality, where if rerun, only those commands not completed successfully will be reprocessed." << endl << endl;
-
-    return(ss.str());
-}
-
diff --git a/trinity-plugins/parafly-code/src/argProcessor.cpp b/trinity-plugins/parafly-code/src/argProcessor.cpp
deleted file mode 100755
index 4842ac3..0000000
--- a/trinity-plugins/parafly-code/src/argProcessor.cpp
+++ /dev/null
@@ -1,61 +0,0 @@
-#include "argProcessor.hpp"
-#include <stdlib.h>
-// #include <cstdlib>
-
-ArgProcessor::ArgProcessor(int argc, char* argv[]) {
-  
-  for (int i=1; i < argc; i++) {
-	char* arg = argv[i];
-	string myArg (arg);
-	if (arg[0] == '-') { 
-	
-	  argSet[myArg] = true;
-  	  	  
-	  // see if next argument is another arg or value:
-	  if (i != argc-1) {
-		// value:
-		string nextArg (argv[i+1]);
-		argVal[myArg] = nextArg;
-	  }
-	}
-  }
-  
-}
-
-
-bool ArgProcessor::isArgSet(string arg) {
-  
-  map<string,bool>::const_iterator it;
-
-  it = argSet.find(arg);
-  if (it != argSet.end()) {
-	return(true);
-  }
-  else {
-	return(false);
-  }
-}
-
-int ArgProcessor::getIntVal(string arg) {
-  
-  return(atoi(argVal[arg].c_str()));
-  
-}
-
-long ArgProcessor::getLongVal(string arg) {
-  return(atol(argVal[arg].c_str()));
-}
-
-
-float ArgProcessor::getFloatVal(string arg) {
-  
-  return(atof(argVal[arg].c_str()));
-}
-
-
-string ArgProcessor::getStringVal(string arg) {
-  
-  return(argVal[arg]);
-}
-
-
diff --git a/trinity-plugins/parafly-code/src/argProcessor.hpp b/trinity-plugins/parafly-code/src/argProcessor.hpp
deleted file mode 100755
index ac1ed45..0000000
--- a/trinity-plugins/parafly-code/src/argProcessor.hpp
+++ /dev/null
@@ -1,31 +0,0 @@
-#ifndef __argProcessor__
-#define __argProcessor__
-
-#include <map>
-#include <string>
-using namespace std;
-
-class ArgProcessor {
-  
-public:
-  ArgProcessor(int argc, char* argv[]);
-  
-  bool isArgSet(string arg);
-  
-  int getIntVal(string arg);
-  
-  long getLongVal(string arg);
-
-  float getFloatVal(string arg);
-  
-  string getStringVal(string arg);
-  
-private:
-  map<string,bool> argSet;
-  map<string,string> argVal;
-
-};
-
-
-#endif
-
diff --git a/trinity-plugins/parafly-code/stamp-h1 b/trinity-plugins/parafly-code/stamp-h1
deleted file mode 100644
index 4547fe1..0000000
--- a/trinity-plugins/parafly-code/stamp-h1
+++ /dev/null
@@ -1 +0,0 @@
-timestamp for config.h
diff --git a/trinity-plugins/rsem-1.2.19.tar.gz b/trinity-plugins/rsem-1.2.19.tar.gz
deleted file mode 100644
index c591033..0000000
Binary files a/trinity-plugins/rsem-1.2.19.tar.gz and /dev/null differ
diff --git a/util/align_and_estimate_abundance.pl b/util/align_and_estimate_abundance.pl
index b11e243..c4ad94b 100755
--- a/util/align_and_estimate_abundance.pl
+++ b/util/align_and_estimate_abundance.pl
@@ -461,22 +461,22 @@ main: {
     
     if ($aln_method eq 'bowtie') {
         if ($left && $right) {
-            $bowtie_cmd = "bowtie $read_type " . $aligner_params{"${aln_method}_${est_method}"} . " -X $max_ins_size -S -p $thread_count $db_index_name -1 $left -2 $right | samtools view -F 4 -S -b -o $bam_file -";
+            $bowtie_cmd = "set -o pipefail && bowtie $read_type " . $aligner_params{"${aln_method}_${est_method}"} . " -X $max_ins_size -S -p $thread_count $db_index_name -1 $left -2 $right | samtools view -F 4 -S -b -o $bam_file -";
            
         }
         else {
-            $bowtie_cmd = "bowtie $read_type " . $aligner_params{"${aln_method}_${est_method}"} . " -S -p $thread_count $db_index_name $single | samtools view -F 4 -S -b -o $bam_file -";
+            $bowtie_cmd = "set -o pipefail && bowtie $read_type " . $aligner_params{"${aln_method}_${est_method}"} . " -S -p $thread_count $db_index_name $single | samtools view -F 4 -S -b -o $bam_file -";
         }
     }
     elsif ($aln_method eq 'bowtie2') {
         
         if ($left && $right) {
                 
-            $bowtie_cmd = "bowtie2 " . $aligner_params{"${aln_method}_${est_method}"} . " $read_type -X $max_ins_size -x $db_index_name -1 $left -2 $right -p $thread_count | samtools view -F 4 -S -b -o $bam_file -";
+            $bowtie_cmd = "set -o pipefail && bowtie2 " . $aligner_params{"${aln_method}_${est_method}"} . " $read_type -X $max_ins_size -x $db_index_name -1 $left -2 $right -p $thread_count | samtools view -F 4 -S -b -o $bam_file -";
         }
         else {
 
-            $bowtie_cmd = "bowtie2 " . $aligner_params{"${aln_method}_${est_method}"} . " $read_type -x $db_index_name -U $single -p $thread_count | samtools view -F 4 -S -b -o $bam_file -";
+            $bowtie_cmd = "set -o pipefail && bowtie2 " . $aligner_params{"${aln_method}_${est_method}"} . " $read_type -x $db_index_name -U $single -p $thread_count | samtools view -F 4 -S -b -o $bam_file -";
         }
     }
     
diff --git a/util/misc/process_GMAP_alignments_gff3_chimeras_ok.pl b/util/misc/process_GMAP_alignments_gff3_chimeras_ok.pl
index b062823..c396a28 100755
--- a/util/misc/process_GMAP_alignments_gff3_chimeras_ok.pl
+++ b/util/misc/process_GMAP_alignments_gff3_chimeras_ok.pl
@@ -71,7 +71,8 @@ main: {
 	
 	unless (-d "$genomeBaseDir/$genomeDir") {
 		
-        my $cmd = "gmap_build -D $genomeBaseDir -d $genomeBaseDir/$genomeDir -k 13 $genome >&2";
+        #my $cmd = "gmap_build -D $genomeBaseDir -d $genomeBaseDir/$genomeDir -k 13 $genome >&2";
+        my $cmd = "gmap_build -D $genomeBaseDir -T $genomeBaseDir -d $genomeDir -k 13 $genome >&2";
 		&process_cmd($cmd);
 	}
 
diff --git a/util/misc/run_GSNAP.pl b/util/misc/run_GSNAP.pl
index f27b4b8..0681b7d 100755
--- a/util/misc/run_GSNAP.pl
+++ b/util/misc/run_GSNAP.pl
@@ -25,6 +25,7 @@ my $usage = <<__EOUSAGE__;
 #  -G <string>                 GTF file for incorporating reference splice site info.
 #  --CPU <int>                 number of threads (default: 2)
 #  --out_prefix <string>       output prefix (default: gsnap)
+#  --no_sarray                 skip the sarray in the gmap-build 
 #
 #######################################################################
 
@@ -44,7 +45,7 @@ my $help_flag;
 my $num_top_hits = 1;
 my $out_prefix = "gsnap";
 my $gtf_file;
-
+my $no_sarray = "";
 
 &GetOptions( 'h' => \$help_flag,
              'genome=s' => \$genome,
@@ -54,13 +55,17 @@ my $gtf_file;
              'N=i' => \$num_top_hits,
              'out_prefix=s' => \$out_prefix,
              'G=s' => \$gtf_file,
-             );
+             'no_sarray' => \$no_sarray,
+    );
 
 
 unless ($genome && $reads) {
     die $usage;
 }
 
+if ($no_sarray) {
+    $no_sarray = "--no-sarray";
+}
 
 main: {
 	
@@ -73,7 +78,9 @@ main: {
 	
 	unless (-d "$genomeBaseDir/$genomeDir") {
 		
-        my $cmd = "gmap_build -D $genomeBaseDir -d $genomeDir -k 13 $genome >&2";
+        
+
+        my $cmd = "gmap_build -D $genomeBaseDir -d $genomeDir -T $genomeBaseDir -k 13 $no_sarray $genome >&2";
 		&process_cmd($cmd);
 	}
 
@@ -88,21 +95,53 @@ main: {
             &process_cmd($cmd);
 
             $cmd = "iit_store -o $splice_file.iit < $splice_file";
+            &process_cmd($cmd);
         }
     
         $splice_param = "--use-splicing=$splice_file.iit";
     }
     
-
+    
     ## run GMAP
     
-    my $cmd = "gsnap -D $genomeBaseDir -d $genomeDir -A sam -N 1 -w $max_intron -n $num_top_hits -t $CPU $reads $splice_param | samtools view -bS - | samtools sort -@ $CPU - $out_prefix.cSorted";
+    my $gsnap_use_sarray = ($no_sarray) ? "--use-sarray=0" : "";
+
+    $reads = &add_zcat_fifo($reads);
+
+    my $cmd = "bash -c \"set -o pipefail && gsnap -D $genomeBaseDir -d $genomeDir -A sam -N 1 -w $max_intron $gsnap_use_sarray -n $num_top_hits -t $CPU $reads $splice_param | samtools view -bS -F 4 - | samtools sort -@ $CPU - $out_prefix.cSorted \"";
     &process_cmd($cmd);
-    
+
+    if (-s "$out_prefix.cSorted.bam") {
+        $cmd = "samtools index $out_prefix.cSorted.bam";
+        &process_cmd($cmd);
+    }
     
 	exit(0);
 }
 
+
+####
+sub add_zcat_fifo {
+    my ($reads) = @_;
+
+    my @adj_reads_list;
+
+    foreach my $reads_file (split(/\s+/, $reads) ) {
+        if ($reads_file =~ /\.gz$/) {
+            $reads_file = "<(zcat $reads_file)";
+        }
+        push (@adj_reads_list, $reads_file);
+    }
+    
+    my $adj_reads = join(" ", @adj_reads_list);
+
+    return($adj_reads);
+}
+                            
+    
+
+
+
 ####
 sub process_cmd {
 	my ($cmd) = @_;
diff --git a/util/support_scripts/tests.py b/util/support_scripts/tests.py
index 0f24adc..8bb17d3 100644
--- a/util/support_scripts/tests.py
+++ b/util/support_scripts/tests.py
@@ -13,8 +13,7 @@ import time
 # Copy the .gz files in sample_data/test_Trinity_Assembly to current directory
 # Run using nosetests
 MEM_FLAG = "--max_memory 2G"
-TEMP_FILES = ['both.fa', 'bowtie.nameSorted.bam', 'inchworm.K25.L25.fa', 'jellyfish.kmers.fa',
-                  'scaffolding_entries.sam', 'target.fa', 'target.1.ebwt']
+TEMP_FILES = ['both.fa', 'inchworm.K25.L25.fa', 'jellyfish.kmers.fa', 'scaffolding_entries.sam']
 
 
 class TestTrinity(unittest.TestCase):
@@ -35,7 +34,7 @@ class TestTrinity(unittest.TestCase):
         handle = open("trinity_out_dir/Trinity.fasta", "rU")
         seq_count = len([x for x in SeqIO.parse(handle, "fasta")])
         handle.close()
-        self.assertTrue(75 <= seq_count <= 85, msg='Found %s sequences' % seq_count)
+        self.assertTrue(75 <= seq_count <= 90, msg='Found %s sequences' % seq_count)
 
     def test_sample_data_trimmed_and_normalized(self):
         self.trinity(
@@ -72,13 +71,6 @@ class TestTrinity(unittest.TestCase):
         self.trinity("Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --no_run_chrysalis" % MEM_FLAG)
         self.assertEquals(0, len(os.listdir('trinity_out_dir/chrysalis')))
 
-    def test_no_run_butterfly(self):
-        self.trinity("Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --no_run_butterfly" % MEM_FLAG)
-        self.assertTrue(os.path.isfile("trinity_out_dir/chrysalis/butterfly_commands"),
-                            msg="butterfly_commands file does not exist")
-        self.assertFalse(os.path.isfile("trinity_out_dir/butterfly_commands.completed"),
-                            msg="Butterfly appears to have run although no_run_butterfly was specified")
-
     def test_no_run_inchworm(self):
         self.trinity("Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --no_run_inchworm" % MEM_FLAG)
         self.assertFalse(os.path.isfile("trinity_out_dir/inchworm.K25.L25.fa.finished"),
@@ -91,14 +83,14 @@ class TestTrinity(unittest.TestCase):
         self.assertFalse(os.path.isfile("trinity_out_dir/bowtie.nameSorted.bam"),
                             msg="Bowtie appears to have run although no_bowtie was specified")
 
-    def test_no_run_quantifygraph(self):
-        self.trinity("Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --no_run_quantifygraph" % MEM_FLAG)
-        self.assertTrue(os.path.isfile("trinity_out_dir/chrysalis/file_partitioning.ok"),
-                            msg="file_partitioning.ok flag file does not exist")
-        self.assertTrue(os.path.isfile("trinity_out_dir/chrysalis/quantifyGraph_commands"),
-                            msg="quantifyGraph_commands file does not exist")
+    def test_no_distributed_trinity_exec(self):
+        self.trinity("Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --no_distributed_trinity_exec" % MEM_FLAG)
+        self.assertTrue(os.path.isfile("trinity_out_dir/inchworm.K25.L25.fa.finished"),
+                            msg="Inchworm did not appear to run with no_distributed_trinity_exec flag")
+        self.assertTrue(os.path.isfile("trinity_out_dir/jellyfish.1.finished"),
+                            msg="Jellyfish did not appear to run with no_distributed_trinity_exec flag")
         self.assertFalse(os.path.isfile("trinity_out_dir/Trinity.fasta"),
-                            msg="Trinity.fasta created with no_run_quantifygraph")
+                            msg="Trinity.fasta created with no_distributed_trinity_exec")
 
     def test_single_end_with_fa_and_reverse(self):
         self.fq2fa()
@@ -110,12 +102,6 @@ class TestTrinity(unittest.TestCase):
         self.assertTrue(os.path.exists("trinity_test"), msg="Changed output directory but it was not created")
         shutil.rmtree('trinity_test', True)
 
-    def test_chrysalis_output_correctly_changes_dir(self):
-        self.trinity(
-            "Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --chrysalis_output chrysalis_test" % MEM_FLAG)
-        self.assertTrue(os.path.exists("trinity_out_dir/chrysalis_test"),
-                        msg="Changed chrysalis output directory but it was not created")
-
 ### information tests
     def test_cite(self):
         expected = '\n\n* Trinity:\nFull-length transcriptome assembly from RNA-Seq data without a reference genome.\nGrabherr MG, Haas BJ, Yassour M, Levin JZ, Thompson DA, Amit I, Adiconis X, Fan L,\nRaychowdhury R, Zeng Q, Chen Z, Mauceli E, Hacohen N, Gnirke A, Rhind N, di Palma F,\nBirren BW, Nusbaum C, Lindblad-Toh K, Friedman N, Regev A.\nNature Biotechnology 29, 644\xe2\x80\x93652 (2011)\nPaper: http://www.nature.com/nbt/journal/v29/n7/full/nbt.1883.html\nCode:  http://trinityrna [...]
@@ -127,8 +113,9 @@ class TestTrinity(unittest.TestCase):
             subprocess.check_output(["Trinity", "--version"])
             self.fail("Version returned 0 errorcode!")
         except subprocess.CalledProcessError as e:
-            self.assertEqual('Trinity version: BLEEDING_EDGE\n', e.output)
+            #self.assertEqual('Trinity version: BLEEDING_EDGE\n', e.output)
             #self.assertEqual('Trinity version: trinityrnaseq_r20140717\n', e.output)
+            self.assertEqual('Trinity version: Trinity_v2.0.2\n', e.output)
 
 
     def test_show_full_usage_info(self):
@@ -146,11 +133,6 @@ class TestTrinity(unittest.TestCase):
         error = self.get_error("Trinity --seqType fq --single reads.left.fq --SS_lib_type F")
         self.assertTrue("Error, must specify max memory for jellyfish to use, eg.  --max_memory 10G" in error)
 
-    def test_chrysalis_output_must_include_chrysalis(self):
-        error = self.get_error(
-            "Trinity %s --seqType fq --single reads.left.fq --SS_lib_type F --chrysalis_output invalid_name" % MEM_FLAG)
-        self.assertTrue("Error, chrysalis output directory name must include 'chrysalis' in the name" in error)
-
     def test_invalid_option_error(self):
         error = self.get_error("Trinity --squidward")
         self.assertTrue("Error, do not understand options: --squidward" in error)

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-med/trinityrnaseq.git



More information about the debian-med-commit mailing list