Mercurial > repos > rliterman > csp2

comparison CSP2/CSP2_env/env-d9b9114564458d9d-741b3de822f2aaca6c6caa4325c4afce/opt/bbmap-39.01-1/current/fun/ProbShared3.java @ 68:5028fdace37b

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
planemo upload commit 2e9511a184a1ca667c7be0c6321a36dc4e3d116d
author jpayne
date Tue, 18 Mar 2025 16:23:26 -0400
parents
children
comparison
equal deleted inserted replaced
67:0e9998148a16 68:5028fdace37b
1 package fun;
2
3 import java.util.HashSet;
4 import java.util.Random;
5
6 public class ProbShared3 {
7
8 public static void main(String args[]){
9 int k=Integer.parseInt(args[0]);
10 int len1=Integer.parseInt(args[1]);
11 int len2=Integer.parseInt(args[2]);
12 int rounds=Integer.parseInt(args[3]);
13
14 System.out.println("Probability: "+simulate(k, len1, len2, rounds));
15 }
16
17 static double simulate(int k, int len1, int len2, int rounds){
18 int successes=0;
19 final HashSet<Long> set=new HashSet<Long>();
20 for(int i=0; i<rounds; i++){
21 successes+=simulateOnePair(k, len1, len2, set);
22 }
23 return successes/(double)rounds;
24 }
25
26 static int simulateOnePair(int k, int len1, int len2, HashSet<Long> set){
27 fillRandomSet(k, len2, set);
28 final long space=(long)Math.pow(4, k);
29 final int kmers=len1-k+1;
30 for(int i=0; i<kmers; i++){
31 long kmer=(randy.nextLong()&Long.MAX_VALUE)%space;
32 if(set.contains(kmer)){return 1;}
33 }
34 return 0;
35 }
36
37 static void fillRandomSet(int k, int len, HashSet<Long> set){
38 set.clear();
39 final long space=(long)Math.pow(4, k);
40 final int kmers=len-k+1;
41 for(int i=0; i<kmers; i++){
42 set.add((randy.nextLong()&Long.MAX_VALUE)%space);
43 }
44 }
45
46 static final Random randy=new Random();
47
48 }