What is he best known for?
The fields of study he is best known for:
- Algorithm
- Artificial intelligence
- Algebra
His main research concerns Combinatorics, Suffix array, Theoretical computer science, Compressed suffix array and Algorithm.
His Combinatorics study frequently links to other fields, such as Substring.
The concepts of his Theoretical computer science study are interwoven with issues in Graph and Computer engineering.
His research investigates the connection with Compressed suffix array and areas like LCP array which intersect with concerns in Sparse array, Time complexity, Sorting and Burrows–Wheeler transform.
His work on Error detection and correction as part of general Algorithm study is frequently linked to Shotgun sequencing, Sequence analysis, Nucleic acid and DNA, therefore connecting diverse disciplines of science.
His work on Generalized suffix tree is typically connected to Code and Tokenization as part of general Suffix tree study, connecting several disciplines of science.
His most cited work include:
- A taxonomy of suffix array construction algorithms (254 citations)
- SHREC: A short-read error correction method (144 citations)
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval (124 citations)
What are the main themes of his work throughout his whole career to date?
Simon J. Puglisi mostly deals with Algorithm, Combinatorics, Theoretical computer science, Substring and Information retrieval.
Simon J. Puglisi combines subjects such as Suffix array and Pattern matching with his study of Algorithm.
Simon J. Puglisi interconnects Sorting and Suffix tree, String searching algorithm, Compressed suffix array in the investigation of issues within Suffix array.
His work on Binary logarithm and Time complexity as part of general Combinatorics research is frequently linked to Space and C++ string handling, thereby connecting diverse disciplines of science.
His study in Theoretical computer science is interdisciplinary in nature, drawing from both Search engine indexing, Factorization, Succinct data structure, Graph and De Bruijn sequence.
His Substring study combines topics in areas such as Matching and Representation.
He most often published in these fields:
- Algorithm (31.52%)
- Combinatorics (29.35%)
- Theoretical computer science (23.91%)
What were the highlights of his more recent work (between 2017-2021)?
- Algorithm (31.52%)
- Combinatorics (29.35%)
- Substring (20.11%)
In recent papers he was focusing on the following fields of study:
Simon J. Puglisi mainly investigates Algorithm, Combinatorics, Substring, Binary logarithm and Pattern matching.
His biological study spans a wide range of topics, including Path, Pairwise comparison and FM-index, Compressed suffix array.
The Combinatorics study combines topics in areas such as Efficient algorithm, Order and Constant.
Simon J. Puglisi has researched Substring in several fields, including Burrows–Wheeler transform and Representation.
His research investigates the connection between Binary logarithm and topics such as Suffix tree that intersect with problems in Speedup and Property testing.
Simon J. Puglisi focuses mostly in the field of Compressed data structure, narrowing it down to matters related to Theory of computation and, in some cases, Theoretical computer science.
Between 2017 and 2021, his most popular works were:
- Hybrid Indexing Revisited (13 citations)
- Algorithms for Anti-Powers in Strings (9 citations)
- Data structures based on k-mers for querying large collections of sequencing data sets. (8 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Artificial intelligence
- Algebra
Information retrieval, Algorithm, Petabyte, European Nucleotide Archive and Discrete mathematics are his primary areas of study.
Simon J. Puglisi mostly deals with Search engine indexing in his studies of Information retrieval.
His research integrates issues of Generalized suffix tree, Suffix tree and FM-index in his study of Algorithm.
His work carried out in the field of Discrete mathematics brings together such families of science as Burrows–Wheeler transform, Data compression and Representation.
The study of De Bruijn sequence is intertwined with the study of Substring in a number of ways.
His Substring research is multidisciplinary, incorporating perspectives in String processing and Combinatorics on words.
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.
