This is the prototype web-page for Jackie Daykin, Computer Scientist.
My research interests include big data topics such as pattern inference & compression, stringology algorithmics & data structures, and computational combinatorics involving for instance graphs & posets. An exciting development for me is that I have recently been appointed Lecturer in Computer Science at Aberystwyth University, Mauritius Branch Campus. I am also the mother of two special boys ... rapidly becoming men ......
Membership in Professional Organizations
Journals and Conferences
Accepted papers, seminars and invited talks:
"Correlation Algorithmics in Temporal Artificial Intelligence" Centre for Knowledge Dynamics & Decision Making, Cape Town, May 2016.
"Trends in temporal reasoning: Constraints, graphs and posets" Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2015), Berlin, November 2015.
"A Text Transformation Scheme For Degenerate Strings" 2nd International Conference on Algorithms for Big Data (ICABD 2014), Palermo, April 2014.
"A non-lexicographic data clustering scheme" Festcolloquium in honour of Professor Derrick Kourie, Information Science Department , Stellenbosch University, South Africa, October 2013.
"A bijective variant of the Burrows-Wheeler Transform using V–Order" Reading University Old Codger's One-Day Combinatorics Colloquium , October 2012.
"Rudolf Ahlswede in the seventies: R. Ahlwede's cooperation with David Daykin" Memorial Symposium for Prof Rudolph Ahlswede, the Zif, Bielefeld University, July 2011 - in loving memory.
"String comparison and Lyndon-like factorization using V-order in linear time" Combinatorial Pattern Matching (CPM 2011) , Palermo, June 2011.
"Combinatorics of unique maximal factorization families" Reading University Old Codger's One-Day Combinatorics Colloquium, November 2010- love you dad!
"Combinatorics and algorithmics of UMFFs" Department of Computer Science, Royal Holloway, University of London, December 2010.
"String factorization algorithmics" Combinatorics Colloquia, Queen Mary University of London, May 2007.
"String factorization algorithmics" Prague Stringology Club, Czech Technical University, December 2006.
"Applications of temporal reasoning and string factorization to diagramatic reasoning"School of Computing and Mathematical Sciences, University of Brighton, June 2002.
"Combinatorial topics on partial orders" Department of Computer Science, Indiana University - Purdue University at Indianapolis, May 1986.
"The FKG inequality and correlation in partially ordered sets" Department of Computer Science, Warwick University, March 1983.
M. Crochemore, J. W. Daykin and Z. Liptak (Editors), StringMasters 2012 & 2013 special issue - volume 2, J. Discrete Algorithms 32: 1-2 (2015).
M. Crochemore, J. W. Daykin and Z. Liptak (Editors), StringMasters 2012 & 2013 - volume 1. J. Discrete Algorithms 28: 1 (2014).
M. Crochemore and J. W. Daykin (Editors), StringMasters 2011 special issue. J. Discrete Algorithms 20: 1-2 (2013).
J. W. Daykin, W. F. Smyth and L. van Zijl (Editors), StringMasters 2009 & 2010 special issue. J. Discrete Algorithms 10: 1 (2012)
J. Chan, J. W. Daykin and M. S. Rahman (Editors), London Algorithmics 2008: Theory and Practice, King's College Publications, Texts in Algorithms, Vol. 11 (2009), ISBN 978-1-904987-97-0.
J. W. Daykin, M. Mohammed, K. Steinhofel (Editors), London Algorithmics and Stringology 2006, King's College Publications, Texts in Algorithms, Vol. 8 (2007), ISBN 978-1-904987-41-3.
Various research grants are gratefully acknowledged:
Problems and Solutions (BSc)
Web Development Tools (BSc)
Foundations of Computer Science (BSc)
Logical Foundations of Computer Science and Artificial Intelligence (BSc)
Web and Internet Technologies (BSc)
Graphics & Human Computer Interaction (BSc)
Algorithm Design and Data Structures with Pascal (BSc)
Introduction to Computer Science with Pascal (BSc)
Complexity of Algorithms (BSc)
Computer Graphics (BSc)
Algorithmic Issues in the WWW (MSc)
Geometric Algorithms with Applications (MSc)
Business Information Systems Theory and Practice (MSc examiner)
Business Information Systems Databases group projects (MSc examiner)
Personal and Professional Development (BSc)
Project supervision & Outreach events
J.W. Daykin, T. Gagie and J. Holub, BWT validation (in preparation).
A. Alatabbi, J. W. Daykin, M. S. Rahman, Combinatorial UMFF fountains (in preparation).
F. Franek, J. W. Daykin, J. Holub, A. S. M. S. Islam, and W. F. Smyth, Reconstructing a String from its Lyndon Arrays (submitted 2016).
J.W. Daykin, R. Groumt, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Leonard and E. Prieur, A Survey on String Transforms. To appear: Theoretical Computer Science.
A. Alatabbi, J.W. Daykin, J. Karkkainen, S. M. Rahman, W. F. Smyth, V-Order: New Combinatorial Properties & A Simple On-Line Comparison Algorithm (submitted 2015). To appear: Discrete Applied Mathematics.
J.W. Daykin, R. Groumt, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Leonard and E. Prieur, Binary Block-order Rouen Transform. To appear: Theoretical Computer Science.
J.W. Daykin & B. Watson, Indeterminate String Factorizations and Degenerate Text Transformations. To appear: Mathematics in Computer Science - Special Issue on Algorithms for Big Data.
Jacqueline W. Daykin & W. F. Smyth, Analyzing strings with ordered Lyndon-like structures,
Formal Aspects of Computing (Essays dedicated to Derrick Kourie on the occasion of his 65th birthday),
Shaker Verlag, Stefan Gruner & Bruce Watson (eds.) (2013) Chapter 5, 95-110.
Pavlos Antoniou, Jackie W. Daykin, Costas S. Iliopoulos, Derrick Kourie, Laurent Mouchard and Solon P. Pissis, Mapping uniquely occurring short sequences derived from high throughput technologies to a reference genome, In Proceedings of the 9th International Conference on Information Technology and Applications in Biomedicine (ITAB 2009), 2009. IEEE Xplore.
J. W. Daykin, C. S. Iliopoulos and W. F. Smyth, Parallel algorithms for factorizing strings over an ordered alphabet, European Association for Theoretical Computer Science 45 (1991) 309-310.
D. E. Daykin and J. W. Daykin, Order preserving maps and linear extensions of a finite poset,
SIAM Journal on Algebraic and Discrete Methods 6 (1985) 738-748.
Here's a link to dblp.
PhD Thesis (1986)
Monotonic functions of finite posets, Warwick University, U.K.
Supervisor: Professor M.S. Paterson FRS
From time to time it is a surprise when someone approaches me to say with interest that my Erdos number is 2! This is indeed the case, but let me explain that this elated/elevated number is simply due to publishing with my father, David Daykin, who published jointly with Paul Erdos. Think of me as a chipette off the old block!
Real education ...?!
You can contact me: my name (first-dot-last) usual punctuation symbol kcl-dot-ac-dot-uk; rhul-dot-ac-dot-uk