Results

1. https://www.cs.ox.ac.uk/msctheses/738/1/2001_Tannous_J.pdf

nod" and even 10llger that of the one with zero lIodes.

www.cs.ox.ac.uk/msctheses/738/1/2001_Tannous_J.pdf- 1046k - 8 Jan 2009 - Cached

2. https://www.cs.ox.ac.uk/msctheses/871/1/2004_He_J.pdf

To Develop a System to Identify Commonly Occurring Motifs anlong. DNA sequences. Jia He. St. Catherine's College. University of Oxford. A thesis submitted for the degree of. Muster uf Science in Computer Science. Trinity 2004. Acknowledgement. I

www.cs.ox.ac.uk/msctheses/871/1/2004_He_J.pdf- 2897k - 16 Feb 2009 - Cached

3. https://www.cs.ox.ac.uk/msctheses/822/1/2003_Kosmetatos_V.pdf

I V;' = V(S" lILl.t). I But tlw lIodes 71 and Vt do not necessarily coincide.

www.cs.ox.ac.uk/msctheses/822/1/2003_Kosmetatos_V.pdf- 2922k - 27 Feb 2009 - Cached

4. https://www.cs.ox.ac.uk/msctheses/929/1/2005_Clark_J.pdf

17. Wildcard Function. ,. Any lllllllber or lIode:; At,! Past one llode Exartl.v one.

www.cs.ox.ac.uk/msctheses/929/1/2005_Clark_J.pdf- 2777k - 10 Nov 2008 - Cached

5. https://www.cs.ox.ac.uk/msctheses/872/1/2004_Hill_A.pdf

Forte provides a. method get_binary. node_xcitation which given a circuit rllodd and i.1 lIode.

www.cs.ox.ac.uk/msctheses/872/1/2004_Hill_A.pdf- 2955k - 16 Feb 2009 - Cached

6. https://www.cs.ox.ac.uk/msctheses/388/1/1993_Bellis_B.pdf

Programming Research Group. Oxford Univcrsity Computing LahoratolY. Thesis for MSc In Computatioll. Ilapid Pl'Otot.vpini!, of Compilers USillg Logic PWI-!,l'illlllllilli!;. Ba.rbara Bellis. September j I, j 9SJ:l. Oxford UniversIty Computing

www.cs.ox.ac.uk/msctheses/388/1/1993_Bellis_B.pdf- 2346k - 11 Sep 2008 - Cached