Manuela Montangero

Manu's picture

Research Associate in Computer Science
Ricercatore Confermato INF/01


Dipartimento di Scienze Fisiche, Informatiche e Matematiche
Università degli Studi di Modena e Reggio Emilia
Via Giuseppe Campi, 213/b 41125 Modena (Italy)
Tel: 059 2058325

and

Istituto di Informatica e Telematica
Consiglio Nazionale delle Ricerche
Via Moruzzi 1
56124 Pisa (Italy)

Email Address:  
-----------------------------
-----------------------------

Short Resume

Manuela Montangero is a research associate (ricercatore) at the Dipartimento di Scienze Fisiche, Informatiche e Matematiche of the University of Modena and Reggio Emilia. Her research interests include distributed algorithms, combinatorics and bioinformatics.

She got her Laurea cum Laude in Computer Science from the University of Pisa in 1996. In 2001 she got a PhD in Computer Science from the University of Salerno. From 2001 to 2004 she was at the Istituto di Informatica e Telematica of the National Research Council (CNR) of Pisa, with a PostDoc Fellowship (assegno di ricerca) at first and a temporary research associate position (ricercatore a tempo determinato) later. From 2005 to 2012 she was research associate at the Dipartimento di Ingegneria dell'Informazione , at the University of Modena and Reggio Emilia. She is currently also a collaborator of the Istituto di Informatica e Telematica , National Research Council (CNR) in Pisa.

Her Erdös Number is 2: P. Erdös --> M. Aigner --> M. Montangero.

-----------------------------

Papers

2015
  • M. Montangero, M. Furini, TRank: ranking Twitter users according to specific topics, Proc. of the 12th International IEEE Consumer Communications and Networking Conference (CCNC2015), Las Vegas, Nevada, USA, 9-12 January 2015. IEEE Press. BEST PAPER RUNNER-UP. [ .pdf ]
  • M. Leoncini, M. Montangero, M. Pellegrini, K. Panucia Tillan. CMStalker: a Combinatorial Tool for Composite Motif Discovery, IEEE/ACM Transactions on Computational Biology and Bioinformatics 12(5): 1123-1136, 2015. [ .pdf ]
  • K. Panucia Tillan, M. Leoncini, M. Montangero. Investigating Power and Limitations of Ensemble Motif Finders Using CE3 Metapredictor, Current Bioinformatics 10(2): 124-138, 2015.
2014
  • M. Leoncini, M. Montangero, M. Pellegrini, K. Panucia Tillan. CMStalker: a Combinatorial Tool for Composite Motif Discovery, IEEE/ACM Transactions on Computational Biology and Bioinformatics (Epub ahead of print).
2013
  • K. Panucia Tillan, M. Leoncini, M. Montangero. CE3: Customizable and Easily Extensible Ensemble Tool for Motif Discovery, Proc. of the International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO2013). [ .pdf ]
  • M. Leoncini, M. Montangero, M. Pellegrini, K. Panucia Tillan. CMF: a Combinatorial Tool to Find Composite Motifs, Proc. of the 7th Learning and Intelligent OptimizatioN Conference (LION 7). [ .pdf ]
2012
  • C. Grana, M. Montangero, D. Borghesani. Optimal Decision Trees for Local Image Processing Algorithms, Pattern Recognition Letters, Volume 33, Issue 16, pp. 2302-2310, 2012. [ .pdf ]
  • M. Federico, M. Leoncini, M. Montangero, P. Valente. Direct vs 2-Stage Approaches to Structured Motif Finding, Algorithms for Molecular Biology, 2012 Aug 21;7(1):20. (Epub ahead of print) [ .pdf ]
2011
  • L. Palmieri, M. Federico, M. Leoncini and M. Montangero. A High Performing Tool for Residue Solvent Accessibility Prediction using Sequence Homology, Proc. of the 2nd International Conference on Information Technology in Bio- and Medical Informatics (ITBAM 2011), LNCS 6865, pp. 138-152, 2011. [ .pdf ]
  • C. Grana, M. Montangero, D. Borghesani, R. Cucchiara, Optimal Decision Trees Generation from OR-Decision Tables, Proc. of 16th International Conference on Image Analysis and Processing (ICIAP 2011), LNCS 6978, pp. 443-452, 2011.
2010
  • M. Furini, F. Geraci, M. Montangero, M. Pellegrini, STIMO: STIll and MOving Video Storyborad for the Web Scenario, Multimedia Tools and Applications, Volume 46, Issue 1 (2010), Page 47.
  • [ .pdf ] [ .bibtex ]
2009
  • F. Geraci, M. Leoncini, M. Montangero, M. Pellegrini, M.E. Renda, K-Boost: a Scalable Algorithm for High-Quality Clustering of Microarray Gene Expression Data, Journal of Computational Biology 16(6), pp. 859-873, 2009.
  • M. Federico, P. Valente, M. Leoncini, M. Montangero, R. Cavicchioli, An Efficient Algorithm for Planted Composit Motif Extraction, in Proc.of 6th ACM International Conference on Computing Frotiers, 2009.
2008
  • M. Furini, F. Geraci, M. Montangero, M. Pellegrini, On Using Clustering Algorithms to Produce Video Abstracts for the Web Scenario, Proc. of the 5th IEEE Consumer Communications and Networking Conference (CCNC08).
  • M. Furini, M. Montangero, The Impact of Incentive Mechanisms in Multi-Channel Mobile Music Distribution, Multimedia Tools and Applications Journal, Vol. 37, No. 3, pp. 365-382, Springer Netherlands Editor, 2008. [ .pdf ] [ .bibtex ]
2007
  • M. Furini, F. Geraci, M. Montangero, M. Pellegrini, VISTO: VIsual STOryboard for Web Video Browsing, in Proc. ACM 6th International Conference on Image and Video Retrieval (CIVR07), 2007. BEST PAPER RUNNER-UP.
  • F. Geraci, M. Leoncini, M. Montangero, M. Pellegrini, M.E. Renda, FPF-SB: a Scalable Algorithm for Microarray Gene Expression Data Clustering, Proc. 12th International Conference on Human-Computer Interaction, Beijing, P.R. China, July 2007.
2006
  • M. Furini, M. Montangero, The Use of Incentive Mechanisms in Multi-Channel Mobile Music Distribution , in Proc. IEEE International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution 2006 (AXMEDIS2006).
  • G. De Marco, M. Leoncini, and M. Montangero, Distributed Algorithm for a Color Assignment on Asynchronous Rings , Proc. 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS06), 2006.
  • C.Kaklamanis, D. Krizanc, M. Montangero, P. Persiano, Efficient Automatic Simulation of Parallel Algorithms on Network of Workstations, Discrete Applied Mathematics 154, pp. 1500-1509, 2006.
2005
  • M. Aigner, G.De Marco, M. Montangero, The Plurality Problem with Three Colors and More, Theoretical Computer Science 337, pp. 319-330, 2005.
  • C.Galdi, C. Kaklamanis, M. Montangero, P. Persiano, Station Placement in Networks, Parallel Processing Letters, Vol 15 (1-2), pp. 117-129, 2005.
2004
  • B.Codenotti, G. De Marco, M. Leoncini, M. Montangero, M. Santini, Approximation Algorithms for a Hierarchically Structured Bin Packing, Information Processing Letters, Vol. 89 (5), pp. 215-221, 2004.
  • M. Aigner, G. De Marco, M. Montangero, The Pluraity Problem with Three Colors, Proc. 21st International Symposium on Theoretical Aspects of Computer Science (STACS04), LNCS 2996, pp 513- 521, 2004.
Earlier
  • B. Codenotti, G. De Marco, M. Leoncini, M. Montangero, Distributed Algorithms for Certain Assigment Problems, Proc. 5th International Conference on Principles of Distributed Systems (OPODIS01), Studia Informatica Universalis, Special Issue Vol 2, HS. 2, pp. 91-112.
  • C. Galdi, C. Kaklamanis, M. Montangero, P. Persiano, Optimal and Approxiamte Station Placement in Networks (with Application to Multicasting and Space Efficient Traversals), Proc. 18th International Symposium on Theoretical Aspects of Computer Science (STACS01), LNCS 2010, pp. 271-282, 2001.
  • C. Kaklamanis, D. Krizanc, M. Montangero, P. Persiano, Efficient Automatic Simulation of Parallel Algorithms on Network of Workstations, Proc. Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE00), pp. 191-201, ed. Carleton Scientific.
  • P. Ferragina, R. Grossi, M. Montangero, On Updating Suffix Tree Labels, Theoretical Computer Science, Vol 201, pp. 249-262, 1998.
  • P. Ferragina, R. Grossi, M. Montangero, A Note on Updating Suffix Tree Labels, Proc. 3rd Italian Conference on Algorithms and Complexity (CIAC97), LNCS 1203, pp. 181-192, 1997.

-----------------------------

Didattica/Teaching (in Italian)

-----------------------------

Previous Affiliations

-----------------------------