Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
start [2018/09/06 10:44]
Nicolas Schabanel [Publications]
start [2019/05/29 12:47] (current)
Nicolas Schabanel [Past Event]
Line 4: Line 4:
 </​const>​ </​const>​
  
-<columns 100% center 440 left - >+<columns 100% center 440 center ​- >
 {{ :​ma_pomme.png?​440x348 |Ma pomme}}\\ {{ :​ma_pomme.png?​440x348 |Ma pomme}}\\
-{{ :email-cnrs.png?250x70 ​|Courriel}}+{{::email-ens.png?300x88|}}
  
 <​newcolumn>​ <​newcolumn>​
Line 30: Line 30:
  
 ==== Past Event  ==== ==== Past Event  ====
 +  * **[[https://​remila60.sciencesconf.org/​|Conférence en l'​honneur d'​Éric Rémila pour ses 60 ans]]**, ÉNS de Lyon, France, May 28, 2019\\ //​(Co-organizer with Kevin Perrot) Founded by ANR, LIP and Codrin Nichitiu.//  ​
   * **[[%%siteRoot%%/​workshop/​ComputingWithMolecularGeometry/​|Workshop:​ Computing with molecular geometry]]**,​ Villa Finaly, Florence, Italie, Nov. 20-23, 2017\\ //​(Co-organizer with Claire Lesieur and Damien Woods) Founded by [[http://​www.ixxi.fr|IXXI]],​ [[https://​tapdance.inria.fr/​|Tapdance]] and la [[http://​www.cnrs.fr/​mi/​|mission pour l'​interdisciplinarité du CNRS]]//   * **[[%%siteRoot%%/​workshop/​ComputingWithMolecularGeometry/​|Workshop:​ Computing with molecular geometry]]**,​ Villa Finaly, Florence, Italie, Nov. 20-23, 2017\\ //​(Co-organizer with Claire Lesieur and Damien Woods) Founded by [[http://​www.ixxi.fr|IXXI]],​ [[https://​tapdance.inria.fr/​|Tapdance]] and la [[http://​www.cnrs.fr/​mi/​|mission pour l'​interdisciplinarité du CNRS]]//
   * **[[http://​www.irif.univ-paris-diderot.fr/​~nschaban/​GT-COA/​Journees_2017|6èmes journées]] du [[http://​www.irif.univ-paris-diderot.fr/​~nschaban/​GT-COA/​|GT CoA]]** (Complexités et Algorithmes),​ LIP, Lyon, Nov. 27-28, 2017   * **[[http://​www.irif.univ-paris-diderot.fr/​~nschaban/​GT-COA/​Journees_2017|6èmes journées]] du [[http://​www.irif.univ-paris-diderot.fr/​~nschaban/​GT-COA/​|GT CoA]]** (Complexités et Algorithmes),​ LIP, Lyon, Nov. 27-28, 2017
Line 47: Line 48:
  
 ==== Students ==== ==== Students ====
-  * Nicolas ​**Blanchard** (M2, 2015; PhD advisor 2016-)+  * Daria **Pchelina** (M1, 2019) 
 +  * Nikola ​**Blanchard** (M2, 2015; PhD advisor 2016-2019)
   * Alberto **Vera Azócar** (U. Chile, several research internships 2013, 2015)   * Alberto **Vera Azócar** (U. Chile, several research internships 2013, 2015)
   * Damien **Regnault** (PhD co-advisor with Éric Thierry, 2005-2008)   * Damien **Regnault** (PhD co-advisor with Éric Thierry, 2005-2008)
Line 55: Line 57:
  
 ==== Publications ==== ==== Publications ====
 +  *  **2019**
 +     * **[[https://​www.mdpi.com/​1422-0067/​20/​9/​2259|Oritatami:​ A Computational Model for Molecular Co-Transcriptional Folding ]]** [ [[%%publiRoot%%/​2019/​2019-IJMS-GearyMeunierSchabanelSeki.pdf|PDF]] & [[%%publiRoot%%/​2019/​2019-IJMS-GearyMeunierSchabanelSeki-s1.pdf|supplementary materials]] ]\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. [[https://​www.mdpi.com/​journal/​ijms|IJMS (Int. J. of Molecular Sciences)]],​ Special Issue Nucleic Acid Nanotechnology,​ 2019, 20(9), 2259.\\ [[https://​doi.org/​10.3390/​ijms20092259]] ​
   *  **2018**    *  **2018**
-     * **[[%%publiRoot%%/​2018/​2018-ISAAC-OritatamiTuring-GearyMeunierSchabanelSeki.pdf|Proving the Turing Universality of Oritatami Co-Transcriptional Folding]]** [ [[http://​www.irif.fr/​~nschaban/​oritatami/​|Supplementary materials]] ]\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. [[http://​isaac2018.ie.nthu.edu.tw/​|ISAAC 2018]], Jiaoxi, Yilan County, Taiwan, Dec. 2018. +     * **[[%%publiRoot%%/​2018/​2018-ISAAC-OritatamiTuring-GearyMeunierSchabanelSeki.pdf|Proving the Turing Universality of Oritatami Co-Transcriptional Folding]]** [ [[http://​www.irif.fr/​~nschaban/​oritatami/​|Supplementary materials]] ]\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. [[http://​isaac2018.ie.nthu.edu.tw/​|ISAAC 2018]], LIPIcs.ISAAC.2018.23:​1-23:​13, Jiaoxi, Yilan County, Taiwan, Dec. 2018. [ [[https://​arxiv.org/​abs/​1508.00510|Arxiv]] ] 
-     * **[[%%publiRoot%%/​2018/​2018-DNA24-OritatamiShapes-DemaineHendricksOlsenPatitzRogersSchabanelSekiThomas.pdf|Know When to Fold ’Em: Self-Assembly of Shapes by Folding in Oritatami]]**\\ Erik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, and Hadley Thomas. [[http://​dna24sdnu.com/​|DNA24]],​ Jinan, China, Oct. 2018.\\ Invited talk at [[https://​ucnc2018.lacl.fr/​self-assembly/​|UCNC2018 Self-assembly,​ geometry and computation workshop]], Fontainebleau,​ June 2018. \\ //:!: Download the iOS app [[https://​itunes.apple.com/​us/​app/​id1335581323|Scary Pacman]] implementing our algorithms [ [[https://​hub.darcs.net/​nikaoOoOoO/​OritatamiScaling|source code]] ]//+     * **[[%%publiRoot%%/​2018/​2018-DNA24-OritatamiShapes-DemaineHendricksOlsenPatitzRogersSchabanelSekiThomas.pdf|Know When to Fold ’Em: Self-Assembly of Shapes by Folding in Oritatami]]**\\ Erik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, and Hadley Thomas. [[http://​dna24sdnu.com/​|DNA24]], LNCS 11145:19-36, Jinan, China, Oct. 2018.\\ Invited talk at [[https://​ucnc2018.lacl.fr/​self-assembly/​|UCNC2018 Self-assembly,​ geometry and computation workshop]], Fontainebleau,​ June 2018. \\ //:!: Download the iOS app [[https://​itunes.apple.com/​us/​app/​id1335581323|Scary Pacman]] implementing our algorithms [ [[https://​hub.darcs.net/​nikaoOoOoO/​OritatamiScaling|source code]] ]//
   *  **2017**    *  **2017**
-     * **[[%%publiRoot%%/​2017/​2017-Oritatami-GearyMeunierSchabanelSeki|Proving the Turing Universality of Oritatami Co-Transcriptional Folding]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //​Submitted//,​ 65 pages, july 2017. [ [[http://​perso.ens-lyon.fr/​nicolas.schabanel/​oritatami/​|Supplementary materials]] ] 
      * **[[%%publiRoot%%/​2017/​2017-Walcom-BlanchardSchabanel.pdf|Dynamic Facility Location: Minimizing the Sum of Radii]]**\\ Nicolas K. Blanchard, Nicolas Schabanel. //​[[http://​walcom2017.nctu.edu.tw/​index.html|WALCOM]]//,​ LNCS 10167:​30-41,​ march 2017.      * **[[%%publiRoot%%/​2017/​2017-Walcom-BlanchardSchabanel.pdf|Dynamic Facility Location: Minimizing the Sum of Radii]]**\\ Nicolas K. Blanchard, Nicolas Schabanel. //​[[http://​walcom2017.nctu.edu.tw/​index.html|WALCOM]]//,​ LNCS 10167:​30-41,​ march 2017.
   * **2016**   * **2016**
     * **[[%%publiRoot%%/​2016/​2016-Automata-Schabanel.pdf|Oritatami systems: a computational model for co-transcriptional folding]]**\\ Nicolas Schabanel. **Invited plenary talk** at //​[[http://​automata2016.ini.uzh.ch/​|Automata]]//,​ Jun. 2016.      * **[[%%publiRoot%%/​2016/​2016-Automata-Schabanel.pdf|Oritatami systems: a computational model for co-transcriptional folding]]**\\ Nicolas Schabanel. **Invited plenary talk** at //​[[http://​automata2016.ini.uzh.ch/​|Automata]]//,​ Jun. 2016. 
     * **[[%%publiRoot%%/​2016/​2016-MFCS-GearyMeunierSchabanelSeki.pdf|Programming biomolecules that fold greedily during transcription]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //​[[http://​mfcs.ki.agh.edu.pl|MFCS]]//,​ LIPIcs 58, 43:1-43:14, Aug. 2016.     * **[[%%publiRoot%%/​2016/​2016-MFCS-GearyMeunierSchabanelSeki.pdf|Programming biomolecules that fold greedily during transcription]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //​[[http://​mfcs.ki.agh.edu.pl|MFCS]]//,​ LIPIcs 58, 43:1-43:14, Aug. 2016.
-    * **[[%%publiRoot%%/2016/2016-HALG-GearyMeunierSchabanelSeki.pdf|Folding Turing is hard but feasible]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki.//​[[http://​highlightsofalgorithms.org/​program/​|HALG]]//,​ Jun. 2016.+    * **[[https://arxiv.org/​abs/​1508.00510|Folding Turing is hard but feasible]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki.//​[[http://​highlightsofalgorithms.org/​program/​|HALG]]//,​ Jun. 2016.
  
   *  **2015**    *  **2015**