Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Farach, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient algorithms for inverting evolution
Martin Farach
,
Sampath Kannan
Journal of the ACM
46
(4), 1999, pp. 437-449
On the approximability of numerical taxonomy (fitting distances by tree metrics)
Richa Agarwala
,
Vineet Bafna
,
Martin Farach
,
Mike Paterson
,
Mikkel Thorup
SIAM Journal on Computing
28
(3), 1998-1999, pp. 1073-1085
Overcoming the memory bottleneck in suffix tree construction
Martin Farach
,
Paolo Ferragina
,
S. Muthukrishnan
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 174-183
On local register allocation
Martin Farach
,
Vincenzo Liberatore
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 564-573
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
,
Martin Farach
,
Sridhar Hannenhalli
,
S. Muthukrishnan
,
Steven Skiena
Proceedings of the 1st Annual International Conference on Computational Molecular Biology, RECOMB'97 (Santa Fe, New Mexico, January 20-23, 1997)
, 1997, pp. 1-2
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model
Richa Agarwala
,
Serafim Batzoglou
,
Vlado Danc̑ik
,
Scott E. Decatur
,
Martin Farach
,
Sridhar Hannenhalli
,
Steven Skiena
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 390-399
Nearly tight bounds on the learnability of evolution
Andris Ambainis
,
Richard Desper
,
Martin Farach
,
Sampth Kannan
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 524-533
Optimal two-dimensional compressed matching
Amihood Amir
,
Gary Benson
,
Martin Farach
Journal of Algorithms
24
(2), 1997, pp. 354-379
Numerical taxonomy on data: Experimental results
Jaime Cohen
,
Martin Farach
Proceedings of the 1st Annual International Conference on Computational Molecular Biology, RECOMB'97 (Santa Fe, New Mexico, January 20-23, 1997)
, 1997, pp. 98-98
Numerical taxonomy on data: Experimental results
Jaime Cohen
,
Martin Farach
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 410-417
Optimal parallel randomized renaming
Martin Farach
,
S. Muthukrishnan
Information Processing Letters
61
(1), 1997, pp. 7-10
Sparse dynamic programming for evolutionary-tree comparison
Martin Farach
,
Mikkel Thorup
SIAM Journal on Computing
26
(1), 1997, pp. 210-230
Optimal suffix tree construction with large alphabets
Martin Farach
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 137-143
On the approximability of numerical taxonomy (fitting distances by tree metrics)
Richa Agarwala
,
Vineet Bafna
,
Martin Farach
,
Babu Narayanan
,
Mike Paterson
,
Mikkel Thorup
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 365-372
Let sleeping files lie: Pattern matching in Z-compressed files
Amihood Amir
,
Gary Benson
,
Martin Farach
Journal of Computer and System Sciences
52
(2), 1996, pp. 299-307
The structure of circular decomposable metrics
George Christopher
,
Martin Farach
,
Michael A. Trick
Lecture Notes in Computer Science
1136
, 1996, pp. 486-500
Efficient algorithms for inverting evolution
Martin Farach
,
Sampath Kannan
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 230-236
Perfect hashing for strings: Formalization and algorithms
Martin Farach
,
S. Muthukrishnan
Lecture Notes in Computer Science
1075
, 1996, pp. 130-140
Optimal logarithmic time randomized suffix tree construction
Martin Farach
,
S. Muthukrishnan
Lecture Notes in Computer Science
1099
, 1996, pp. 550-561
Improved dynamic dictionary matching
Amihood Amir
,
Martin Farach
,
Ramana M. Idury
,
Johannes A. la Poutré
,
Alejandro A. Schäffer
Information and Computation
119
(2), 1995, pp. 258-282
Efficient 2-dimensional approximate matching of half-rectangular figures
Amihood Amir
,
Martin Farach
Information and Computation
118
(1), 1995, pp. 1-11
Optimal parallel dictionary matching and compression
Martin Farach
,
S. Muthukrishnan
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 (Santa Barbara, California, July 17-19, 1995)
, 1995, pp. 244-253
On the entropy of DNA: Algorithms and measurements based on memory and rapid convergence
Martin Farach
,
Michiel Noordewier
,
Serap Savari
,
Larry Shepp
,
Abraham Wyner
,
Jacob Ziv
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 48-57
Computing the agreement of trees with bounded degrees
Martin Farach
,
Teresa M. Przytycka
,
Mikkel Thorup
Lecture Notes in Computer Science
979
, 1995, pp. 381-393
Fast comparison of evolutionary trees
Martin Farach
,
Mikkel Thorup
Information and Computation
123
(1), 1995, November, pp. 29-37
Seiten 1
2
>