aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorZachary Sloan2013-06-20 21:47:59 +0000
committerZachary Sloan2013-06-20 21:47:59 +0000
commit0c5e75b42fb02faa2f2735aa4e188d32b9691101 (patch)
tree5a6e406fbcb6ca3eba0431837ad79c3b782fc6cd
parent3b2f40f45c1fddf89bba3b53e51771bfc25cd6f2 (diff)
downloadgenenetwork2-0c5e75b42fb02faa2f2735aa4e188d32b9691101.tar.gz
Added file corr_result_helpers.py that includes the function that
normalizes the lists of sample values
-rw-r--r--wqflask/utility/corr_result_helpers.py30
1 files changed, 30 insertions, 0 deletions
diff --git a/wqflask/utility/corr_result_helpers.py b/wqflask/utility/corr_result_helpers.py
new file mode 100644
index 00000000..edf32449
--- /dev/null
+++ b/wqflask/utility/corr_result_helpers.py
@@ -0,0 +1,30 @@
+def normalize_values(a_values, b_values):
+ """
+ Trim two lists of values to contain only the values they both share
+
+ Given two lists of sample values, trim each list so that it contains
+ only the samples that contain a value in both lists. Also returns
+ the number of such samples.
+
+ >>> normalize_values([2.3, None, None, 3.2, 4.1, 5], [3.4, 7.2, 1.3, None, 6.2, 4.1])
+ ([2.3, 4.1, 5], [3.4, 6.2, 4.1], 3)
+
+ """
+
+ min_length = min(len(a_values), len(b_values))
+ a_new = []
+ b_new = []
+ for counter in range(min_length):
+ if a_values[counter] and b_values[counter]:
+ a_new.append(a_values[counter])
+ b_new.append(b_values[counter])
+
+ num_overlap = len(a_new)
+ assert num_overlap == len(b_new), "Lengths should be the same"
+
+ return a_new, b_new, num_overlap
+
+
+if __name__ == '__main__':
+ import doctest
+ doctest.testmod() \ No newline at end of file