Document Open Access Logo

DNA Is a Puzzle Enthusiast

Author Roberto Marangoni

PDF HTML 5

Files

Thumbnail PDF
PDF
OASIcs.Grossi.18.pdf
  • Filesize: 0.65 MB
  • 8 pages
HTML5 Logo HTML (experimental)
OASIcs.Grossi.18.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing → Bioinformatics
  • Theory of computation → Design and analysis of algorithms
Keywords
  • DNA
  • 3D structure
  • PQ trees
  • structural motifs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This article presents a concise summary of research projects in which Roberto Grossi participated, yielding interesting results that were never previously published in research papers. At the time, these studies were deemed too limited and in need of further extensions and generalizations, which were never realized due to a lack of resources. The researches focused on methods for inferring possible three-dimensional DNA conformations based on nucleotide sequence characteristics. Specifically, two key approaches were investigated: the identification of structured motifs for detecting Transcription Factor Binding Sites (TFBS) and the study of nested permutations using PQ-trees. This article describes the obtained results in selected case studies, their potential implications, and the current state of the art in these research areas.

Cite As Get BibTex

Roberto Marangoni. DNA Is a Puzzle Enthusiast. In From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday. Open Access Series in Informatics (OASIcs), Volume 132, pp. 18:1-18:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.Grossi.18

Author Details

Roberto Marangoni
  • Department of Biology, University of Pisa, Italy

References

  1. Sabrina Barchetta, Antonietta La Terza, Patrizia Ballarini, Sandra Pucciarelli, and Cristina Miceli. Combination of two regulatory elements in the tetrahymena thermophila HSP70-1 gene controls heat shock activation. Eukaryotic cell, 7(2):379-386, 2008. Google Scholar
  2. Alessandro Bartolomei. BioMotif: un metodo per la ricerca di motivi altamente strutturati in sequenze genomiche. Master’s thesis, University of Pisa, IT, June 2007. Available at URL: https://etd.adm.unipi.it/theses/available/etd-09252007-092605/unrestricted/Tesi.pdf.
  3. Giovanni Battaglia. Discovery of unconventional patterns for sequence analysis: theory and algorithms. Phd thesis, University of Pisa, Italy, June 2011. Available at https://tesidottorato.depositolegale.it/handle/20.500.14242/128506. URL: https://etd.adm.unipi.it/theses/available/etd-12052011-215104/.
  4. Giovanni Battaglia, Davide Cangelosi, Roberto Grossi, and Nadia Pisanti. Masking patterns in sequences: A new class of motif discovery with don’t cares. Theoretical Computer Science, 410(43):4327-4340, 2009. URL: https://doi.org/10.1016/J.TCS.2009.07.014.
  5. Giovanni Battaglia, Roberto Grossi, and Noemi Scutella. Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings. Information and Computation, 219:58-70, 2012. URL: https://doi.org/10.1016/J.IC.2012.08.005.
  6. Kellogg S Booth and George S Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. Journal of computer and system sciences, 13(3):335-379, 1976. URL: https://doi.org/10.1016/S0022-0000(76)80045-1.
  7. Giuseppe Camposeo. Scoperta di pattern ripetuti mediante l’uso di alberi pq. Master’s thesis, University of Pisa, IT, June 2007. Available at URL: https://etd.adm.unipi.it/theses/available/etd-03132008-103339/unrestricted/Tesi.pdf.
  8. Jaime A Castro-Mondragon, Rafael Riudavets-Puig, Ieva Rauluseviciute, Roza Berhanu Lemma, Laura Turchi, Romain Blanc-Mathieu, Jeremy Lucas, Paul Boddie, Aziz Khan, Nicolás Manosalva Pérez, et al. JASPAR 2022: the 9th release of the open-access database of transcription factor binding profiles. Nucleic acids research, 50(D1):D165-D173, 2022. Google Scholar
  9. Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, and Søren Vind. Motif trie: An efficient text index for pattern discovery with don't cares. Theoretical Computer Science, 710:74-87, 2018. URL: https://doi.org/10.1016/J.TCS.2017.04.012.
  10. Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, and Fabio Vandin. MADMX: A strategy for maximal dense motif extraction. Journal of Computational Biology, 18(4):535-545, 2011. URL: https://doi.org/10.1089/CMB.2010.0177.
  11. Rosario Lombardo. Algoritmi efficienti per la scoperta di pattern ripetuti a intervalli. Master’s thesis, University of Pisa, IT, June 2008. Available at URL: https://etd.adm.unipi.it/theses/available/etd-06182008-085952/unrestricted/Lombardo_2008__Laurea_Magistrale_in_Informatica.pdf.
  12. SG Lushnikov, AV Dmitriev, Alexander Ivanovich Fedoseev, Gennady Aleksandrovich Zakharov, AV Zhuravlev, Anna Vladimirovna Medvedeva, BF Schegolev, and EV Savvateeva-Popova. Low-frequency dynamics of DNA in Brillouin light scattering spectra. JETP letters, 98:735-741, 2014. Google Scholar
  13. Hisako Ooka, Kouji Satoh, Koji Doi, Toshifumi Nagata, Yasuhiro Otomo, Kazuo Murakami, Kenichi Matsubara, Naoki Osato, Jun Kawai, Piero Carninci, et al. Comprehensive analysis of NAC family genes in oryza sativa and arabidopsis thaliana. DNA research, 10(6):239-247, 2003. Google Scholar
  14. Eden Ozeri, Meirav Zehavi, and Michal Ziv-Ukelson. New algorithms for structure informed genome rearrangement. Algorithms for Molecular Biology, 18(1):17, 2023. URL: https://doi.org/10.1186/S13015-023-00239-X.
  15. Nadia Pisanti, Alexandra M Carvalho, Laurent Marsan, and Marie-France Sagot. RISOTTO: fast extraction of motifs with mismatches. In LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006. Proceedings 7, pages 757-768. Springer, 2006. URL: https://doi.org/10.1007/11682462_69.
  16. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and M F Sagot. A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings 28, pages 622-631. Springer, 2003. URL: https://doi.org/10.1007/978-3-540-45138-9_56.
  17. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot. Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2(1):40-50, 2005. URL: https://doi.org/10.1109/TCBB.2005.5.
  18. Ieva Rauluseviciute, Rafael Riudavets-Puig, Romain Blanc-Mathieu, Jaime A Castro-Mondragon, Katalin Ferenc, Vipin Kumar, Roza Berhanu Lemma, Jérémy Lucas, Jeanne Chèneby, Damir Baranasic, et al. JASPAR 2024: 20th anniversary of the open-access database of transcription factor binding profiles. Nucleic acids research, 52(D1):D174-D182, 2024. Google Scholar
  19. Alexander Rich. DNA comes in many forms. Gene, 135(1-2):99-109, 1993. Google Scholar
  20. Andrew Travers and Georgi Muskhelishvili. DNA structure and function. The FEBS journal, 282(12):2279-2295, 2015. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact