Martin Farach

What is he best known for?

The fields of study he is best known for:

• Algorithm
• Artificial intelligence
• Combinatorics

Martin Farach mostly deals with Combinatorics, Discrete mathematics, String searching algorithm, Time complexity and Algorithm. Martin Farach regularly links together related areas like Longest common substring problem in his Combinatorics studies. His work carried out in the field of Discrete mathematics brings together such families of science as Tree and Distance matrix.

His String searching algorithm study combines topics from a wide range of disciplines, such as Analysis of algorithms and Suffix tree. Martin Farach combines subjects such as Tree, Data compression, Theoretical computer science and Substring index with his study of Time complexity. His work in Commentz-Walter algorithm tackles topics such as Algorithmics which are related to areas like Pattern matching and Matching.

His most cited work include:

• Optimal suffix tree construction with large alphabets (372 citations)
• Let Sleeping Files Lie (153 citations)
• A robust model for finding optimal evolutionary trees (123 citations)

What are the main themes of his work throughout his whole career to date?

Martin Farach focuses on Combinatorics, Algorithm, Discrete mathematics, Matching and Theoretical computer science. Many of his studies involve connections with topics such as String searching algorithm and Combinatorics. His studies in String searching algorithm integrate themes in fields like Approximate string matching and Analysis of algorithms.

In his research on the topic of Algorithm, Data compression is strongly related with Compressed pattern matching. His biological study spans a wide range of topics, including Computational complexity theory, Distance matrix, Graph theory and Tree. His research in Matching intersects with topics in K-SVD and Pattern matching.

He most often published in these fields:

• Combinatorics (47.27%)
• Algorithm (30.91%)
• Discrete mathematics (27.27%)

What were the highlights of his more recent work (between 1996-1999)?

• Combinatorics (47.27%)
• Algorithm (30.91%)
• Approximation algorithm (10.91%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Combinatorics, Algorithm, Approximation algorithm, Discrete mathematics and Theoretical computer science. His Combinatorics research integrates issues from String searching algorithm and Compressed suffix array. His studies deal with areas such as LCP array, Generalized suffix tree and Longest common substring problem as well as Compressed suffix array.

His work in Algorithm addresses subjects such as Compressed pattern matching, which are connected to disciplines such as Matching and Blossom algorithm. The concepts of his Approximation algorithm study are interwoven with issues in Distance matrix and Algorithmics. The study incorporates disciplines such as Tree, Graph theory and Pairwise comparison in addition to Discrete mathematics.

Between 1996 and 1999, his most popular works were:

• Optimal suffix tree construction with large alphabets (372 citations)
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) (93 citations)
• Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model (88 citations)

In his most recent research, the most cited papers focused on:

• Algorithm
• Artificial intelligence
• Combinatorics

Martin Farach spends much of his time researching Combinatorics, Compressed suffix array, String searching algorithm, Protein sequencing and Crystal structure. He integrates Combinatorics and Norm in his research. His Compressed suffix array research is multidisciplinary, incorporating perspectives in LCP array, Generalized suffix tree and Longest common substring problem.

He has included themes like Time complexity, Data compression, Approximate string matching and Dictionary coder in his String searching algorithm study. He integrates many fields in his works, including Protein sequencing, Hexagonal lattice and Polar.