D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 33 Citations 4,569 47 World Ranking 6917 National Ranking 3276

Research.com Recognitions

Awards & Achievements

1996 - Fellow of Alfred P. Sloan Foundation

Overview

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.

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.

Best Publications

Optimal suffix tree construction with large alphabets

M. Farach.
foundations of computer science (1997)

614 Citations

String matching in Lempel-Ziv compressed strings

Martin Farach;Mikkel Thorup.
Algorithmica (1998)

264 Citations

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)

Richa Agarwala;Vineet Bafna;Martin Farach;Mike Paterson.
SIAM Journal on Computing (1999)

244 Citations

Let Sleeping Files Lie

Amihood Amir;Gary Benson;Martin Farach.
Journal of Computer and System Sciences (1996)

234 Citations

On the approximability of numerical taxonomy (fitting distances by tree metrics)

Richa Agarwala;Vineet Bafna;Martin Farach;Babu Narayanan.
symposium on discrete algorithms (1996)

221 Citations

A robust model for finding optimal evolutionary trees

Martin Farach;Sampath Kannan;Tandy J. Warnow.
Algorithmica (1995)

220 Citations

Optimal superprimitivity testing for strings

Alberto Apostolico;Alberto Apostolico;Martin Farach;Costas S. Iliopoulos.
Information Processing Letters (1991)

145 Citations

Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model.

Richa Agarwala;Serafim Batzoglou;Vlado Dancík;Scott E. Decatur.
Journal of Computational Biology (1997)

143 Citations

Improved Dynamic Dictionary Matching

A. Amir;M. Farach;R.M. Idury;J.A. Lapoutre.
Information & Computation (1995)

139 Citations

On the agreement of many trees

Martin Farach;Teresa M. Przytycka;Mikkel Thorup.
Information Processing Letters (1995)

139 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Martin Farach

Amihood Amir

Amihood Amir

Bar-Ilan University

Publications: 92

Costas S. Iliopoulos

Costas S. Iliopoulos

King's College London

Publications: 80

Maxime Crochemore

Maxime Crochemore

King's College London

Publications: 44

William F. Smyth

William F. Smyth

McMaster University

Publications: 40

Gonzalo Navarro

Gonzalo Navarro

University of Chile

Publications: 37

Gad M. Landau

Gad M. Landau

University of Haifa

Publications: 35

Wojciech Rytter

Wojciech Rytter

University of Warsaw

Publications: 35

Kunsoo Park

Kunsoo Park

Seoul National University

Publications: 34

Wing-Kin Sung

Wing-Kin Sung

National University of Singapore

Publications: 28

Tak-Wah Lam

Tak-Wah Lam

University of Hong Kong

Publications: 26

Paolo Ferragina

Paolo Ferragina

University of Pisa

Publications: 25

Tandy Warnow

Tandy Warnow

University of Illinois at Urbana-Champaign

Publications: 23

Kunihiko Sadakane

Kunihiko Sadakane

University of Tokyo

Publications: 22

Vincent Moulton

Vincent Moulton

University of East Anglia

Publications: 15

Ming-Yang Kao

Ming-Yang Kao

Northwestern University

Publications: 15

Simon J. Puglisi

Simon J. Puglisi

University of Helsinki

Publications: 14

Trending Scientists

Lawrence R. Klein

Lawrence R. Klein

University of Pennsylvania

Peter Robinson

Peter Robinson

City University of Hong Kong

Marco Ceccarelli

Marco Ceccarelli

University of Rome Tor Vergata

Hans Reichenbach

Hans Reichenbach

University of California, Los Angeles

Martin S. Brandt

Martin S. Brandt

Technical University of Munich

Gary J. Shiflet

Gary J. Shiflet

University of Virginia

Dirk Eick

Dirk Eick

Center for Integrated Protein Science Munich

Charles N. Cole

Charles N. Cole

Dartmouth College

Friedrich Koch-Nolte

Friedrich Koch-Nolte

Universität Hamburg

Hirofumi Tachibana

Hirofumi Tachibana

Kyushu University

Michel Fily

Michel Fily

Grenoble Alpes University

Sameer A. Sheth

Sameer A. Sheth

Baylor College of Medicine

Linda Smolak

Linda Smolak

Kenyon College

Robert R. Edelman

Robert R. Edelman

Northwestern University

Mark C. Chappell

Mark C. Chappell

Wake Forest University

Robert E. Scully

Robert E. Scully

Harvard University

Something went wrong. Please try again later.