1. Readability Combinatorial Pattern Matching (CPM) June 29, 2015 Rayan Chikhi, CNRS Lille Sofya Raskhodnikova, Penn State Paul Medvedev, Penn State Martin Milanič, University of Primorska

2. Overlap Digraph (definition) ACGTAGTAAC CCCCTGGACT

3. Questions ?? ??

4. Readability in the digraph model ACGTAGTAAC CCCCTGGACT

5. Readability in the bipartite graph model ACA CAC AGA CAT

6. Examples 41 12 23 34 41

7. Is there a simple and useful string-free formulation of readability?

8. P 4 -rule and P 4 Lemma

9. Trees AA

10. Proof of claim (key idea) AA

11. For cycles, theorem not true 2 4 2 3 1 2 3

12. 4 2 3 3 1 1 1

13. General bipartite graphs

14. How large can readability be?

15. Distinctness

16. Hadamard Graphs 00 01 10 11 00 01 10 11

17. Trees

18. Conclusions

19. The end Combinatorial Pattern Matching (CPM) June 29, 2015 Rayan Chikhi, CNRS Lille Sofya Raskhodnikova, Penn State Paul Medvedev, Penn State Martin Milanič, University of Primorska

20. General graphs

21. Questions/Results Do there exists graphs with readability