ACNP - Italian Periodicals Catalogue

AAAAAA

ITA
ENG

Results: 1-17 |

Results: 17

STRING-MATCHING IN LEMPEL-ZIV COMPRESSED STRINGS

Authors: FARACH M THORUP M

Citation: M. Farach et M. Thorup, STRING-MATCHING IN LEMPEL-ZIV COMPRESSED STRINGS, Algorithmica, 20(4), 1998, pp. 388-404

NUMERICAL TAXONOMY ON DATA - EXPERIMENTAL RESULTS

Authors: COHEN J FARACH M

Citation: J. Cohen et M. Farach, NUMERICAL TAXONOMY ON DATA - EXPERIMENTAL RESULTS, Journal of computational biology, 4(4), 1997, pp. 547-558

LOCAL RULES FOR PROTEIN-FOLDING ON A TRIANGULAR LATTICE AND GENERALIZED HYDROPHOBICITY IN THE HP MODEL

Authors: AGARWALA R BATZOGLOU S DANCIK V DECATUR SE HANNENHALLI S FARACH M MUTHUKRISHNAN S SKIENA S

Citation: R. Agarwala et al., LOCAL RULES FOR PROTEIN-FOLDING ON A TRIANGULAR LATTICE AND GENERALIZED HYDROPHOBICITY IN THE HP MODEL, Journal of computational biology, 4(3), 1997, pp. 275-296

RECOGNIZING CIRCULAR DECOMPOSABLE METRICS

Authors: FARACH M

Citation: M. Farach, RECOGNIZING CIRCULAR DECOMPOSABLE METRICS, Journal of computational biology, 4(2), 1997, pp. 157-162

OPTIMAL 2-DIMENSIONAL COMPRESSED MATCHING

Authors: AMIR A BENSON G FARACH M

Citation: A. Amir et al., OPTIMAL 2-DIMENSIONAL COMPRESSED MATCHING, Journal of algorithms, 24(2), 1997, pp. 354-379

SPARSE DYNAMIC-PROGRAMMING FOR EVOLUTIONARY-TREE COMPARISON

Authors: FARACH M THORUP M

Citation: M. Farach et M. Thorup, SPARSE DYNAMIC-PROGRAMMING FOR EVOLUTIONARY-TREE COMPARISON, SIAM journal on computing, 26(1), 1997, pp. 210-230

OPTIMAL PARALLEL RANDOMIZED RENAMING

Authors: FARACH M MUTHUKRISHNAN S

Citation: M. Farach et S. Muthukrishnan, OPTIMAL PARALLEL RANDOMIZED RENAMING, Information processing letters, 61(1), 1997, pp. 7-10

LET SLEEPING FILES LIE - PATTERN-MATCHING IN Z-COMPRESSED FILES

Authors: AMIR A BENSON G FARACH M

Citation: A. Amir et al., LET SLEEPING FILES LIE - PATTERN-MATCHING IN Z-COMPRESSED FILES, Journal of computer and system sciences, 52(2), 1996, pp. 299-307

FAST COMPARISON OF EVOLUTIONARY TREES

Authors: FARACH M THORUP M

Citation: M. Farach et M. Thorup, FAST COMPARISON OF EVOLUTIONARY TREES, Information and computation, 123(1), 1995, pp. 29-37

IMPROVED DYNAMIC DICTIONARY MATCHING

Authors: AMIR A FARACH M IDURY RM LAPOUTRE JA SCHAFFER AA

Citation: A. Amir et al., IMPROVED DYNAMIC DICTIONARY MATCHING, Information and computation, 119(2), 1995, pp. 258-282

EFFICIENT 2-DIMENSIONAL APPROXIMATE MATCHING OF HALF-RECTANGULAR FIGURES

Authors: AMIR A FARACH M

Citation: A. Amir et M. Farach, EFFICIENT 2-DIMENSIONAL APPROXIMATE MATCHING OF HALF-RECTANGULAR FIGURES, Information and computation, 118(1), 1995, pp. 1-11

A ROBUST MODEL FOR FINDING OPTIMAL EVOLUTIONARY TREES

Authors: FARACH M KANNAN S WARNOW T

Citation: M. Farach et al., A ROBUST MODEL FOR FINDING OPTIMAL EVOLUTIONARY TREES, Algorithmica, 13(1-2), 1995, pp. 155-179

ON THE AGREEMENT OF MANY TREES

Authors: FARACH M PRZYTYCKA TM THORUP M

Citation: M. Farach et al., ON THE AGREEMENT OF MANY TREES, Information processing letters, 55(6), 1995, pp. 297-301

AN ALPHABET INDEPENDENT APPROACH TO 2-DIMENSIONAL PATTERN-MATCHING

Authors: AMIR A BENSON G FARACH M

Citation: A. Amir et al., AN ALPHABET INDEPENDENT APPROACH TO 2-DIMENSIONAL PATTERN-MATCHING, SIAM journal on computing, 23(2), 1994, pp. 313-323

DYNAMIC DICTIONARY MATCHING

Authors: AMIR A FARACH M GALIL Z GIANCARLO R PARK K

Citation: A. Amir et al., DYNAMIC DICTIONARY MATCHING, Journal of computer and system sciences, 49(2), 1994, pp. 208-222

ALPHABET DEPENDENCE IN PARAMETERIZED MATCHING

Authors: AMIR A FARACH M MUTHUKRISHNAN S

Citation: A. Amir et al., ALPHABET DEPENDENCE IN PARAMETERIZED MATCHING, Information processing letters, 49(3), 1994, pp. 111-115

DNA-SEQUENCING - A PRIMER

Authors: FARACH M

Citation: M. Farach, DNA-SEQUENCING - A PRIMER, IEEE engineering in medicine and biology magazine, 12(3), 1993, pp. 20-21

Risultati: 1-17 |