Andrea Cassioli

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Antonio Mucherino

> Home > Persons > Andrea Cassioli

Publications

2015
[j13]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/bmcbi/CassioliBBMALNL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bmcbi/CassioliBBMALNL15
Andrea Cassioli, Benjamin Bardiaux, Guillaume Bouvier, Antonio Mucherino, Rafael Alves, Leo Liberti, Michael Nilges, Carlile Lavor, Thérèse E. Malliavin:
An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinform. 16: 23:1-23:15 (2015)
2014
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/CostaMLCCM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/CostaMLCCM14
Virginia Costa, Antonio Mucherino, Carlile Lavor, Andrea Cassioli, Luiz Mariano Carvalho, Nelson Maculan:
Discretization orders for protein side chains. J. Glob. Optim. 60(2): 333-349 (2014)
2013
[c1]
- view
  - electronic edition @ ugr.es (open access)
  - details & citations
- export record
  dblp key:
  - conf/iwbbio/AlvesCMLL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwbbio/AlvesCMLL13
Rafael Alves, Andrea Cassioli, Antonio Mucherino, Carlile Lavor, Leo Liberti:
The integration of Clifford Algebra in the iBP algorithm for the DMDGP. IWBBIO 2013: 745-746

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.