References of "Lenzini, Gabriele 50002200"
     in
Bookmark and Share    
Peer Reviewed
See detailSequence Comparison: Close and Open problems
Lenzini, Gabriele UL

in Proc.~of Workshop ``La matematizzazione della Biologia: storia e problematiche attuali'', Arcidosso (GR), Italy (1998)

Comparing sequences is a very important activity both in computer science and in a many other areas as well. For example thank to text editors, everyone knows the particular instance of a sequence ... [more ▼]

Comparing sequences is a very important activity both in computer science and in a many other areas as well. For example thank to text editors, everyone knows the particular instance of a sequence comparison problem knonw as ``string mathcing problem''. It consists in searching a given work eventually with errors, in a long text. Among the wide literature about sequence comparison problems this paper focuses on those problems which arestricty related with molecular biology. These problems are significant representatives of formal problems in the ``computational biology'', a discipline recently born whose aim is the formalization and the analysis of biological discrete problems. http://matrix.iei.pi.cnr.it/~lenzini/papers/pcr-cissc98.ps.gz 2018-09-18 22:51:18 +0000 2019-06-15 18:30:42 +0200 [less ▲]

Detailed reference viewed: 17 (0 UL)
Peer Reviewed
See detailAlgorithms For Phylogeny Reconstruction In a New Mathematical Model
Lenzini, Gabriele UL; Marianelli, Silvia

in Calcolo (1997), 1-4(34), 1-24

The evolutionary history of a set of species is represented by a tree called phylogenetic tree or phylogeny. Its structure depends on precise biological assumptions about the evolution of species ... [more ▼]

The evolutionary history of a set of species is represented by a tree called phylogenetic tree or phylogeny. Its structure depends on precise biological assumptions about the evolution of species. Problems related to phylogeny reconstruction (i.e., finding a tree representation of information regarding a set of items) are widely studied in computer science. Most of these problems have found to be NP-hard. Sometimes they can solved polynomially if appropriate restrictions on the structure of the tree are fixed. This paper summarizes the most recent problems and results in phylogeny reconstruction, and introduces an innovative tree model, called Phylogenetic Parsimonious Tree, which is justified by significant biological hypothesis. Using PPT two problems are studied: the existence and the reconstruction of a tree both when sequences of characters and partial order on interspecies distances are given. We rove complexity results that confirm the hardness of this class of problems. [less ▲]

Detailed reference viewed: 23 (3 UL)
See detailAutomatic Phylogeny Reconstruction Under a New Hypothesis
Lenzini, Gabriele UL; Marianelli, Silvia; Luccio, Fabrizio et al

Scientific Conference (1996)

Detailed reference viewed: 18 (0 UL)