Dr Jacqueline Daykin

Honorary Research Fellow

View graph of relations

Department of Computer Science

Contact
ORCID: 0000-0003-1123-8703

Advanced search

Reset
to
1 - 50 out of 52Page size: 50
  1. 2021
  2. Published

    Computation of the suffix array, burrows-wheeler transform and FM-index in V-order

    Daykin, J., Mhaskar, N. & Smyth, W. F., 03 Aug 2021, In: Theoretical Computer Science. 880, p. 82-96 15 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.tcs.2021.06.004
  3. 2020
  4. Published

    Concepts for Computing Patterns in 15th Century Korean Music

    Moon, S., Daykin, J. & Pu, I., 24 Oct 2020, PATTERNS 2020: The Twelfth International Conference on Pervasive Patterns and Applications. International Academy, Research, and Industry Association (IARIA), p. 6-11

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

  5. Published

    PATTERNS 2020 The Twelfth International Conferences on Pervasive Patterns and Applications

    Daykin, J. (ed.), 24 Oct 2020, International Academy, Research, and Industry Association (IARIA). Mannaert, H., Pu, I. & Daykin, J. (eds.).

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

  6. Published

    Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations

    Major, L., Clare, A., Daykin, J., Mora, B., Peña Gamboa, L. & Zarges, C., 31 Aug 2020, Parallel Problem Solving from Nature – PPSN XVI - 16th International Conference, PPSN 2020, Proceedings: 16th International Conference, Leiden, The Netherlands, September 5-9, 2020, Proceedings. Bäck, T., Preuss, M., Deutz, A., Emmerich, M., Wang, H., Doerr, C. & Trautmann, H. (eds.). Springer Nature, p. 390-403 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12269 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1007/978-3-030-58112-1_27
  7. Accepted/In press

    On Arithmetically Progressed Suffix Arrays

    Daykin, J., Köppl, D., Kübel, D. & Stober, F., 29 Jun 2020, (Accepted/In press) Stringology.

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

  8. 2019
  9. Published

    Evolutionary Search Techniques for the Lyndon Factorization of Biosequences

    Clare, A., Daykin, J., Mills, T. & Zarges, C., 13 Jul 2019, p. 1543-1550.

    Research output: Contribution to conference › Paper › peer-review

  10. E-pub ahead of print

    Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform

    Daykin, J., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M., Mouchard, L., Prieur-Gaston, É. & Watson, B., 15 Mar 2019, (E-pub ahead of print) In: Information Processing Letters.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.ipl.2019.03.003
  11. Published

    Enhanced string factoring from alphabet orderings

    Clare, A. & Daykin, J., 01 Mar 2019, In: Information Processing Letters. 143, p. 4-7 4 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.ipl.2018.10.011
  12. Published

    Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index

    Alatabbi, A., Daykin, J., Mhaskar, N., Rahman, M. S. & Smyth, W. F., 16 Feb 2019, WALCOM: Algorithms and Computation: 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings. Das, G. K., Mandal, P. S., Mukhopadhyaya, K. & Nakano, S. (eds.). Springer Nature, p. 329-338 10 p. (WALCOM: Algorithms and Computation; no. 13).

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1007/978-3-030-10564-8_26
  13. 2018
  14. Published

    Alphabet Reordering for the Lyndon Factorization of Biological Strings

    Clare, A. & Daykin, J., 30 Aug 2018.

    Research output: Contribution to conference › Poster

    DOI: 10.6084/m9.figshare.7029425.v1
  15. Published

    Enhanced string factoring from alphabet orderings

    Clare, A. & Daykin, J., 15 Jun 2018, arXiv, 9 p.

    Research output: Working paper

  16. Published

    A survey of string orderings and their application to the Burrows-Wheeler transform

    Daykin, J., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M. & Prieur-Gaston, É., 01 Feb 2018, In: Theoretical Computer Science. 710, p. 52-65 14 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.tcs.2017.02.021
  17. Published

    Reconstructing a string from its Lyndon arrays

    Daykin, J., Franek, F., Holub, J., Islam, A. S. M. S. & Smyth, W. F., 01 Feb 2018, In: Theoretical Computer Science. 710, p. 44-51 8 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.tcs.2017.04.008
  18. Published

    A Faster V-order String Comparison Algorithm

    Alatabbi, A., Daykin, J., Mhaskar, N., Rahman, M. S. & Smyth, W. F., 2018, p. 38–49.

    Research output: Contribution to conference › Paper › peer-review

  19. Published

    Three Strategies for the Dead-Zone String Matching Algorithm

    Daykin, J., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M., Mouchard, L., Prieur-Gaston, É. & Watson, B., 2018, p. 117–128.

    Research output: Contribution to conference › Paper › peer-review

  20. 2017
  21. Published

    Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform

    Daykin, J., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M., Mouchard, L., Prieur-Gaston, É. & Watson, B., 03 Aug 2017, arXiv, p. 7.

    Research output: Working paper

  22. Indeterminate String Factorizations and Degenerate Text Transformations

    Daykin, J. & Watson, B., 01 Jun 2017, In: Mathematics in Computer Science. 11, 2, p. 209-218 10 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1007/s11786-016-0285-x
  23. Published

    Temporal Patterns: Smart-type Reasoning and Applications

    Chuckravanen, D., Daykin, J., Hunsdale, K. & Seeam, A., 19 Feb 2017, PATTERNS 2017: The Ninth International Conferences on Pervasive Patterns and Applications. International Academy, Research, and Industry Association (IARIA), p. 88-92

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

  24. Published

    Allen’s Interval Algebra and Smart-type Environments

    Hunsdale, K., Chuckravanen, D., Daykin, J. & Seeam, A., 2017, In: International Journal on Advances in Software. 10, 3 & 4, p. 221-230

    Research output: Contribution to journal › Article › peer-review

  25. Published

    PATTERNS 2017 The Ninth International Conferences on Pervasive Patterns and Applications

    Manaert, H. (ed.), Iwahori, Y. (ed.), Mirnig, A. (ed.), Ortis, A. (ed.), Perez, C. (ed.) & Daykin, J. (ed.), 2017, PATTERNS 2017 The Ninth International Conferences on Pervasive Patterns and Applications. Curran Associates, Inc.: International Academy, Research, and Industry Association (IARIA), (PATTERNS, International Conferences on Pervasive Patterns and Applications).

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

  26. 2016

  27. V-Order: New combinatorial properties & a simple comparison algorithm

    Alatabbi, A., Daykin, J., Kärkkäinen, J., Rahman, M. S. & Smyth, W. F., 31 Dec 2016, In: Discrete Applied Mathematics. 215, p. 41-46 6 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.dam.2016.07.006

  28. Binary block order Rouen Transform

    Daykin, J., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M. & Prieur-Gaston, É., 20 Dec 2016, In: Theoretical Computer Science. 656, B, p. 118-134 17 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.tcs.2016.05.028

  29. Trends in Temporal Reasoning: Constraints, Graphs, and Posets

    Daykin, J., Miller, M. & Ryan, J., 17 Apr 2016, Mathematical Aspects of Computer and Information Sciences: 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers. Kotsireas, I. S., Rump, S. M. & Yap, C. K. (eds.). Springer Nature, p. 290-304 15 p. (Mathematical Aspects of Computer and Information Sciences; no. 6).

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1007/978-3-319-32859-1_25
  30. 2015

  31. String Comparison in V-Order: New Lexicographic Properties & On-line Applications

    Alatabbi, A., Daykin, J., Rahman, M. S. & Smyth, W. F., 24 Jul 2015, arXiv, 16 p.

    Research output: Working paper

  32. Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array

    Alatabbi, A., Daykin, J. & Rahman, M. S., 23 Jun 2015, arXiv, 17 p.

    Research output: Working paper

  33. StringMasters 2012 2013 special issue - volume 2

    Crochemore, M., Daykin, J. & Lipták, Z., 01 May 2015, In: Journal of Discrete Algorithms. 32, p. 1-2 2 p.

    Research output: Contribution to journal › Editorial

    DOI: 10.1016/j.jda.2015.01.007

  34. Antimagicness of Generalized Corona and Snowflake Graphs

    Daykin, J., Iliopoulos, C. S., Miller, M. & Phanalasy, O., 01 Mar 2015, In: Mathematics in Computer Science. 9, 1, p. 105-111 7 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1007/s11786-014-0213-x

  35. Simple Linear Comparison of Strings in V-order

    Alatabbi, A., Daykin, J., Rahman, M. S. & Smyth, W. F., 2015, In: Fundamenta Informaticae. 139, 2, p. 115-126 12 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.3233/FI-2015-1228
  36. 2014

  37. StringMasters 2012 & 2013 special issue - volume 1

    Crochemore, M., Daykin, J. & Lipták, Z., 01 Sept 2014, In: Journal of Discrete Algorithms. 28, p. 1 1 p.

    Research output: Contribution to journal › Editorial

    DOI: 10.1016/j.jda.2014.08.002

  38. A bijective variant of the Burrows–Wheeler Transform using V-order

    Daykin, J. & Smyth, W. F., 24 Apr 2014, In: Theoretical Computer Science. 531, p. 77-89 13 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.tcs.2014.03.014

  39. A Text Transformation Scheme for Degenerate Strings

    Daykin, J. & Watson, B., 16 Apr 2014, Proceedings of the 2nd International Conference on Algorithms for Big Data: Palermo, Italy, April 07-09, 2014.. Iliopoulos, C. S. & Langiu, A. (eds.). CEUR Workshop Proceedings, p. 23-29 7 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

  40. Simple Linear Comparison of Strings in V-Order: Extended Abstract

    Alatabbi, A., Daykin, J., Rahman, M. S. & Smyth, W. F., 03 Feb 2014, Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. Pal, S. P. & Sadakane, K. (eds.). Springer Nature, p. 80-89 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1007/978-3-319-04657-0_10
  41. 2013
  42. Published

    Analyzing strings with ordered Lyndon-like structures

    Daykin, J. & Smyth, W. F., 13 Aug 2013, Formal Aspects of Computing: Essays Dedicated to Derrick Kourie on the Occasion of His 65th Birthday. Gruner, S. & Watson, B. (eds.). Aachen, Germany: Shaker Verlag GmbH, p. 95-110 (Berichte aus de Informatik).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter

  43. StringMasters 2011 Special Issue

    Crochemore, M. & Daykin, J., 31 May 2013, In: Journal of Discrete Algorithms. 20, p. 1-2 2 p.

    Research output: Contribution to journal › Editorial

    DOI: 10.1016/j.jda.2013.05.001

  44. A linear partitioning algorithm for Hybrid Lyndons using V-order

    Daykin, D. E., Daykin, J. & Smyth, W. F., 29 Apr 2013, In: Theoretical Computer Science. 483, p. 149-161 13 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/j.tcs.2012.02.001

  45. Generic Algorithms for Factoring Strings

    Daykin, D. E., Daykin, J., Iliopoulos, C. S. & Smyth, W. F., 16 Mar 2013, Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede. Aydinian, H., Cicalese, F. & Deppe, C. (eds.). Springer Nature, p. 402-418 17 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1007/978-3-642-36899-8_18
  46. 2012

  47. Lyndon fountains and the Burrows-Wheeler transform

    Alatabbi, A., Crochemore, M., Daykin, J. & Mouchard, L., 03 Sept 2012, Proceedings of the CUBE International Information Technology Conference: CUBE 2012: 3-5 September 2012, Pune, Maharashtra, India.. Potdar, V. (ed.). Association for Computing Machinery, p. 441-446 6 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1145/2381716.2381799

  48. Editorial

    Daykin, J., Smyth, B. & Zijl, L. V., 01 Jan 2012, In: Journal of Discrete Algorithms. 10, p. 1 1 p.

    Research output: Contribution to journal › Editorial

    DOI: 10.1016/j.jda.2011.08.004
  49. 2011

  50. String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time

    Daykin, D. E., Daykin, J. & Smyth, W. F., 2011, Combinatorial Pattern Matching: 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings. Giancarlo, R. & Manzini, G. (eds.). Springer Nature, p. 65-76 Chapter 8. (Combinatorial Pattern Matching; vol. 6661).

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1007/978-3-642-21458-5_8
  51. 2009

  52. Combinatorics of Unique Maximal Factorization Families (UMFFs)

    Daykin, D. E., Daykin, J. & Smyth, W. F., 31 Dec 2009, In: Fundamenta Informaticae. 97, 3, p. 295-309 15 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.3233/FI-2009-202
  53. Published

    London Algorithmics 2008: Theory and Practice

    Daykin, J. (ed.), Chan, J. (ed.) & Rahman, M. S. (ed.), 01 Jun 2009, Texts in Algorithmics: College Publications. 218 p. (Texts in Algorithmics S.)

    Research output: Book/Report › Book

  54. Published

    Mapping uniquely occurring short sequences derived from high throughput technologies to a reference genome

    Antoniou, P., Daykin, J., Iliopoulos, C. S., Kourie, D., Mouchard, L. & Pissis, S. P., 2009, 2009 9th International Conference on Information Technology and Applications in Biomedicine. IEEE Press, p. 1-4

    Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

    DOI: 10.1109/ITAB.2009.5394394
  55. 2008

  56. Properties and Construction of Unique Maximal Factorization Families for Strings

    Daykin, D. E. & Daykin, J., 01 Aug 2008, In: International Journal of Foundations of Computer Science. 19, 4, p. 1073-1084 12 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1142/S0129054108006133
  57. 2007
  58. Published

    London Algorithmics and Stringology 2006

    Daykin, J. (ed.), Mohamed , M. (ed.) & Steihofel, K. (ed.), 14 Feb 2007, Texts in Algorithmics: College Publications.

    Research output: Book/Report › Book

  59. 2003

  60. Lyndon-like and V-order factorizations of strings

    Daykin, D. E. & Daykin, J., 01 Jun 2003, In: Journal of Discrete Algorithms. 1, 3-4, p. 357-365 9 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/S1570-8667(03)00039-X
  61. 1994

  62. Parallel RAM Algorithms for Factorizing Words

    Daykin, J., Iliopoulos, C. S. & Smyth, W. F., 09 May 1994, In: Theoretical Computer Science. 127, 1, p. 53-67 15 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/0304-3975(94)90100-7
  63. 1991
  64. Published

    Parallel algorithms for factorizing strings over an ordered alphabet

    Daykin, J., Iliopoulos, C. S. & Smyth, W. F., 1991, In: Bulletin of the European Association for Theoretical Computer Science . 45, p. 309-310

    Research output: Contribution to journal › Article › peer-review

  65. 1986

  66. Inequalities for the number of monotonic functions of partial orders

    Daykin, J., 01 Aug 1986, In: Discrete Mathematics. 61, 1, p. 41-55 15 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1016/0012-365X(86)90026-9
  67. 1985
  68. Published

    Order Preserving Maps and Linear Extensions of a Finite Poset

    Daykin, J. & Daykin, D., 1985, In: SIAM Journal on Algebraic Discrete Methods. 6, 4, p. 738-748 11 p.

    Research output: Contribution to journal › Article › peer-review

    DOI: 10.1137/0606072
  69. 1984
  70. Published

    Inequalities for the number of monotonic functions of partial orders

    Daykin, J., Mar 1984, Coventry, UK: University of Warwick. 20 p.

    Research output: Book/Report › Commissioned report

Previous 1 2 Next

Fingerprint

100
String Computer Science
74
Order Mathematics
57
Factorization Computer Science
33
Algorithm Mathematics
29
Lyndon Word Mathematics
27
Transforms Mathematics
26
Words Mathematics
23
Linear Time Mathematics
21
Number Mathematics
20
Algorithms Computer Science
Full Fingerprint ›