#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1971

2018

- This year (8)
- Last 5 years (32)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Peter Eades, Xuemin Lin, William F. Smyth
- Inf. Process. Lett.
- 1993

- Simon J. Puglisi, William F. Smyth, Andrew Turpin
- Stringology
- 2005

In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, andâ€¦ (More)

[1] We describe three-dimensional direct numerical simulations (DNS) of double-diffusively stratified flow interacting with inflectional shear. The extreme difference in diffusivity (and thus minimumâ€¦ (More)

- Maxime Crochemore, Lucian Ilie, William F. Smyth
- Data Compression Conference (dcc 2008)
- 2008

We give a space-efficient simple algorithm for computing the Lempel-Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabetâ€¦ (More)

- Gang Chen, Simon J. Puglisi, William F. Smyth
- Mathematics in Computer Science
- 2008

For 30 years the Lempel-Ziv factorization LZx of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all theâ€¦ (More)

- Yin Li, William F. Smyth
- Algorithmica
- 2001

Let x denote a given nonempty string of length n = |x| . A proper substring u of x is a proper cover of x if and only if every position of x lies within an occurrence of u within x . This paperâ€¦ (More)

- Geoff McMullan, Connor Meehan, +6 authors William F. Smyth
- Applied Microbiology and Biotechnology
- 2001

Dyes and dyestuffs find use in a wide range of industries but are of primary importance to textile manufacturing. Wastewater from the textile industry can contain a variety of polluting substancesâ€¦ (More)

The Knuthâ€“Morrisâ€“Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyerâ€“Mooreâ€¦ (More)

- Anisa Al-Hafeedh, Maxime Crochemore, +4 authors Munina Yusufu
- ACM Comput. Surv.
- 2012

Since 1977, when Lempel and Ziv described a kind of string factorization useful for text compression, there has been a succession of algorithms proposed for computing “LZ factorization”.â€¦ (More)

In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T ourâ€¦ (More)