Permalink
Switch branches/tags
Nothing to show
Find file
Fetching contributors…
Cannot retrieve contributors at this time
1284 lines (1252 sloc) 55.5 KB
Running Naive-Needleman-Wunsch
#
# Naive-Needleman-Wunsch
# Copyright (C) 2012 Khalique Williams
#
# This file is part of Naive-Needlemann-Wunch.
#
# Naive-Needleman-Wunsch 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.
#
# Naive-Needleman-Wunsch 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 Naive-Needleman-Wunsch. If not, see <http://www.gnu.org/licenses/>.
#
# If you wish to contact the author of Naive-Needleman-Wunsch, you may do so at
# kwillia.pub@gmail.com
#
Naive-Needleman-Wunsch
Creating Test Recognition PDA
<State:NullState>
<State:1>/1
S0_1 Test Succeeded
S0_2 Test Succeeded
Test(1) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),NoRecognitionMode(),0,[' '])
Test(2) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),1,['C'])
Test(3) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),2,['C', 'G'])
-----------------------------------------------------------
Running profile test of hand written run
Ticking 'C'
Position in longest sequence: 0
RecognitionStackEntry(NoRecognitionMode(),NoRecognitionMode(),0,[' '])
Dict{Any,Any}()
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:1>/1
Verdict: Pattern ALIVE
Top of stack is empty, initializing...
RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),1,[' ', 'C'])
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'G'
Position in longest sequence: 1
RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),1,[' ', 'C'])
{'C'=>1}
input: G is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:7>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'C', 'G'])
Checking for core pattern: <State:7> | <State:0>,
Len of target = 2
Len of core pattern = 2
Num of occurences = 1.0
Ticking 'A'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'C', 'G'])
{'C'=>1,'G'=>2}
input: A is the 3 unique character in target
Chose the state key: StateKeyC()
The next state:<State:14>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'C', 'G', 'A'])
Checking for core pattern: <State:14> | <State:0>, <State:7>,
Len of target = 3
Len of core pattern = 3
Num of occurences = 1.0
Ticking 'C'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'C', 'G', 'A'])
{'A'=>3,'C'=>1,'G'=>2}
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:15>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'C', 'G', 'A', 'C'])
Checking for core pattern: <State:15> | <State:0>, <State:7>, <State:14>,
Len of target = 4
Len of core pattern = 3
Num of occurences = 1.3333333333333333
Ticking 'G'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'C', 'G', 'A', 'C'])
{'A'=>3,'C'=>1,'G'=>2}
input: G is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:16>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'C', 'G', 'A', 'C', 'G'])
Checking for core pattern: <State:16> | <State:0>, <State:7>, <State:14>, <State:15>,
Len of target = 5
Len of core pattern = 3
Num of occurences = 1.6666666666666667
Ticking 'A'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'C', 'G', 'A', 'C', 'G'])
{'A'=>3,'C'=>1,'G'=>2}
input: A is the 3 unique character in target
Chose the state key: StateKeyC()
The next state:<State:14>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'C', 'G', 'A', 'C', 'G', 'A'])
Checking for core pattern: <State:14> | <State:0>, <State:7>, <State:14>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:14>,<State:15>,<State:16>,>
Core Pattern String "G-A-C-G-"
Len of target = 6
Len of core pattern = 3
Num of occurences = 2.0
Ticking 'C'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'C', 'G', 'A', 'C', 'G', 'A'])
{'A'=>3,'C'=>1,'G'=>2}
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:15>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'C', 'G', 'A', 'C', 'G', 'A', 'C'])
Len of target = 7
Len of core pattern = 3
Num of occurences = 2.3333333333333335
Ticking 'B'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'C', 'G', 'A', 'C', 'G', 'A', 'C'])
{'A'=>3,'C'=>1,'G'=>2}
input: B is the 4 unique character in target
Chose the state key: StateKeyNull()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'C'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK2(),1,[' ', 'B'])
{'B'=>1}
input: C is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:23>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'B', 'C'])
Checking for core pattern: <State:23> | <State:0>, <State:17>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'B'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'B', 'C'])
{'C'=>2,'B'=>1}
input: B is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:24>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'B', 'C', 'B'])
Checking for core pattern: <State:24> | <State:0>, <State:17>, <State:23>,
Len of target = 3
Len of core pattern = 2
Num of occurences = 1.5
Ticking 'C'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'B', 'C', 'B'])
{'C'=>2,'B'=>1}
input: C is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:25>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'B', 'C', 'B', 'C'])
Checking for core pattern: <State:25> | <State:0>, <State:17>, <State:23>, <State:24>,
Len of target = 4
Len of core pattern = 2
Num of occurences = 2.0
Ticking 'B'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'B', 'C', 'B', 'C'])
{'C'=>2,'B'=>1}
input: B is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:26>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'B', 'C', 'B', 'C', 'B'])
Checking for core pattern: <State:26> | <State:0>, <State:17>, <State:23>, <State:24>, <State:25>,
Len of target = 5
Len of core pattern = 2
Num of occurences = 2.5
Ticking 'G'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'B', 'C', 'B', 'C', 'B'])
{'C'=>2,'B'=>1}
input: G is the 3 unique character in target
Chose the state key: StateKeyCprime()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'G'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK1(),1,[' ', 'G'])
{'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:2>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'G', 'G'])
Checking for core pattern: <State:2> | <State:0>, <State:1>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'G'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'G', 'G'])
{'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:3>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'G', 'G', 'G'])
Checking for core pattern: <State:3> | <State:0>, <State:1>, <State:2>,
Len of target = 3
Len of core pattern = 1
Num of occurences = 3.0
Ticking 'G'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'G', 'G', 'G'])
{'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:2>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'G', 'G', 'G', 'G'])
Checking for core pattern: <State:2> | <State:0>, <State:1>, <State:2>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:2>,<State:3>,>
Core Pattern String "G-G-"
Len of target = 4
Len of core pattern = 1
Num of occurences = 4.0
Ticking 'G'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'G', 'G', 'G', 'G'])
{'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:3>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'G', 'G', 'G', 'G', 'G'])
Len of target = 5
Len of core pattern = 1
Num of occurences = 5.0
Ticking 'A'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'G', 'G', 'G', 'G', 'G'])
{'G'=>1}
input: A is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'B'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK2(),1,[' ', 'A'])
{'A'=>1}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:23>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'A', 'B'])
Checking for core pattern: <State:23> | <State:0>, <State:17>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'A'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:24>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'A', 'B', 'A'])
Checking for core pattern: <State:24> | <State:0>, <State:17>, <State:23>,
Len of target = 3
Len of core pattern = 2
Num of occurences = 1.5
Ticking 'A'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:27>/0
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'A', 'B', 'A', 'A'])
Checking for core pattern: <State:27> | <State:0>, <State:17>, <State:23>, <State:24>,
Len of target = 4
Len of core pattern = 0
Num of occurences = 0
Ticking 'B'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:28>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'A', 'B', 'A', 'A', 'B'])
Checking for core pattern: <State:28> | <State:0>, <State:17>, <State:23>, <State:24>, <State:27>,
Len of target = 5
Len of core pattern = 3
Num of occurences = 1.6666666666666667
Ticking 'A'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'A', 'B', 'A', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:29>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),6,[' ', 'A', 'B', 'A', 'A', 'B', 'A'])
Checking for core pattern: <State:29> | <State:0>, <State:17>, <State:23>, <State:24>, <State:27>, <State:28>,
Len of target = 6
Len of core pattern = 3
Num of occurences = 2.0
Ticking 'A'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),6,[' ', 'A', 'B', 'A', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:27>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),7,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
Checking for core pattern: <State:27> | <State:0>, <State:17>, <State:23>, <State:24>, <State:27>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:27>,<State:28>,<State:29>,>
Core Pattern String "A-B-A-"
Len of target = 7
Len of core pattern = 3
Num of occurences = 2.3333333333333335
Ticking 'B'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),7,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:28>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),8,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A', 'B'])
Len of target = 8
Len of core pattern = 3
Num of occurences = 2.6666666666666665
Ticking 'A'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),8,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:29>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),9,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A', 'B', 'A'])
Len of target = 9
Len of core pattern = 3
Num of occurences = 3.0
Ticking 'A'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),9,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:27>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),10,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
Len of target = 10
Len of core pattern = 3
Num of occurences = 3.3333333333333335
Ticking 'A'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),10,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'B'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK1(),1,[' ', 'A'])
{'A'=>1}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:7>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'A', 'B'])
Checking for core pattern: <State:7> | <State:0>, <State:1>,
Len of target = 2
Len of core pattern = 2
Num of occurences = 1.0
Ticking 'B'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'A', 'B'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:33>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'A', 'B', 'B'])
Checking for core pattern: <State:33> | <State:0>, <State:1>, <State:7>,
Len of target = 3
Len of core pattern = 3
Num of occurences = 1.0
Ticking 'A'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'A', 'B', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:34>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'A', 'B', 'B', 'A'])
Checking for core pattern: <State:34> | <State:0>, <State:1>, <State:7>, <State:33>,
Len of target = 4
Len of core pattern = 3
Num of occurences = 1.3333333333333333
Ticking 'B'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'A', 'B', 'B', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:35>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'A', 'B', 'B', 'A', 'B'])
Checking for core pattern: <State:35> | <State:0>, <State:1>, <State:7>, <State:33>, <State:34>,
Len of target = 5
Len of core pattern = 3
Num of occurences = 1.6666666666666667
Ticking 'B'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'A', 'B', 'B', 'A', 'B'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:33>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'A', 'B', 'B', 'A', 'B', 'B'])
Checking for core pattern: <State:33> | <State:0>, <State:1>, <State:7>, <State:33>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:33>,<State:34>,<State:35>,>
Core Pattern String "B-A-B-"
Len of target = 6
Len of core pattern = 3
Num of occurences = 2.0
Ticking 'A'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'A', 'B', 'B', 'A', 'B', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:34>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
Len of target = 7
Len of core pattern = 3
Num of occurences = 2.3333333333333335
Ticking 'B'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:35>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),8,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
Len of target = 8
Len of core pattern = 3
Num of occurences = 2.6666666666666665
Ticking 'B'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),8,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:33>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),9,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
Len of target = 9
Len of core pattern = 3
Num of occurences = 3.0
Ticking 'A'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),9,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:34>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),10,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
Len of target = 10
Len of core pattern = 3
Num of occurences = 3.3333333333333335
Ticking 'B'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),10,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:35>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),11,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
Len of target = 11
Len of core pattern = 3
Num of occurences = 3.6666666666666665
Ticking 'B'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),11,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:33>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),12,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
Len of target = 12
Len of core pattern = 3
Num of occurences = 4.0
Ticking 'A'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),12,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:34>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),13,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
Len of target = 13
Len of core pattern = 3
Num of occurences = 4.333333333333333
Ticking 'B'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),13,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:35>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),14,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
Len of target = 14
Len of core pattern = 3
Num of occurences = 4.666666666666667
Ticking 'B'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),14,[' ', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:33>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),15,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
Len of target = 15
Len of core pattern = 3
Num of occurences = 5.0
Ticking 'A'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),15,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:34>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),16,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
Len of target = 16
Len of core pattern = 3
Num of occurences = 5.333333333333333
Ticking 'B'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),16,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:35>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),17,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
Len of target = 17
Len of core pattern = 3
Num of occurences = 5.666666666666667
Ticking 'B'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),17,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'B', 'B', 'A', 'B', 'B', 'A', 'B'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:33>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),18,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
Len of target = 18
Len of core pattern = 3
Num of occurences = 6.0
Ticking 'A'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),18,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'B', 'A', 'B', 'B', 'A', 'B', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:34>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),19,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
Len of target = 19
Len of core pattern = 3
Num of occurences = 6.333333333333333
Ticking 'A'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),19,[' ', 'A', 'B', 'B', 'A', 'B', 'B' ... 'A', 'B', 'B', 'A', 'B', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'B'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK2(),1,[' ', 'A'])
{'A'=>1}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:23>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'A', 'B'])
Checking for core pattern: <State:23> | <State:0>, <State:17>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'A'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:24>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'A', 'B', 'A'])
Checking for core pattern: <State:24> | <State:0>, <State:17>, <State:23>,
Len of target = 3
Len of core pattern = 2
Num of occurences = 1.5
Ticking 'A'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:27>/0
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'A', 'B', 'A', 'A'])
Checking for core pattern: <State:27> | <State:0>, <State:17>, <State:23>, <State:24>,
Len of target = 4
Len of core pattern = 0
Num of occurences = 0
Ticking 'B'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:28>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'A', 'B', 'A', 'A', 'B'])
Checking for core pattern: <State:28> | <State:0>, <State:17>, <State:23>, <State:24>, <State:27>,
Len of target = 5
Len of core pattern = 3
Num of occurences = 1.6666666666666667
Ticking 'A'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'A', 'B', 'A', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:29>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),6,[' ', 'A', 'B', 'A', 'A', 'B', 'A'])
Checking for core pattern: <State:29> | <State:0>, <State:17>, <State:23>, <State:24>, <State:27>, <State:28>,
Len of target = 6
Len of core pattern = 3
Num of occurences = 2.0
Ticking 'A'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),6,[' ', 'A', 'B', 'A', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:27>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),7,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
Checking for core pattern: <State:27> | <State:0>, <State:17>, <State:23>, <State:24>, <State:27>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:27>,<State:28>,<State:29>,>
Core Pattern String "A-B-A-"
Len of target = 7
Len of core pattern = 3
Num of occurences = 2.3333333333333335
Ticking 'C'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),7,[' ', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: C is the 3 unique character in target
Chose the state key: StateKeyCprime()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'C'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK1(),1,[' ', 'C'])
{'C'=>1}
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:2>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'C', 'C'])
Checking for core pattern: <State:2> | <State:0>, <State:1>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'G'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'C', 'C'])
{'C'=>1}
input: G is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:4>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'C', 'C', 'G'])
Checking for core pattern: <State:4> | <State:0>, <State:1>, <State:2>,
Len of target = 3
Len of core pattern = 3
Num of occurences = 1.0
Ticking 'C'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'C', 'C', 'G'])
{'C'=>1,'G'=>2}
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:5>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'C', 'C', 'G', 'C'])
Checking for core pattern: <State:5> | <State:0>, <State:1>, <State:2>, <State:4>,
Len of target = 4
Len of core pattern = 3
Num of occurences = 1.3333333333333333
Ticking 'C'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'C', 'C', 'G', 'C'])
{'C'=>1,'G'=>2}
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:6>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'C', 'C', 'G', 'C', 'C'])
Checking for core pattern: <State:6> | <State:0>, <State:1>, <State:2>, <State:4>, <State:5>,
Len of target = 5
Len of core pattern = 3
Num of occurences = 1.6666666666666667
Ticking 'G'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'C', 'C', 'G', 'C', 'C'])
{'C'=>1,'G'=>2}
input: G is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:4>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'C', 'C', 'G', 'C', 'C', 'G'])
Checking for core pattern: <State:4> | <State:0>, <State:1>, <State:2>, <State:4>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:4>,<State:5>,<State:6>,>
Core Pattern String "G-C-C-"
Len of target = 6
Len of core pattern = 3
Num of occurences = 2.0
Ticking 'C'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'C', 'C', 'G', 'C', 'C', 'G'])
{'C'=>1,'G'=>2}
input: C is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:5>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'C', 'C', 'G', 'C', 'C', 'G', 'C'])
Len of target = 7
Len of core pattern = 3
Num of occurences = 2.3333333333333335
Ticking 'A'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'C', 'C', 'G', 'C', 'C', 'G', 'C'])
{'C'=>1,'G'=>2}
input: A is the 3 unique character in target
Chose the state key: StateKeyC()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'A'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK2(),1,[' ', 'A'])
{'A'=>1}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:18>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'A', 'A'])
Checking for core pattern: <State:18> | <State:0>, <State:17>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'B'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'A', 'A'])
{'A'=>1}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:20>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'A', 'A', 'B'])
Checking for core pattern: <State:20> | <State:0>, <State:17>, <State:18>,
Len of target = 3
Len of core pattern = 2
Num of occurences = 1.5
Ticking 'A'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'A', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:21>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'A', 'A', 'B', 'A'])
Checking for core pattern: <State:21> | <State:0>, <State:17>, <State:18>, <State:20>,
Len of target = 4
Len of core pattern = 3
Num of occurences = 1.3333333333333333
Ticking 'A'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'A', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:22>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'A', 'A', 'B', 'A', 'A'])
Checking for core pattern: <State:22> | <State:0>, <State:17>, <State:18>, <State:20>, <State:21>,
Len of target = 5
Len of core pattern = 3
Num of occurences = 1.6666666666666667
Ticking 'B'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'A', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: B is the 2 unique character in target
Chose the state key: StateKeyBprime()
The next state:<State:20>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),6,[' ', 'A', 'A', 'B', 'A', 'A', 'B'])
Checking for core pattern: <State:20> | <State:0>, <State:17>, <State:18>, <State:20>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:20>,<State:21>,<State:22>,>
Core Pattern String "B-A-A-"
Len of target = 6
Len of core pattern = 3
Num of occurences = 2.0
Ticking 'A'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),6,[' ', 'A', 'A', 'B', 'A', 'A', 'B'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:21>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),7,[' ', 'A', 'A', 'B', 'A', 'A', 'B', 'A'])
Len of target = 7
Len of core pattern = 3
Num of occurences = 2.3333333333333335
Ticking 'A'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),7,[' ', 'A', 'A', 'B', 'A', 'A', 'B', 'A'])
{'A'=>1,'B'=>2}
input: A is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:22>/3
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),8,[' ', 'A', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
Len of target = 8
Len of core pattern = 3
Num of occurences = 2.6666666666666665
Ticking 'G'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),8,[' ', 'A', 'A', 'B', 'A', 'A', 'B', 'A', 'A'])
{'A'=>1,'B'=>2}
input: G is the 3 unique character in target
Chose the state key: StateKeyCprime()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'T'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK1(),1,[' ', 'G'])
{'G'=>1}
input: T is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:7>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'G', 'T'])
Checking for core pattern: <State:7> | <State:0>, <State:1>,
Len of target = 2
Len of core pattern = 2
Num of occurences = 1.0
Ticking 'G'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),2,[' ', 'G', 'T'])
{'T'=>2,'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:8>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'G', 'T', 'G'])
Checking for core pattern: <State:8> | <State:0>, <State:1>, <State:7>,
Len of target = 3
Len of core pattern = 2
Num of occurences = 1.5
Ticking 'T'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),3,[' ', 'G', 'T', 'G'])
{'T'=>2,'G'=>1}
input: T is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:9>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'G', 'T', 'G', 'T'])
Checking for core pattern: <State:9> | <State:0>, <State:1>, <State:7>, <State:8>,
Len of target = 4
Len of core pattern = 2
Num of occurences = 2.0
Ticking 'G'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),4,[' ', 'G', 'T', 'G', 'T'])
{'T'=>2,'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:10>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'G', 'T', 'G', 'T', 'G'])
Checking for core pattern: <State:10> | <State:0>, <State:1>, <State:7>, <State:8>, <State:9>,
Len of target = 5
Len of core pattern = 2
Num of occurences = 2.5
Ticking 'T'
Position in longest sequence: 3
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),5,[' ', 'G', 'T', 'G', 'T', 'G'])
{'T'=>2,'G'=>1}
input: T is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:9>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'G', 'T', 'G', 'T', 'G', 'T'])
Checking for core pattern: <State:9> | <State:0>, <State:1>, <State:7>, <State:8>, <State:9>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:9>,<State:10>,>
Core Pattern String "T-G-"
Len of target = 6
Len of core pattern = 2
Num of occurences = 3.0
Ticking 'G'
Position in longest sequence: 4
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),6,[' ', 'G', 'T', 'G', 'T', 'G', 'T'])
{'T'=>2,'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:10>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G'])
Len of target = 7
Len of core pattern = 2
Num of occurences = 3.5
Ticking 'T'
Position in longest sequence: 5
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),7,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G'])
{'T'=>2,'G'=>1}
input: T is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:9>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),8,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T'])
Len of target = 8
Len of core pattern = 2
Num of occurences = 4.0
Ticking 'G'
Position in longest sequence: 6
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),8,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T'])
{'T'=>2,'G'=>1}
input: G is the 1 unique character in target
Chose the state key: StateKeyA()
The next state:<State:10>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),9,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T', 'G'])
Len of target = 9
Len of core pattern = 2
Num of occurences = 4.5
Ticking 'T'
Position in longest sequence: 7
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),9,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T', 'G'])
{'T'=>2,'G'=>1}
input: T is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:9>/2
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),10,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T'])
Len of target = 10
Len of core pattern = 2
Num of occurences = 5.0
Ticking 'T'
Position in longest sequence: 8
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK1(),10,[' ', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T', 'G', 'T'])
{'T'=>2,'G'=>1}
input: T is the 2 unique character in target
Chose the state key: StateKeyB()
The next state:<State:NullState>
Verdict: Pattern broken!
Len of target = 1
Len of core pattern = 1
Num of occurences = 1.0
Ticking 'T'
Position in longest sequence: 9
RecognitionStackEntry(RecognitionModeK1(),RecognitionModeK2(),1,[' ', 'T'])
{'T'=>1}
input: T is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:18>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'T', 'T'])
Checking for core pattern: <State:18> | <State:0>, <State:17>,
Len of target = 2
Len of core pattern = 1
Num of occurences = 2.0
Ticking 'T'
Position in longest sequence: 10
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),2,[' ', 'T', 'T'])
{'T'=>1}
input: T is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:19>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'T', 'T', 'T'])
Checking for core pattern: <State:19> | <State:0>, <State:17>, <State:18>,
Len of target = 3
Len of core pattern = 1
Num of occurences = 3.0
Ticking 'T'
Position in longest sequence: 1
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),3,[' ', 'T', 'T', 'T'])
{'T'=>1}
input: T is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:19>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'T', 'T', 'T', 'T'])
Checking for core pattern: <State:19> | <State:0>, <State:17>, <State:18>, <State:19>,
Found Core Pattern!
Core pattern set!
Core Pattern <<State:19>,>
Core Pattern String "T-"
Len of target = 4
Len of core pattern = 1
Num of occurences = 4.0
Ticking 'T'
Position in longest sequence: 2
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),4,[' ', 'T', 'T', 'T', 'T'])
{'T'=>1}
input: T is the 1 unique character in target
Chose the state key: StateKeyAprime()
The next state:<State:19>/1
Verdict: Pattern ALIVE
Top of stack NOT empty, appending new info to it...
RecognitionStackEntry(RecognitionModeK2(),RecognitionModeK2(),5,[' ', 'T', 'T', 'T', 'T', 'T'])
Len of target = 5
Len of core pattern = 1
Num of occurences = 5.0
Time elasped in milliseconds: 165.357305
----------------------------------------------------------------------------------
Creating Modified Needleman Wunsch System (PDA+NWMatrix+etc)
----------------------------------------------------------------------------------
Running Modified NW...
<State:NullState>
<State:1>/1
S0_1 Test Succeeded
S0_2 Test Succeeded
Test(1) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),NoRecognitionMode(),0,[' '])
Test(2) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),1,['C'])
Test(3) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),2,['C', 'G'])
<State:NullState>
<State:1>/1
S0_1 Test Succeeded
S0_2 Test Succeeded
Test(1) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),NoRecognitionMode(),0,[' '])
Test(2) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),1,['C'])
Test(3) - Top Of Recognition Stack: RecognitionStackEntry(NoRecognitionMode(),RecognitionModeK1(),2,['C', 'G'])
Results For ModifiedNW Pairwise Alignment On Data (GTC vs. GAAAATC) with CustomMatrix1
Alignment Time: (no time avail. as of yet) milliseconds
----------------------------------------------------------------------------------
Creating Naive Needleman Wunsch System (Default Matrix) (NWMatrix+etc)
----------------------------------------------------------------------------------
Running Naive NW...
(i,j) = ( 3 , 7 )
Initial Consensus Seq 1: C
Initial Consensus Seq 2: C
Results For Pairwise Alignment On Data (GTC vs. GAAAATC) with DefaultMatrix
Avg Alignment Time: 100.560557 milliseconds
DNA Alignment:
TC
TC
----------------------------------------------------------------------------------
Creating Naive Needleman Wunsch System (Custom Subst. Matrix 1) (NWMatrix+etc)
----------------------------------------------------------------------------------
Running Naive NW (Custom Subst. Matrix 1)...
(i,j) = ( 3 , 7 )
Initial Consensus Seq 1: C
Initial Consensus Seq 2: C
Results For Pairwise Alignment On Data (GTC vs. GAAAATC) with CustomMatrix1
Avg Alignment Time: 3.961866 milliseconds
DNA Alignment:
TC
TC
----------------------------------------------------------------------------------
Creating Naive Needleman Wunsch System (Linear Gap Model) (Custom Subst. Matrix 1) (NWMatrix+etc)
----------------------------------------------------------------------------------
Running Naive NW On Generated Data(Adamson-300dna, Eve-250dna)...
(i,j) = ( 300 , 350 )
Initial Consensus Seq 1: C
Initial Consensus Seq 2: A
Results For Pairwise Alignment On Generated Data (Adamson-300dna vs. Eve-250dna) With CustomMatrix1
Avg Alignment Time: 276.880878 milliseconds
Highest Time: 276.880878
Lowest Time: 0.065535
Avg Alignment Time Without Highest: NaN
Avg Alignment Time Without Highest + Lowest: -1.8446744073709484e13
DNA Alignment:
AA-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------A--------------A---------------A----------------A-----------------A------------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------A--------------A---------------A----------------A-----------------A------------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------A--------------A---------------A----------------A-----------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------A--------------A---------------A----------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------A--------------A---------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------A--------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------A-------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------A------------C-A-A--A---A----A-----A------A-------A--------A---------A----------A-----------C-A-A--A---A----A-----A------A-------A--------A---------A----------C-A-A--A---A----A-----A------A-------A--------A---------C-A-A--A---A----A-----A------A-------A--------C-A-A--A---A----A-----A------A-------C-A-A--A---A----A-----A------C-A-A--A---A----A-----C-A-A--A---A----C-A-A--A---C-A-A--C-A-CC
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGGGGGGGGGGGGGGGGGGGGGGAAAAAAAAAAAAAAAAAAAAAAAAAAAGGGGGGGAAAAAAA
Number of cells backtracked: 189
Number of ties: 189
Percentage tie: 100.0%
Alignment Stats (#of matches, #of substs, #of indels) = (133,77,1329)
----------------------------------------------------------------------------------
Creating Naive Needleman Wunsch System (Affine Gap Model) (Custom Subst. Matrix 1) (PDA+NWMatrix+etc)
----------------------------------------------------------------------------------
Running Naive NW On Generated Data(Adamson-300dna, Eve-250dna)...
(i,j) = ( 300 , 350 )
Initial Consensus Seq 1: C
Initial Consensus Seq 2: A
^Z
[6]+ Stopped ./run