Livio Colussi - Academia.edu (original) (raw)

Papers by Livio Colussi

ACM SIGSAM Bulletin, 1980

The problem considered in the present paper concerns a structural identifiability test for an app... more The problem considered in the present paper concerns a structural identifiability test for an appealing class of mathematical models, the so called compartmental models, which are widely employed in several fields of biology, medicine, ecology, etc.

Computer Programs in Biomedicine, 1980

A method for the fast writing of the symbolic expression of the transfer function matrix of a com... more A method for the fast writing of the symbolic expression of the transfer function matrix of a compartmental model has been implemented on a FORTRAN G program. Special care has been devoted to the reduction of computations and memory by means of original subroutines. The program input is very simple and the output very clear to general users. The program may be employed for the study of all input-output relations of he considered compartmental model. Details on the computational methods adopted for its implementation are given. Application examples are reported.

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990

The maximal number of character comparisons made by a linear-time string matching algorithm, give... more The maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a pattern string of length m over a general alphabet, is investigated. The number is denoted by c(n,m) or approximated by (1+C)n, where C is a universal constant. The subscript `online&amp;amp;amp;#39; is added when attention is restricted to online

Lecture Notes in Computer Science, 1994

In this paper we study the exact comparison complexity of the string prefix-matching problem in t... more In this paper we study the exact comparison complexity of the string prefix-matching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of comparisons required in the worst case by on-line prefix-matching algorithms for any fixed pattern and variable text. Unlike previous results on the comparison complexity of

Lecture Notes in Computer Science, 1995

Theoretical Computer Science, 1996

String matching is the problem of finding all occurrences of a string …[0… m - 1] of length m cal... more String matching is the problem of finding all occurrences of a string …[0… m - 1] of length m called a pattern, in a longer string …[0…n - 1] of length n called a text. Several string matching algorithms have been designed to solve the problem in linear time; most of them work in two steps, called pattern preprocessing and

Mathematical Biosciences, 1979

... C. COBELLI Laboratorio per Ricerche di Dinamica dei Sistemi a di Bioingegneria, Consiglio Naz... more ... C. COBELLI Laboratorio per Ricerche di Dinamica dei Sistemi a di Bioingegneria, Consiglio Nazionale delle Ricerche, PO Box 1075, 35100 Padova, Italy L. COLUSSI Computing Center ... for any d,f E 0,1,...,n and eE 1,2,...n . (2) p, does not contain any product of the type II,,.jc,y(kij ...

Journal of Algorithms, 1998

... 2 A. Amir, G. Benson and M. Farach, An alphabet-independent approach to two-dimensional patte... more ... 2 A. Amir, G. Benson and M. Farach, An alphabet-independent approach to two-dimensional pattern-matching. ... 11 R. Cole, M. Crochemore, Z. Galil, L. G , R. Hariharan, S. Muthukrishnan, K. Park and W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern ...

Information Processing Letters, 1993

Information Processing Letters, 1983

Information Processing Letters, 1996