default search action
Jacqueline W. Daykin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Jacqueline W. Daykin, Dominik Köppl
, David Kübel, Florian Stober
On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms. Discret. Appl. Math. 355: 180-199 (2024) - [i8]Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges:
Heuristics for the Run-length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem. CoRR abs/2401.16435 (2024) - [i7]Lily Major, Dave Davies, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges:
A visualization tool to explore alphabet orderings for the Burrows-Wheeler Transform. CoRR abs/2402.17005 (2024) - [i6]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Galois Words. CoRR abs/2409.02757 (2024) - 2023
- [c14]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Substring circ-UMFFs. COCOA (1) 2023: 471-484 - [c13]Mai Alzamel
Local Maximal Equality-Free Periodicities. AIAI Workshops 2023: 359-368 - 2021
- [j22]Jacqueline W. Daykin
Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. Theor. Comput. Sci. 880: 82-96 (2021) - [i5]Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober:
On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms. CoRR abs/2107.02503 (2021) - 2020
- [c12]Lily Major
Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations. PPSN (1) 2020: 390-403 - [c11]Jacqueline W. Daykin, Dominik Köppl
On Arithmetically Progressed Suffix Arrays. Stringology 2020: 96-110
2010 – 2019
- 2019
- [j21]Amanda Clare
Enhanced string factoring from alphabet orderings. Inf. Process. Lett. 143: 4-7 (2019) - [j20]Jacqueline W. Daykin
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. Inf. Process. Lett. 147: 82-87 (2019) - [c10]Amanda Clare
Evolutionary search techniques for the Lyndon factorization of biosequences. GECCO (Companion) 2019: 1543-1550 - [c9]Ali Alatabbi, Jacqueline W. Daykin
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. WALCOM 2019: 329-338 - 2018
- [j19]Jacqueline W. Daykin
Reconstructing a string from its Lyndon arrays. Theor. Comput. Sci. 710: 44-51 (2018) - [j18]Jacqueline W. Daykin
A survey of string orderings and their application to the Burrows-Wheeler transform. Theor. Comput. Sci. 710: 52-65 (2018) - [c8]Ali Alatabbi, Jacqueline W. Daykin, Mhaskar Neerja, Mohammad Sohel Rahman, William F. Smyth:
A Faster V-order String Comparison Algorithm. Stringology 2018: 38-48 - [c7]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Three Strategies for the Dead-Zone String Matching Algorithm. Stringology 2018: 117-128 - [i4]Amanda Clare, Jacqueline W. Daykin:
Enhanced string factoring from alphabet orderings. CoRR abs/1806.05942 (2018) - 2017
- [j17]Jacqueline W. Daykin
Indeterminate String Factorizations and Degenerate Text Transformations. Math. Comput. Sci. 11(2): 209-218 (2017) - [i3]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. CoRR abs/1708.01130 (2017) - 2016
- [j16]Ali Alatabbi
V-Order: New combinatorial properties & a simple comparison algorithm. Discret. Appl. Math. 215: 41-46 (2016) - [j15]Jacqueline W. Daykin
Binary block order Rouen Transform. Theor. Comput. Sci. 656: 118-134 (2016) - 2015
- [j14]Ali Alatabbi, Jacqueline W. Daykin
Simple Linear Comparison of Strings in V-order. Fundam. Informaticae 139(2): 115-126 (2015) - [j13]Maxime Crochemore
StringMasters 2012 & 2013 special issue - volume 2. J. Discrete Algorithms 32: 1-2 (2015) - [j12]Jacqueline W. Daykin
Antimagicness of Generalized Corona and Snowflake Graphs. Math. Comput. Sci. 9(1): 105-111 (2015) - [c6]Jacqueline W. Daykin
Trends in Temporal Reasoning: Constraints, Graphs and Posets. MACIS 2015: 290-304 - [i2]Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman:
Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array. CoRR abs/1506.06983 (2015) - [i1]Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth:
String Comparison in V-Order: New Lexicographic Properties & On-line Applications. CoRR abs/1507.07038 (2015) - 2014
- [j11]Maxime Crochemore, Jacqueline W. Daykin
StringMasters 2012 & 2013 special issue - volume 1. J. Discrete Algorithms 28: 1 (2014) - [j10]Jacqueline W. Daykin
A bijective variant of the Burrows-Wheeler Transform using V-order. Theor. Comput. Sci. 531: 77-89 (2014) - [c5]Jacqueline W. Daykin, Bruce W. Watson:
A Text Transformation Scheme for Degenerate Strings. ICABD 2014: 23-29 - [c4]Ali Alatabbi, Jacqueline W. Daykin
Simple Linear Comparison of Strings in V-Order - (Extended Abstract). WALCOM 2014: 80-89 - 2013
- [j9]Maxime Crochemore, Jacqueline W. Daykin
StringMasters 2011 Special Issue. J. Discrete Algorithms 20: 1-2 (2013) - [j8]David E. Daykin, Jacqueline W. Daykin
A linear partitioning algorithm for Hybrid Lyndons using VV-order. Theor. Comput. Sci. 483: 149-161 (2013) - [c3]David E. Daykin, Jacqueline W. Daykin
Generic Algorithms for Factoring Strings. Information Theory, Combinatorics, and Search Theory 2013: 402-418 - 2012
- [j7]Jacqueline W. Daykin
Editorial. J. Discrete Algorithms 10: 1 (2012) - [c2]Ali Alatabbi, Maxime Crochemore, Jacqueline W. Daykin
Lyndon fountains and the Burrows-Wheeler transform. CUBE 2012: 441-446 - 2011
- [c1]David E. Daykin, Jacqueline W. Daykin
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. CPM 2011: 65-76
2000 – 2009
- 2009
- [j6]David E. Daykin, Jacqueline W. Daykin
Combinatorics of Unique Maximal Factorization Families (UMFFs). Fundam. Informaticae 97(3): 295-309 (2009) - 2008
- [j5]David E. Daykin, Jacqueline W. Daykin
Properties and Construction of Unique Maximal Factorization Families for Strings. Int. J. Found. Comput. Sci. 19(4): 1073-1084 (2008) - 2003
- [j4]David E. Daykin, Jacqueline W. Daykin
Lyndon-like and V-order factorizations of strings. J. Discrete Algorithms 1(3-4): 357-365 (2003)
1990 – 1999
- 1994
- [j3]Jacqueline W. Daykin
Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127(1): 53-67 (1994)
1980 – 1989
- 1986
- [j2]Jacqueline W. Daykin
Inequalities for the number of monotonic functions of partial orders. Discret. Math. 61(1): 41-55 (1986) - 1984
- [j1]David E. Daykin, Jacqueline W. Daykin
On log concavity for order-preserving maps of partial orders. Discret. Math. 50: 221-226 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: