Rename and update readme
This commit is contained in:
@@ -269,7 +269,7 @@ public class UserInterface {
|
||||
//Need to re-do the CDR3/CDR1 matching to correspond to new pattern
|
||||
//System.out.println("5) Generate CDR3/CDR1 occupancy graph");
|
||||
//System.out.println("6) Simulate CDR3/CDR1 T cell matching");
|
||||
System.out.println("9) Acknowledgements");
|
||||
System.out.println("9) About/Acknowledgments");
|
||||
System.out.println("0) Exit");
|
||||
try {
|
||||
input = sc.nextInt();
|
||||
@@ -384,8 +384,8 @@ public class UserInterface {
|
||||
System.out.println("1) Poisson");
|
||||
System.out.println("2) Gaussian");
|
||||
System.out.println("3) Exponential");
|
||||
System.out.println("(Note: approximate distribution in original paper is exponential, lambda = 0.6.)");
|
||||
System.out.println("(approximated from slope of log-log graph in figure 4c)");
|
||||
System.out.println("(Note: approximate distribution in original paper is exponential, lambda = 0.6)");
|
||||
System.out.println("(lambda value approximated from slope of log-log graph in figure 4c)");
|
||||
System.out.println("(Note: wider distributions are more memory intensive to match)");
|
||||
System.out.print("Enter selection value: ");
|
||||
input = sc.nextInt();
|
||||
@@ -664,6 +664,17 @@ public class UserInterface {
|
||||
System.out.println("This program simulates BiGpairSEQ, a graph theory based adaptation");
|
||||
System.out.println("of the pairSEQ algorithm for pairing T cell receptor sequences.");
|
||||
System.out.println("");
|
||||
System.out.println("Unlike pairSEQ, which calculates p-values for every TCR alpha/beta overlap and compares");
|
||||
System.out.println("against a null distribution, BiGpairSEQ does not do any statistical calculations");
|
||||
System.out.println("directly. Instead, BiGpairSEQ creates a simple bipartite weighted graph representing");
|
||||
System.out.println("the sample plate. The distinct TCRA and TCRB sequences form the two sets of vertices.");
|
||||
System.out.println("Every TCRA/TCRB pair that share a well are connected by an edge, with the edge weight");
|
||||
System.out.println("set to the number of wells in which both sequences appear. (Sequences in all wells are");
|
||||
System.out.println("filtered out prior to creating the graph, as there is no signal in their occupancy");
|
||||
System.out.println("pattern.) The problem of pairing TCRA/TCRB sequences thus reduces to the \"assignment");
|
||||
System.out.println("problem\" of finding a maximum weight matching on a bipartite graph--the subset of");
|
||||
System.out.println("vertex-disjoint edges whose weights sum to the maximum possible value.");
|
||||
System.out.println("");
|
||||
System.out.println("pairSEQ citation:");
|
||||
System.out.println("Howie, B., Sherwood, A. M., et. al.");
|
||||
System.out.println("High-throughput pairing of T cell receptor alpha and beta sequences.");
|
||||
|
||||
Reference in New Issue
Block a user