**
Lecture in Computational Biology on 25 March 2002
**

**Content of a lecture on 25 March 2002**

In this lecture,
we have exposed an algorithm for the
recognition of matrices with the **consecutive ones property**.
The motivation for the study of this problem
came out from an approach to Physical Mapping:
Hybridization Mapping.
More precisely, within Hybridization Mapping,
two models from
algorithmic graph theory and combinatorics which prove to be of
pertinence are.

- Interval Graph Recognition;
- Recognition of matrices with the
**consecutive ones property**.

- J.C. Setubal and J. Meidanis,
*Introduction to Computational Molecular Biology*, PWS Publishing Company. An International Thomson Publishing Company, (1997)

We then tried to dig out some of the difficulties of the

**Homeworks**

The algorithm we have seen today is by no means
a trivial algorithm.
My first ambition in today's lecture was to provided you with the key
to better appreciate the general philosophy of the algorithm.
I think it would now pay a lot if you could find the time
to come back to the algorithm and check it in its finest details.
The algorithm for the
recognition of matrices with the **consecutive ones property**
is exposed in Chapter 5 of the following book.

- J.C. Setubal and J. Meidanis,
*Introduction to Computational Molecular Biology*, PWS Publishing Company. An International Thomson Publishing Company, (1997)

Have a nice reading and self-study!

**P.S. **
Some of you could not attend today's lecture
until the end.
But even if you did attend the lecture until the end,
you may be interested
in a second chance to think again about the algorithm
together with others.
We will fix such an extra lecture after Easten.
Clearly,
in that lecture we will also be free to enter further issues and topics,
as your curiosity will ask for.

25-March-2002 |
© Dipartimento di Matematica - Università di Trento |