(int k, int numHash, BloomFilterDeBruijnGraph graph)
| 197 | } |
| 198 | |
| 199 | public ArrayDeque<Kmer> getPredecessors(int k, int numHash, BloomFilterDeBruijnGraph graph) { |
| 200 | return getPredecessors(k, numHash, graph, 1); |
| 201 | } |
| 202 | |
| 203 | public ArrayDeque<Kmer> getPredecessors(int k, int numHash, BloomFilterDeBruijnGraph graph, float minKmerCov) { |
| 204 | ArrayDeque<Kmer> result = new ArrayDeque<>(4); |
no test coverage detected