#### Filter Results:

- Full text PDF available (69)

#### Publication Year

1989

2018

- This year (9)
- Last 5 years (42)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Michael A. Bender, Martin Farach-Colton
- LATIN
- 2000

We present a very simple algorithm for the Least Common Ancestors problem. We thus dispel the frequently held notion that optimal LCA computation is unwieldy and unimplementable. Interestingly, thisâ€¦ (More)

We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the number of memoryâ€¦ (More)

We consider the problem of tting an n n distance matrix D by a tree metric T . Let " be the distance to the closest tree metric, that is, " = minTfk T;D k1g. First we present an O(n2) algorithm forâ€¦ (More)

- Kevin C. Chen, Dannie Durand, Martin Farach-Colton
- Journal of Computational Biology
- 2000

Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important role in the evolutionâ€¦ (More)

- Amihood Amir, Gary Benson, Martin Farach-Colton
- SODA
- 1994

The current explosion of stored information necessitates a new model of pattern matching, that of compressed matching. In this model one tries to find all occurrences of a pattern in a compressedâ€¦ (More)

- Martin Farach-Colton
- FOCS
- 1997

The su x tree of a string is the fundamental data structure of combinatorial pattern matching. In this paper, we present a novel, deterministic algorithm for the construction of su x trees. We settleâ€¦ (More)

A <b><i>streaming B-tree</i></b> is a dictionary that efficiently implements insertions and range queries. We present two cache-oblivious streaming B-trees, the <b><i>shuttle tree</i></b>, and theâ€¦ (More)

In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, areâ€¦ (More)

- Martin Farach-Colton, Sampath Kannan, Tandy J. Warnow
- Algorithmica
- 1993

Constructing evolutionary trees for species sets is a fundamental problem in computational biology. One of the standard models assumes the ability to compute distances between every pair of species,â€¦ (More)

- Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin
- J. Algorithms
- 2005

We study the problem of finding lowest common ancestors (LCA) in trees anddirected acyclic graphs (DAGs). Specifically, we extend the LCA problem to DAGs and study the LCA variants that arise iâ€¦ (More)