The scientist’s investigation covers issues in Combinatorics, String, Suffix array, Algorithm and Simple. His work carried out in the field of Combinatorics brings together such families of science as Discrete mathematics and Substring. His String research is multidisciplinary, incorporating elements of Characterization, Theoretical computer science, Integer and Pattern matching.
His research investigates the connection between Theoretical computer science and topics such as String searching algorithm that intersect with problems in Code. His Suffix array study combines topics from a wide range of disciplines, such as Suffix tree and Compressed suffix array. The Compressed suffix array study combines topics in areas such as Interval tree, Tree structure and Generalized suffix tree.
His primary areas of study are Combinatorics, String, Discrete mathematics, Algorithm and Time complexity. His biological study spans a wide range of topics, including Computation and Substring. His work in the fields of String, such as Suffix tree, intersects with other areas such as Prefix and Simple.
His study looks at the intersection of Suffix tree and topics like Suffix array with Compressed suffix array. His work deals with themes such as Cardinality, Set, Sequence and Lexicographical order, which intersect with Discrete mathematics. William F. Smyth has included themes like Word, Theoretical computer science, String searching algorithm and Pattern matching in his Algorithm study.
His primary scientific interests are in Combinatorics, String, Discrete mathematics, Time complexity and Data structure. A large part of his Combinatorics studies is devoted to Conjecture. His String research is multidisciplinary, incorporating perspectives in Algorithm and Lyndon words.
His research investigates the connection with Discrete mathematics and areas like Abelian group which intersect with concerns in De Bruijn sequence. His work investigates the relationship between Time complexity and topics such as Computation that intersect with problems in Suffix array. William F. Smyth studied Data structure and Space that intersect with Inversion and Stack.
William F. Smyth mostly deals with Combinatorics, Discrete mathematics, Data structure, Time complexity and Computation. His Combinatorics study frequently intersects with other fields, such as String. The various areas that William F. Smyth examines in his String study include Representation, Burrows–Wheeler transform, Inversion, Space and Stack.
In general Discrete mathematics study, his work on Integer, Lemma and Neighbourhood often relates to the realm of Canonical factorization, thereby connecting several areas of interest. His Computation research includes themes of Suffix array and Conjecture. His research integrates issues of Factor, Existential quantification and Compressed suffix array in his study of Algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A taxonomy of suffix array construction algorithms
Simon J. Puglisi;W. F. Smyth;Andrew H. Turpin.
ACM Computing Surveys (2007)
Computing Patterns in Strings
A fast and effective heuristic for the feedback arc set problem
Peter Eades;Xuemin Lin;W. F. Smyth;W. F. Smyth.
Information Processing Letters (1993)
Efficient token based clone detection with flexible tokenization
Hamid Abdul Basit;Simon J. Puglisi;William F. Smyth;Andrew Turpin.
foundations of software engineering (2007)
A characterization of the squares in a Fibonacci string
Costas S. Iliopoulos;Costas S. Iliopoulos;Dennis W. G. Moore;William F. Smyth;William F. Smyth.
Theoretical Computer Science (1997)
Computing the Cover Array in Linear Time
Yin Li;William F. Smyth.
A Simple Algorithm for Computing the Lempel Ziv Factorization
M. Crochemore;L. Ilie;W.F. Smyth.
data compression conference (2008)
How many runs can a string contain
Simon J. Puglisi;Jamie Simpson;W. F. Smyth.
Theoretical Computer Science (2008)
Verifying a border array in linear time
W. Lu;P.J. Ryan;W.F. Smyth;Y. Sun.
The journal of combinatorial mathematics and combinatorial computing (2002)
Program style analysis: a natural by-product of program compilation
K. A. Redish;W. F. Smyth.
Communications of The ACM (1986)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: