Marco Pellegrini

Orcid: 0000-0003-3151-9481

Affiliations:
  • IIT-CNR, Pisa, Italy
  • King's College, London, UK (1991 - 1995)
  • New York University, NY, USA (PhD 1991)


According to our database1, Marco Pellegrini authored at least 69 papers between 1990 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Community Detection in Biological Networks.
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

Dot2dot: accurate whole-genome tandem repeats discovery.
Bioinform., 2019

2018
miRandola 2017: a curated knowledge base of non-invasive biomarkers.
Nucleic Acids Res., 2018

2016
Protein complex prediction for large protein protein interaction networks with the Core&Peel method.
BMC Bioinform., 2016

2015
CMStalker: A Combinatorial Tool for Composite Motif Discovery.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Preface.
Eur. J. Comb., 2015

Analysis of Next-Generation Sequencing Data of miRNA for the Prediction of Breast Cancer.
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2015

From Literature to Knowledge: Exploiting PubMed to Answer Biomedical Questions in Natural Language.
Proceedings of the Information Technology in Bio- and Medical Informatics, 2015

CNVScan: detecting borderline copy number variations in NGS data via scan statistics.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2013
A Framework to Evaluate Information Quality in Public Administration Website.
Pac. Asia J. Assoc. Inf. Syst., 2013

CMF: A Combinatorial Tool to Find Composite Motifs.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

A New Framework for Distilling Higher Quality Information from Health Data via Social Network Analysis.
Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

2012
Detecting dense communities in large social and information networks with the Core & Peel algorithm
CoRR, 2012

Tandem repeats discovery service (TReaDS) applied to finding novel cis-acting factors in repeat expansion diseases.
BMC Bioinform., 2012

Ab initio detection of fuzzy amino acid tandem repeats in protein sequences.
BMC Bioinform., 2012

Fast Exact Computation of betweenness Centrality in Social Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Medium sized crawling made fast and easy through Lumbricus webis.
Proceedings of the International Conference on Machine Learning and Cybernetics, 2011

Detecting fuzzy amino acid tandem repeats in protein sequences.
Proceedings of the ACM International Conference on Bioinformatics, 2011

2010
STIMO: STIll and MOving video storyboard for the web scenario.
Multim. Tools Appl., 2010

Accurate Reconstruction of Single Individual Haplotypes for Personalized Medicine.
ERCIM News, 2010

TRStalker: an efficient heuristic for finding fuzzy tandem repeats.
Bioinform., 2010

On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis.
Proceedings of the E-Commerce and Web Technologies, 11th International Conference, 2010

<i>ReHap</i>: A Framework for Single Individual Haplotyping from Next-Generation Sequencing Data.
Proceedings of the Biomedical Engineering Systems and Technologies, 2010

ReHap: An Integrated System for the Haplotype Assembly Problem from Shotgun Sequencing Data.
Proceedings of the BIOINFORMATICS 2010, 2010

2009
Extraction and classification of dense implicit communities in the Web graph.
ACM Trans. Web, 2009

K-Boost: A Scalable Algorithm for High-Quality Clustering of Microarray Gene Expression Data.
J. Comput. Biol., 2009

VISTO: Visual Storyboard for Web Video Browsing, Searching and Indexing.
ERCIM News, 2009

An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem.
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009

2008
SpeedHap: An Accurate Heuristic for the Single Individual SNP Haplotyping Problem with Many Gaps, High Reading Error Rate and Low Coverage.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

AMIC@: All MIcroarray Clusterings @ once.
Nucleic Acids Res., 2008

Dynamic user-defined similarity searching in semi-structured text retrieval.
Proceedings of the 3rd International ICST Conference on Scalable Information Systems, 2008

On Using Clustering Algorithms to Produce Video Abstracts for the Web Scenario.
Proceedings of the 5th IEEE Consumer Communications and Networking Conference, 2008

2007
Efficient IP table lookup via adaptive stratified trees with selective reconstructions.
ACM J. Exp. Algorithmics, 2007

Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution.
Internet Math., 2007

High-Throughput Analysis of Gene Expression Data for Personalized Medicine.
ERCIM News, 2007

Faster deterministic wakeup in multiple access channels.
Discret. Appl. Math., 2007

Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm.
Comput. Networks, 2007

Extraction and classification of dense communities in the web.
Proceedings of the 16th International Conference on World Wide Web, 2007

A Fast and Accurate Heuristic for the Single Individual SNP Haplotyping Problem with Many Gaps, High Reading Error Rate and Low Coverage.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

<i>FPF-SB</i> : A Scalable Algorithm for Microarray Gene Expression Data Clustering.
Proceedings of the Digital Human Modeling, 2007

VISTO: visual storyboard for web video browsing.
Proceedings of the 6th ACM International Conference on Image and Video Retrieval, 2007

2006
Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution.
Proceedings of the String Processing and Information Retrieval, 2006

A scalable algorithm for high-quality clustering of web snippets.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005
Packet classification via improved space decomposition techniques.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
Ray Shooting and Lines in Space.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2002
On computing the diameter of a point set in high dimensional Euclidean space.
Theor. Comput. Sci., 2002

2001
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1999
Rendering Equation Revisited: How to Avoid Explicit Visibility Computations.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Geometric Approach to Computing Higher Order Form Factors.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Electrostatic Fields Without Singularities: Theory, Algorithms and Error Analysis.
J. ACM, 1998

1997
Monte Carlo Approximation of Form Factors with Error Bounded a Priori.
Discret. Comput. Geom., 1997

On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching.
Algorithmica, 1997

1996
On Point Location and Motion Planning among Simplices.
SIAM J. Comput., 1996

Repetitive Hidden Surface Removal for Polyhedra.
J. Algorithms, 1996

Electrostatic Fields without Singularities: Theory and Algorithms.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1994
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space.
SIAM J. Comput., 1994

On Lines Missing Polyhedral Sets in 3-Space.
Discret. Comput. Geom., 1994

1993
Counting Circular Arc Intersections.
SIAM J. Comput., 1993

On the Zone of a Surface in a Hyperplane Arrangement.
Discret. Comput. Geom., 1993

Lower Bounds on Stabbing Lines in 3-space.
Comput. Geom., 1993

Ray Shooting on Triangles in 3-Space.
Algorithmica, 1993

Repetivive Hidden-Surface-Removal for Polyhedral Scenes.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992
Finding Stabbing Lines in 3-Space.
Discret. Comput. Geom., 1992

Incidence and Nearest-Neighbor Problems for Lines in 3-Space.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Combinatorial and algorithmic analysis of stabbing and visibility problems in three-dimensional space.
PhD thesis, 1991

SetLog, a tool for experimenting with new semantics.
ACM SIGPLAN Notices, 1991

Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space.
Proceedings of the Algorithms and Data Structures, 1991

Finding Stabbing Lines in 3-Dimensional Space.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Stabbing and Ray Shooting in 3 Dimensional Space.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990


  Loading...