Home
last modified time | relevance | path

Searched refs:hamming (Results 1 – 25 of 1644) sorted by relevance

12345678910>>...66

/dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/rabema/tests/
H A Dgenerate_outputs.sh16 ${RAZERS} -m 10000 -vv -of 4 -ds -i 92 -o gold-adeno-hamming-08.sam adeno-genome.fa reads.fasta
19 ${RAZERS} -vv -of 4 -ds -i 92 -o razers2-adeno-hamming-08.sam adeno-genome.fa reads.fasta
22 ${RAZERS} -vv -of 4 -ds -i 96 -o razers2-adeno-hamming-04.sam adeno-genome.fa reads.fasta
29 ${RABEMA_PREPARE} -i gold-adeno-hamming-08.sam -o gold-adeno-hamming-08.by_qname.sam
30 samtools view -Sb gold-adeno-hamming-08.by_qname.sam > gold-adeno-hamming-08.by_qname.bam
31 samtools sort gold-adeno-hamming-08.by_qname.bam gold-adeno-hamming-08.by_coordinate
32 samtools view gold-adeno-hamming-08.by_coordinate.bam > gold-adeno-hamming-08.by_coordinate.sam
42 …metric hamming -e 8 -o gold-adeno-hamming-08.gsi --reference adeno-genome.fa --in-bam gold-adeno-h…
49 …-metric hamming -e 8 --reference adeno-genome.fa --in-bam razers2-adeno-hamming-08.sam --in-gsi go…
50 …-metric hamming -e 8 --reference adeno-genome.fa --in-bam razers2-adeno-hamming-04.sam --in-gsi go…
/dports/math/octave/octave-6.4.0/scripts/signal/
H A Dhamming.m42 function c = hamming (m, opt) function
74 %!assert (hamming (1), 1)
76 %!assert (hamming (15), flip (hamming (15)), 5*eps)
77 %!assert (hamming (16), flip (hamming (16)), 5*eps)
80 %! A = hamming (N);
83 %!assert (hamming (15), hamming (15, "symmetric"))
84 %!assert (hamming (16)(1:15), hamming (15, "periodic"))
90 %!error hamming ()
91 %!error hamming (0.5)
92 %!error hamming (-1)
[all …]
/dports/lang/mosml/mosml-ver-2.10.1/examples/lexyacc/cl/
H A Dhamming.cl3 hamming :: [Int]
4 hamming = 1 : (map (2* ) hamming || map (3* ) hamming || map (5* ) hamming)
29 hamming = pack{2, 1, merge (map (\n.2*n) hamming)
30 (merge (map (\n.3*n) hamming)
31 (map (\n.5*n) hamming))};
37 in hamming
/dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/hamming-0.1.3/
H A DCargo.toml2 name = "hamming"
7 keywords = ["popcount", "hamming", "bithack"]
8 homepage = "https://github.com/huonw/hamming"
9 repository = "https://github.com/huonw/hamming"
10 documentation = "http://huonw.github.io/hamming/hamming/"
13 Count ones, fast (aka popcount, hamming weight). This provides a
14 performant popcount and bitwise hamming distance for a slice of bytes.
H A DREADME.md1 # `hamming`
3 …hamming.png)](https://travis-ci.org/huonw/hamming) [![Coverage Status](https://coveralls.io/repos/…
11 [Documentation](http://huonw.github.io/hamming/hamming),
12 [crates.io](https://crates.io/crates/hamming).
/dports/biology/py-scikit-bio/scikit-bio-0.5.6/skbio/sequence/tests/
H A Dtest_distance.py25 hamming(seq1, seq2)
28 hamming(seq2, seq1)
36 hamming(seq1, seq2)
43 hamming(seq1, seq2)
49 distance = hamming(seq1, seq2)
58 distance = hamming(seq1, seq2)
66 distance = hamming(seq1, seq2)
74 distance = hamming(seq1, seq2)
82 distance = hamming(seq1, seq2)
97 distance = hamming(seq1, seq2)
[all …]
/dports/devel/stack/stack-2.7.3/_cabal_deps/text-metrics-0.3.0/tests/
H A DMain.hs74 testSwap hamming
75 testPair hamming "karolin" "kathrin" (Just 3)
76 testPair hamming "karolin" "kerstin" (Just 3)
77 testPair hamming "1011101" "1001001" (Just 2)
78 testPair hamming "2173896" "2233796" (Just 3)
79 testPair hamming "toned" "roses" (Just 3)
80 testPair hamming "red" "wax" (Just 3)
82 testPair hamming "a��c" "abc" (Just 1)
84 testPair hamming "lucky" "lucky" (Just 0)
85 testPair hamming "" "" (Just 0)
[all …]
/dports/devel/hs-hpack/hpack-0.34.4/_cabal_deps/text-metrics-0.3.0/tests/
H A DMain.hs74 testSwap hamming
75 testPair hamming "karolin" "kathrin" (Just 3)
76 testPair hamming "karolin" "kerstin" (Just 3)
77 testPair hamming "1011101" "1001001" (Just 2)
78 testPair hamming "2173896" "2233796" (Just 3)
79 testPair hamming "toned" "roses" (Just 3)
80 testPair hamming "red" "wax" (Just 3)
82 testPair hamming "a��c" "abc" (Just 1)
84 testPair hamming "lucky" "lucky" (Just 0)
85 testPair hamming "" "" (Just 0)
[all …]
/dports/science/R-cran-e1071/e1071/man/
H A Dhamming.distance.Rd1 \name{hamming.distance}
2 \alias{hamming.distance}
4 \usage{ hamming.distance(x, y)
11 \code{y} are vectors, \code{hamming.distance} returns the Hamming
19 hamming.distance(x, y)
22 hamming.distance(z)
24 hamming.distance(1:3, 3:1)
H A Dhamming.window.Rd1 \name{hamming.window}
5 \usage{hamming.window(n)}
7 \alias{hamming.window}
31 \examples{hamming.window(10)
34 y<-stft(x, wtype="hamming.window")
/dports/biology/viennarna/ViennaRNA-2.4.18/doc/latex/
H A Dstrings_8h.tex51 \begin{DoxyCompactList}\small\item\em Calculate hamming distance between two sequences. \end{DoxyCo…
74 int \mbox{\hyperlink{strings_8h_ad9dc7bfc9aa664dc6698f17ce07fc7e7}{hamming}} (const char $\ast$s1, …
75 \begin{DoxyCompactList}\small\item\em Calculate hamming distance between two sequences. \end{DoxyCo…
123 \index{strings.h@{strings.h}!hamming@{hamming}}
124 \index{hamming@{hamming}!strings.h@{strings.h}}
125 \doxysubsubsection{\texorpdfstring{hamming()}{hamming()}}
130 Calculate hamming distance between two sequences.
135 \index{strings.h@{strings.h}!hamming\_bound@{hamming\_bound}}
136 \index{hamming\_bound@{hamming\_bound}!strings.h@{strings.h}}
137 \doxysubsubsection{\texorpdfstring{hamming\_bound()}{hamming\_bound()}}
[all …]
/dports/biology/phyml/phyml-3.3.20200621/src/
H A Dtbe.c114 short unsigned** hamming, short unsigned* min_dist, in Update_IC_Boot_Tree() argument
139 i_matrix, c_matrix, hamming, min_dist, min_dist_edge, cluster_sizes); in Update_IC_Boot_Tree()
151 hamming[i][boot_edge_id] = cluster_sizes[i] /* #taxa in the cluster i of T_ref */ in Update_IC_Boot_Tree()
156 …if (hamming[i][boot_edge_id] > N/2 /* floor value */) hamming[i][boot_edge_id] = N - hamming[i][bo… in Update_IC_Boot_Tree()
159 if (hamming[i][boot_edge_id] < min_dist[i]){ in Update_IC_Boot_Tree()
160 min_dist[i] = hamming[i][boot_edge_id]; in Update_IC_Boot_Tree()
168 short unsigned** c_matrix, short unsigned** hamming, in Update_All_IC_Boot_Tree() argument
179 …e(ref_tree, boot_tree, root, root->v[0], root->b[0], i_matrix, c_matrix, hamming, min_dist, min_di… in Update_All_IC_Boot_Tree()
180 …e(ref_tree, boot_tree, root, root->v[1], root->b[1], i_matrix, c_matrix, hamming, min_dist, min_di… in Update_All_IC_Boot_Tree()
181 …e(ref_tree, boot_tree, root, root->v[2], root->b[2], i_matrix, c_matrix, hamming, min_dist, min_di… in Update_All_IC_Boot_Tree()
[all …]
/dports/biology/seaview/seaview/
H A Dtbe.cxx33 short unsigned** hamming; in TBE_Compute() local
66 hamming, min_dist, min_dist_edge, in TBE_Compute()
95 short unsigned*** c_matrix, short unsigned*** hamming, in Alloc_TBE_Matrices() argument
123 free((*hamming)[i]); in Free_TBE_Matrices()
127 free((*hamming)); in Free_TBE_Matrices()
251 short unsigned** hamming, short unsigned* min_dist, in Update_IC_Boot_Tree() argument
306 hamming[i][boot_edge_id] = in Update_IC_Boot_Tree()
312 …if (hamming[i][boot_edge_id] > N/2 /* floor value */) hamming[i][boot_edge_id] = N - hamming[i][bo… in Update_IC_Boot_Tree()
314 if (hamming[i][boot_edge_id] < min_dist[i]){ in Update_IC_Boot_Tree()
315 min_dist[i] = hamming[i][boot_edge_id]; in Update_IC_Boot_Tree()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/media/test-drivers/vivid/
H A Dvivid-vbi-gen.c211 static const u8 hamming[16] = { variable
221 packet[0] = hamming[1 + ((line & 1) << 3)]; in vivid_vbi_gen_teletext()
222 packet[1] = hamming[line >> 1]; in vivid_vbi_gen_teletext()
226 packet[2] = hamming[frame % 10]; in vivid_vbi_gen_teletext()
227 packet[3] = hamming[frame / 10]; in vivid_vbi_gen_teletext()
228 packet[4] = hamming[0]; in vivid_vbi_gen_teletext()
229 packet[5] = hamming[0]; in vivid_vbi_gen_teletext()
230 packet[6] = hamming[0]; in vivid_vbi_gen_teletext()
231 packet[7] = hamming[0]; in vivid_vbi_gen_teletext()
232 packet[8] = hamming[0]; in vivid_vbi_gen_teletext()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/media/test-drivers/vivid/
H A Dvivid-vbi-gen.c211 static const u8 hamming[16] = { variable
221 packet[0] = hamming[1 + ((line & 1) << 3)]; in vivid_vbi_gen_teletext()
222 packet[1] = hamming[line >> 1]; in vivid_vbi_gen_teletext()
226 packet[2] = hamming[frame % 10]; in vivid_vbi_gen_teletext()
227 packet[3] = hamming[frame / 10]; in vivid_vbi_gen_teletext()
228 packet[4] = hamming[0]; in vivid_vbi_gen_teletext()
229 packet[5] = hamming[0]; in vivid_vbi_gen_teletext()
230 packet[6] = hamming[0]; in vivid_vbi_gen_teletext()
231 packet[7] = hamming[0]; in vivid_vbi_gen_teletext()
232 packet[8] = hamming[0]; in vivid_vbi_gen_teletext()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/media/test-drivers/vivid/
H A Dvivid-vbi-gen.c211 static const u8 hamming[16] = { variable
221 packet[0] = hamming[1 + ((line & 1) << 3)]; in vivid_vbi_gen_teletext()
222 packet[1] = hamming[line >> 1]; in vivid_vbi_gen_teletext()
226 packet[2] = hamming[frame % 10]; in vivid_vbi_gen_teletext()
227 packet[3] = hamming[frame / 10]; in vivid_vbi_gen_teletext()
228 packet[4] = hamming[0]; in vivid_vbi_gen_teletext()
229 packet[5] = hamming[0]; in vivid_vbi_gen_teletext()
230 packet[6] = hamming[0]; in vivid_vbi_gen_teletext()
231 packet[7] = hamming[0]; in vivid_vbi_gen_teletext()
232 packet[8] = hamming[0]; in vivid_vbi_gen_teletext()
[all …]
/dports/devel/rapidfuzz-cpp/rapidfuzz-cpp-47df6f7/test/
H A Dtests-levenshtein.cpp53 REQUIRE(string_metric::hamming(test, test) == 0);
54 REQUIRE(string_metric::hamming(test, diff_a) == 1);
55 REQUIRE(string_metric::hamming(test, diff_b) == 1);
56 REQUIRE(string_metric::hamming(diff_a, diff_b) == 2);
61 REQUIRE_THROWS_AS(string_metric::hamming(test, diff_len), std::invalid_argument);
/dports/math/faiss/faiss-1.7.1/faiss/utils/
H A Dhamming-inl.h90 inline int hamming(const uint8_t* b) const { in hamming() function
109 inline int hamming(const uint8_t* b) const { in hamming() function
130 inline int hamming(const uint8_t* b8) const { in hamming() function
156 inline int hamming(const uint8_t* b8) const { in hamming() function
181 inline int hamming(const uint8_t* b8) const { in hamming() function
210 inline int hamming(const uint8_t* b8) const { in hamming() function
236 int hamming(const uint8_t* b8) const { in hamming() function
315 int hamming(const uint8_t* b8) const { in hamming() function
341 int hamming(const uint8_t* b8) const { in hamming() function
450 int hamming(const uint8_t* b8) const { in hamming() function
[all …]
/dports/devel/p5-List-Gen/List-Gen-0.974/t/
H A Dlistgen_lazy_haskell.t380 my $hamming;
381 $hamming = lazy 1, merge_r+ (Map {$_ * 2} $hamming),
385 is => "@$hamming[0..$#expect]", "@expect";
387 for (my $hamming) {
393 is => "@$hamming[0..$#expect]", "@expect";
400 my $hamming;
401 $hamming = lazy 1, merge Map(sub {$_ * 2} => $hamming),
405 is => "@$hamming[0..$#expect]", "@expect";
413 is => "@$hamming[0..$#expect]", "@expect";
419 map_{$_*5} for my $hamming;
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/Transforms/SimplifyCFG/
H A D2006-06-12-InfLoop.ll102 br label %hamming.exit.i104
103 hamming.exit.i104: ; preds = %hamming.exit.i104.loopexit, %no_exit.1.i87
110 br label %hamming.exit16.i
111 hamming.exit16.i: ; preds = %hamming.exit16.i.loopexit, %hamming.exit.i104
113 then.1.i107: ; preds = %hamming.exit16.i
239 br label %hamming.exit.i71
240 hamming.exit.i71: ; preds = %hamming.exit.i71.loopexit, %loopexit.4.i57, %loopentry.4.i52, %loopen…
254 endif.2.i: ; preds = %hamming.exit.i71
351 br label %hamming.exit.i
352 hamming.exit.i: ; preds = %hamming.exit.i.loopexit, %loopexit.7.i, %loopentry.7.i
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/test/Transforms/SimplifyCFG/
H A D2006-06-12-InfLoop.ll102 br label %hamming.exit.i104
103 hamming.exit.i104: ; preds = %hamming.exit.i104.loopexit, %no_exit.1.i87
110 br label %hamming.exit16.i
111 hamming.exit16.i: ; preds = %hamming.exit16.i.loopexit, %hamming.exit.i104
113 then.1.i107: ; preds = %hamming.exit16.i
239 br label %hamming.exit.i71
240 hamming.exit.i71: ; preds = %hamming.exit.i71.loopexit, %loopexit.4.i57, %loopentry.4.i52, %loopen…
254 endif.2.i: ; preds = %hamming.exit.i71
351 br label %hamming.exit.i
352 hamming.exit.i: ; preds = %hamming.exit.i.loopexit, %loopexit.7.i, %loopentry.7.i
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/Transforms/SimplifyCFG/
H A D2006-06-12-InfLoop.ll102 br label %hamming.exit.i104
103 hamming.exit.i104: ; preds = %hamming.exit.i104.loopexit, %no_exit.1.i87
110 br label %hamming.exit16.i
111 hamming.exit16.i: ; preds = %hamming.exit16.i.loopexit, %hamming.exit.i104
113 then.1.i107: ; preds = %hamming.exit16.i
239 br label %hamming.exit.i71
240 hamming.exit.i71: ; preds = %hamming.exit.i71.loopexit, %loopexit.4.i57, %loopentry.4.i52, %loopen…
254 endif.2.i: ; preds = %hamming.exit.i71
351 br label %hamming.exit.i
352 hamming.exit.i: ; preds = %hamming.exit.i.loopexit, %loopexit.7.i, %loopentry.7.i
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/test/Transforms/SimplifyCFG/
H A D2006-06-12-InfLoop.ll102 br label %hamming.exit.i104
103 hamming.exit.i104: ; preds = %hamming.exit.i104.loopexit, %no_exit.1.i87
110 br label %hamming.exit16.i
111 hamming.exit16.i: ; preds = %hamming.exit16.i.loopexit, %hamming.exit.i104
113 then.1.i107: ; preds = %hamming.exit16.i
239 br label %hamming.exit.i71
240 hamming.exit.i71: ; preds = %hamming.exit.i71.loopexit, %loopexit.4.i57, %loopentry.4.i52, %loopen…
254 endif.2.i: ; preds = %hamming.exit.i71
351 br label %hamming.exit.i
352 hamming.exit.i: ; preds = %hamming.exit.i.loopexit, %loopexit.7.i, %loopentry.7.i
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/Transforms/SimplifyCFG/
H A D2006-06-12-InfLoop.ll102 br label %hamming.exit.i104
103 hamming.exit.i104: ; preds = %hamming.exit.i104.loopexit, %no_exit.1.i87
110 br label %hamming.exit16.i
111 hamming.exit16.i: ; preds = %hamming.exit16.i.loopexit, %hamming.exit.i104
113 then.1.i107: ; preds = %hamming.exit16.i
239 br label %hamming.exit.i71
240 hamming.exit.i71: ; preds = %hamming.exit.i71.loopexit, %loopexit.4.i57, %loopentry.4.i52, %loopen…
254 endif.2.i: ; preds = %hamming.exit.i71
351 br label %hamming.exit.i
352 hamming.exit.i: ; preds = %hamming.exit.i.loopexit, %loopexit.7.i, %loopentry.7.i
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/test/Transforms/SimplifyCFG/
H A D2006-06-12-InfLoop.ll102 br label %hamming.exit.i104
103 hamming.exit.i104: ; preds = %hamming.exit.i104.loopexit, %no_exit.1.i87
110 br label %hamming.exit16.i
111 hamming.exit16.i: ; preds = %hamming.exit16.i.loopexit, %hamming.exit.i104
113 then.1.i107: ; preds = %hamming.exit16.i
239 br label %hamming.exit.i71
240 hamming.exit.i71: ; preds = %hamming.exit.i71.loopexit, %loopexit.4.i57, %loopentry.4.i52, %loopen…
254 endif.2.i: ; preds = %hamming.exit.i71
351 br label %hamming.exit.i
352 hamming.exit.i: ; preds = %hamming.exit.i.loopexit, %loopexit.7.i, %loopentry.7.i
[all …]

12345678910>>...66