Description: k-long DNA sequence in the DNA sequence in the frequency of counting problems arise. In the algorithm, a hash function to k-long DNA sequence tags mapped to an integer to the k-long DNA sequence there counting frequency is transformed into an integer repeat count keyword problem, makes it possible to use the classic B tree algorithm to solve k-length DNA sequence of the emergence frequency of counting problems
To Search:
File list (Check if you may need any files):
k-DNA\.classpath
.....\.project
.....\bin\BTree\BTree.class
.....\...\.....\Node.class
.....\...\modBTree\BTreeRun.class
.....\...\........\modBTree.class
.....\...\........\Node.class
.....\...\........\Record.class
.....\...\shuzu\a.class
.....\...\.....\b.class
.....\...\.....\c.class
.....\src\BTree\BTree.java
.....\...\modBTree\BTreeRun.java
.....\...\........\modBTree.java
.....\...\shuzu\a.java
.....\...\.....\b.java
.....\bin\BTree
.....\...\modBTree
.....\...\shuzu
.....\src\BTree
.....\...\modBTree
.....\...\shuzu
.....\bin
.....\src
k-DNA
Download