From 8070dc963753142bb86c4ed698d91fd623ed28e7 Mon Sep 17 00:00:00 2001
From: ziejd2
Date: Thu, 28 Sep 2017 15:04:40 -0500
Subject: BNW using Octave instead of Matlab.

This version of BNW should perform the same as the original version. The only difference is that it uses Octave instead of Matlab when running BayesNet Toolbox during parameter learning.

I am calling this BNW_1.02. It can be accessed at:
compbio.uthsc.edu/BNW_1.02
---
 sourcecodes/bnt-master/KPMtools/strmatch_multi.m | 30 ++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 sourcecodes/bnt-master/KPMtools/strmatch_multi.m

(limited to 'sourcecodes/bnt-master/KPMtools/strmatch_multi.m')

diff --git a/sourcecodes/bnt-master/KPMtools/strmatch_multi.m b/sourcecodes/bnt-master/KPMtools/strmatch_multi.m
new file mode 100644
index 00000000..c29f326d
--- /dev/null
+++ b/sourcecodes/bnt-master/KPMtools/strmatch_multi.m
@@ -0,0 +1,30 @@
+function [posns] = strmatch_multi(keys, strs)
+% STRMATCH_MULTI Find where each key occurs in list of strings.
+% [pos] = strmatch_multi(key, strs) where key is a string and strs is a cell array of strings
+% works like the built-in command sequence pos = strmatch(key, strs, 'exact'),
+% except that pos is the first occurrence of key in strs; if there is no occurence, pos is 0.
+%
+% [posns] = strmatch_multi(keys, strs), where keys is a cell array of strings, 
+% matches each element of keys. It loops over whichever is shorter, keys or strs.
+
+if ~iscell(keys), keys = {keys}; end
+nkeys = length(keys);
+posns = zeros(1, nkeys);
+if length(keys) < length(strs)
+  for i=1:nkeys
+    %pos = strmatch(keys{i}, strs, 'exact');
+    ndx = strcmp(keys{i}, strs); % faster
+    pos = find(ndx);
+    if ~isempty(pos)
+      posns(i) = pos(1);
+    end
+  end
+else
+  for s=1:length(strs)
+    %ndx = strmatch(strs{s}, keys, 'exact');
+    ndx = strcmp(strs{s}, keys);
+    ndx = find(ndx);
+    posns(ndx) = s;
+  end
+end
+
-- 
cgit 1.4.1