random chagnes from pat

[mothur.git] / nast.cpp

diff --git a/nast.cpp b/nast.cpp
index b2887523532c6b6bcaef1ca61b2c748a9ad77d14..bf65fa2b46ea319bf54ab74a9696bb9e7b22fafe 100644 (file)
--- a/nast.cpp
+++ b/nast.cpp
@@ -25,8 +25,10 @@ Nast::Nast(Alignment* method, Sequence* cand, Sequence* temp) : alignment(method
        try {
                m = MothurOut::getInstance();
                maxInsertLength = 0;
+       
                pairwiseAlignSeqs();    //      This is part A in Fig. 2 of DeSantis et al.
                regapSequences();               //      This is parts B-F in Fig. 2 of DeSantis et al.
+               
        }
        catch(exception& e) {
                m->errorOut(e, "Nast", "Nast");
@@ -43,7 +45,7 @@ void Nast::pairwiseAlignSeqs(){       //      Here we call one of the pairwise alignment me
 
                string candAln = alignment->getSeqAAln();
                string tempAln = alignment->getSeqBAln();
-
+       
                if(candAln == ""){
 
                        candidateSeq->setPairwise("");
@@ -76,6 +78,7 @@ void Nast::pairwiseAlignSeqs(){       //      Here we call one of the pairwise alignment me
 
                candidateSeq->setPairwise(candAln);                                     //      set the pairwise sequences in the Sequence objects for
                templateSeq->setPairwise(tempAln);                                      //      the candidate and template sequences
+
        }
        catch(exception& e) {
                m->errorOut(e, "Nast", "pairwiseAlignSeqs");
@@ -89,11 +92,6 @@ void Nast::removeExtraGaps(string& candAln, string tempAln, string newTemplateAl
 
 //     here we do steps C-F of Fig. 2 from DeSantis et al.
        try {
-       
-               //cout << candAln << endl;
-               //cout << tempAln << endl;
-               //cout << newTemplateAlign << endl;
-               //cout << endl;
                
                int longAlignmentLength = newTemplateAlign.length();