Jacqueline W. Daykin

Orcid: 0000-0003-1123-8703

According to our database1, Jacqueline W. Daykin authored at least 41 papers between 1984 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Heuristics for the Run-length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem.
CoRR, 2024

2023
Local Maximal Equality-Free Periodicities.
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.
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.
Theor. Comput. Sci., 2021

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms.
CoRR, 2021

2020
On Arithmetically Progressed Suffix Arrays.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

2019
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform.
Inf. Process. Lett., 2019

Enhanced string factoring from alphabet orderings.
Inf. Process. Lett., 2019

Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Evolutionary search techniques for the Lyndon factorization of biosequences.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018
A survey of string orderings and their application to the Burrows-Wheeler transform.
Theor. Comput. Sci., 2018

Reconstructing a string from its Lyndon arrays.
Theor. Comput. Sci., 2018

Three Strategies for the Dead-Zone String Matching Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

A Faster V-order String Comparison Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

2017
Indeterminate String Factorizations and Degenerate Text Transformations.
Math. Comput. Sci., 2017

2016
Binary block order Rouen Transform.
Theor. Comput. Sci., 2016

V-Order: New combinatorial properties & a simple comparison algorithm.
Discret. Appl. Math., 2016

2015
Antimagicness of Generalized Corona and Snowflake Graphs.
Math. Comput. Sci., 2015

StringMasters 2012 & 2013 special issue - volume 2.
J. Discrete Algorithms, 2015

Simple Linear Comparison of Strings in V-order.
Fundam. Informaticae, 2015

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

Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array.
CoRR, 2015

Trends in Temporal Reasoning: Constraints, Graphs and Posets.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014
A bijective variant of the Burrows-Wheeler Transform using V-order.
Theor. Comput. Sci., 2014

StringMasters 2012 & 2013 special issue - volume 1.
J. Discrete Algorithms, 2014

Simple Linear Comparison of Strings in V-Order - (Extended Abstract).
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

A Text Transformation Scheme for Degenerate Strings.
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.
Theor. Comput. Sci., 2013

StringMasters 2011 Special Issue.
J. Discrete Algorithms, 2013

Generic Algorithms for Factoring Strings.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Editorial.
J. Discrete Algorithms, 2012

Lyndon fountains and the Burrows-Wheeler transform.
Proceedings of the CUBE International IT Conference & Exhibition, 2012

2011
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2009
Combinatorics of Unique Maximal Factorization Families (UMFFs).
Fundam. Informaticae, 2009

2008
Properties and Construction of Unique Maximal Factorization Families for Strings.
Int. J. Found. Comput. Sci., 2008

2003
Lyndon-like and V-order factorizations of strings.
J. Discrete Algorithms, 2003

1994
Parallel RAM Algorithms for Factorizing Words.
Theor. Comput. Sci., 1994

1986
Inequalities for the number of monotonic functions of partial orders.
Discret. Math., 1986

1984
On log concavity for order-preserving maps of partial orders.
Discret. Math., 1984


  Loading...