Jacqueline W. Daykin

According to our database, Jacqueline W. Daykin authored at least 42 papers between 1984 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Heuristics for the run-length encoded Burrows-Wheeler transform alphabet ordering problem.

Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges

J. Heuristics, March, 2025

2024

On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms.

Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober

Discret. Appl. Math., 2024

V-Words, Lyndon Words and Galois Words.

Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth

CoRR, 2024

A visualization tool to explore alphabet orderings for the Burrows-Wheeler Transform.

Lily Major, Dave Davies, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges

CoRR, 2024

2023

Local Maximal Equality-Free Periodicities.

Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth

Proceedings of the Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops, 2023

V-Words, Lyndon Words and Substring circ-UMFFs.

Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth

Proceedings of the Combinatorial Optimization and Applications, 2023

2021

Computation of the suffix array, Burrows-Wheeler transform and FM-index in <i>V</i>-order.

Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth

Theor. Comput. Sci., 2021

2020

On Arithmetically Progressed Suffix Arrays.

Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations.

Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Leonel Jose Peña Gamboa, Christine Zarges

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

2019

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

Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur, Bruce W. Watson

Inf. Process. Lett., 2019

Enhanced string factoring from alphabet orderings.

Amanda Clare, Jacqueline W. Daykin

Inf. Process. Lett., 2019

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

Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Evolutionary search techniques for the Lyndon factorization of biosequences.

Amanda Clare, Jacqueline W. Daykin, Thomas Mills, Christine Zarges

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018

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

Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston

Theor. Comput. Sci., 2018

Reconstructing a string from its Lyndon arrays.

Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth

Theor. Comput. Sci., 2018

Three Strategies for the Dead-Zone String Matching Algorithm.

Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson

Proceedings of the Prague Stringology Conference 2018, 2018

A Faster V-order String Comparison Algorithm.

Ali Alatabbi, Jacqueline W. Daykin, Mhaskar Neerja, Mohammad Sohel Rahman, William F. Smyth

Proceedings of the Prague Stringology Conference 2018, 2018

2017

Indeterminate String Factorizations and Degenerate Text Transformations.

Jacqueline W. Daykin, Bruce W. Watson

Math. Comput. Sci., 2017

2016

Binary block order Rouen Transform.

Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston

Theor. Comput. Sci., 2016

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

Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman, W. F. Smyth

Discret. Appl. Math., 2016

2015

Antimagicness of Generalized Corona and Snowflake Graphs.

Jacqueline W. Daykin, Costas S. Iliopoulos, Mirka Miller, Oudone Phanalasy

Math. Comput. Sci., 2015

StringMasters 2012 & 2013 special issue - volume 2.

Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták

J. Discrete Algorithms, 2015

Simple Linear Comparison of Strings in V-order.

Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth

Fundam. Informaticae, 2015

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

Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth

CoRR, 2015

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

Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman

CoRR, 2015

Trends in Temporal Reasoning: Constraints, Graphs and Posets.

Jacqueline W. Daykin, Mirka Miller, Joe Ryan

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014

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

Jacqueline W. Daykin, William F. Smyth

Theor. Comput. Sci., 2014

StringMasters 2012 & 2013 special issue - volume 1.

Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták

J. Discrete Algorithms, 2014

Simple Linear Comparison of Strings in V-Order - (Extended Abstract).

Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

A Text Transformation Scheme for Degenerate Strings.

Jacqueline W. Daykin, Bruce W. Watson

Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

2013

A linear partitioning algorithm for Hybrid Lyndons using <i>V</i>V-order.

David E. Daykin, Jacqueline W. Daykin, W. F. Smyth

Theor. Comput. Sci., 2013

StringMasters 2011 Special Issue.

Maxime Crochemore, Jacqueline W. Daykin

J. Discrete Algorithms, 2013

Generic Algorithms for Factoring Strings.

David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Editorial.

Jacqueline W. Daykin, Bill Smyth, Lynette van Zijl

J. Discrete Algorithms, 2012

Lyndon fountains and the Burrows-Wheeler transform.

Ali Alatabbi, Maxime Crochemore, Jacqueline W. Daykin, Laurent Mouchard

Proceedings of the CUBE International IT Conference & Exhibition, 2012

2011

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

David E. Daykin, Jacqueline W. Daykin, William F. Smyth

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2009

Combinatorics of Unique Maximal Factorization Families (UMFFs).

David E. Daykin, Jacqueline W. Daykin, William F. Smyth

Fundam. Informaticae, 2009

2008

Properties and Construction of Unique Maximal Factorization Families for Strings.

David E. Daykin, Jacqueline W. Daykin

Int. J. Found. Comput. Sci., 2008

2003

Lyndon-like and V-order factorizations of strings.

David E. Daykin, Jacqueline W. Daykin

J. Discrete Algorithms, 2003

1994

Parallel RAM Algorithms for Factorizing Words.

Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth

Theor. Comput. Sci., 1994

1986

Inequalities for the number of monotonic functions of partial orders.

Jacqueline W. Daykin

Discret. Math., 1986

1984

On log concavity for order-preserving maps of partial orders.

David E. Daykin, Jacqueline W. Daykin, Michael S. Paterson

Discret. Math., 1984