- 19
- 7
- 2
- 1
Stéphane Vialette
Publications de Stéphane Vialette
29
Documents
Publications
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 29
- 11
- 9
- 7
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 3
- 5
- 4
- 3
- 2
- 3
- 3
- 2
MSPT: An open-source motion simulator for proton therapyBiomedical Physics & Engineering Express, 2015, 1 (3), 12 pp
Article dans une revue
hal-01171799v1
|
|
|
Spot Weight Adaptation for Moving Target in Spot Scanning Proton TherapyFrontiers in Oncology, 2015, 5 (119), pp.1-7. ⟨10.3389/fonc.2015.00119⟩
Article dans une revue
hal-01151923v1
|
|
Minimum Mosaic Inference of a Set of RecombinantsInternational Journal of Foundations of Computer Science, 2013, 24 (1), pp.51-66. ⟨10.1142/S0129054113400042⟩
Article dans une revue
hal-00679269v1
|
|
A faster algorithm for finding minimum Tucker submatricesTheory of Computing Systems, 2012, 51 (3), pp.270-281. ⟨10.1007/s00224-012-9388-1⟩
Article dans une revue
hal-00657340v1
|
|
Median of an odd number of permutationsPure Mathematics and Applications, 2011, 21 (2), pp.161 - 175
Article dans une revue
hal-00619773v1
|
|
Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex SetIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (4), pp.628-635
Article dans une revue
hal-00619763v1
|
|
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure ConstraintsJournal of Discrete Algorithms, 2008, 6 (4), pp.618-626
Article dans une revue
hal-00416442v1
|
|
Comparing Genomes with Duplications: a Computational Complexity Point of ViewACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534. ⟨10.1109/TCBB.2007.1069⟩
Article dans une revue
hal-00417720v1
|
|
Extracting Constrained 2-Interval Subsets in 2-Interval SetsTheoretical Computer Science, 2007, 385 (1-3), pp.241-263
Article dans une revue
hal-00417717v1
|
|
What makes the Arc-Preserving Subsequence problem hard ?LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36
Article dans une revue
hal-00417738v1
|
|
Towards unlocking the full potential of Multileaf Collimators40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149
Communication dans un congrès
hal-00859708v1
|
|
The longest common subsequence problem with crossing-free arc-annotated sequences19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. pp. 130--142
Communication dans un congrès
hal-00713431v1
|
|
Hardness of longest common subsequence for sequences with bounded run-lengths23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148, ⟨10.1007/978-3-642-31265-6_11⟩
Communication dans un congrès
hal-00683311v1
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Communication dans un congrès
hal-00606375v1
|
|
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. pp.373-384, ⟨10.1007/978-3-642-20712-9_29⟩
Communication dans un congrès
hal-00620378v1
|
|
Minimum Mosaic Inference of a Set of Recombinants17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Communication dans un congrès
hal-00620371v1
|
|
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networksBioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Communication dans un congrès
hal-00425661v1
|
|
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. pp.149-160
Communication dans un congrès
hal-00620327v1
|
|
A faster algorithm for finding minimum Tucker submatrices6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Communication dans un congrès
hal-00620380v1
|
Querying Protein-Protein Interaction Networks5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Communication dans un congrès
hal-00620391v1
|
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491v1
|
|
Finding the median of three permutations under the Kendall-tau distance7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6
Communication dans un congrès
hal-00620459v1
|
|
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS ProblemsBrazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Communication dans un congrès
hal-00417918v1
|
|
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. pp.271-282
Communication dans un congrès
hal-00620363v1
|
|
What Makes the Arc-Preserving Subsequence Problem Hard?5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868
Communication dans un congrès
hal-00620359v1
|
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Communication dans un congrès
hal-00620330v1
|
|
|
New Results for the 2-Interval Pattern Problem15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. pp.311-322
Communication dans un congrès
hal-00620366v1
|
Algorithmic Aspects of Arc-Annotated SequencesElloumi Mourad, Zomaya Albert Y. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp.113-126, 2011
Chapitre d'ouvrage
hal-00620821v1
|
|
Comparing RNA structures using a full set of biologically relevant edit operations is intractable2008
Pré-publication, Document de travail
hal-00347464v1
|