__my_ref__  SeqLab::SuffixTrie=HASH(0x123ABC)
alph  HASH(0x123ABC){
  symbol  ARRAY(0x123ABC){
    A
    C
    G
    T
  }
  TrashSmb  N
}
SuffixTrie  HASH(0x123ABC){
  A  HASH(0x123ABC){
    A  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  385
      }
      N  HASH(0x123ABC){
        A  __prev_ref__:HASH(0x123ABC)
        C  __prev_ref__:HASH(0x123ABC)
        G  __prev_ref__:HASH(0x123ABC)
        N  __prev_ref__:HASH(0x123ABC)
        T  __prev_ref__:HASH(0x123ABC)
      }
    }
    C  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  194
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    data  HASH(0x123ABC){
    }
    G  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  280
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    N  __prev_ref__:HASH(0x123ABC)
    T  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  177
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
  }
  C  HASH(0x123ABC){
    A  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  287
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    C  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  197
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    data  HASH(0x123ABC){
    }
    G  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  11
        text  PLAIN429{
Untersuche anstelle der lokalen Tupelhufigkeit auch den lokalen
Konservierungsgrad.  Dieser sollte auch mit der Codonposition oszillieren.
Suche zu den ~8000 UUTR-Akzeptor-Sites orthologe Mensch/Maus-Paare und
bestimme den Konservierungsstatus.
Etabliere ein Werkzeug mit mehr diagnostischer Power fr die Erkennung
von CDS.  Die ntige Voraussetzung, Vorliegen typische Codon Preference
wie bei main CDS, scheint gegeben zu sein.

        }
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    N  __prev_ref__:HASH(0x123ABC)
    T  HASH(0x123ABC){
      data  __prev_ref__:HASH(0x123ABC)
      isRed  1
      N  __prev_ref__:HASH(0x123ABC)
    }
  }
  G  HASH(0x123ABC){
    A  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  236
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    C  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  79
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    data  __prev_ref__:HASH(0x123ABC)
    G  HASH(0x123ABC){
      data  __prev_ref__:HASH(0x123ABC)
      isRed  1
      N  __prev_ref__:HASH(0x123ABC)
    }
    isRed  1
    N  __prev_ref__:HASH(0x123ABC)
    T  HASH(0x123ABC){
      data  __prev_ref__:HASH(0x123ABC)
      isRed  1
      N  __prev_ref__:HASH(0x123ABC)
    }
  }
  N  __prev_ref__:HASH(0x123ABC)
  T  HASH(0x123ABC){
    A  HASH(0x123ABC){
      data  HASH(0x123ABC){
        ct  153
      }
      N  __prev_ref__:HASH(0x123ABC)
    }
    C  HASH(0x123ABC){
      data  __prev_ref__:HASH(0x123ABC)
      isRed  1
      N  __prev_ref__:HASH(0x123ABC)
    }
    data  __prev_ref__:HASH(0x123ABC)
    G  HASH(0x123ABC){
      data  __prev_ref__:HASH(0x123ABC)
      isRed  1
      N  __prev_ref__:HASH(0x123ABC)
    }
    isRed  1
    N  __prev_ref__:HASH(0x123ABC)
    T  HASH(0x123ABC){
      data  __prev_ref__:HASH(0x123ABC)
      isRed  1
      N  __prev_ref__:HASH(0x123ABC)
    }
  }
}
switch  HASH(0x123ABC){
  -purify  __undef__
  -strands  0
  -TupleMax  2
  -TupleMin  2
  -upper  1
}
trash  __prev_ref__:HASH(0x123ABC)
