Filter your results
- 11
- 9
- 10
- 10
- 20
- 7
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 2
- 3
- 4
- 2
- 20
- 14
- 11
- 8
- 5
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 16
- 14
- 6
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Mod/Resc Parsimony Inference: Theory and applicationInformation and Computation, 2012, 213, pp.23-32. ⟨10.1016/j.ic.2011.03.008⟩
Journal articles
hal-00763405v1
|
||
|
Finding Common Structured Patterns in Linear GraphsTheoretical Computer Science, 2010, 411 (26-28), pp.2475-2486. ⟨10.1016/j.tcs.2010.02.017⟩
Journal articles
hal-00482850v1
|
||
On the Parameterized Complexity of Multiple-Interval Graph ProblemsTheoretical Computer Science, 2009, 410 (1), pp.53-61
Journal articles
hal-00619739v1
|
|||
|
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
Conference papers
hal-00620363v1
|
||
|
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.529-540
Conference papers
inria-00360821v1
|
||
|
Gene Maps Linearization using Genomic Rearrangement DistancesJournal of Computational Biology, 2007, 14 (4), pp.394-407
Journal articles
hal-00619755v1
|
||
|
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure ConstraintsJournal of Discrete Algorithms, 2008, 6 (4), pp.618-626
Journal articles
hal-00416442v1
|
||
The Minimum Substring Cover ProblemInformation and Computation, 2008, 206 (11), pp.1303-1312
Journal articles
hal-00619729v1
|
|||
|
The Clever Shopper ProblemThe 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩
Conference papers
hal-01715824v1
|
||
The Clever Shopper ProblemTheory of Computing Systems, In press, ⟨10.1007/s00224-019-09917-z⟩
Journal articles
hal-01998054v1
|
|||
|
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Conference papers
hal-00417928v1
|
||
|
Approximating the 2-Interval Pattern Problem13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Conference papers
hal-00619979v1
|
||
|
Local search for string problems: Brute-force is essentially optimalTheoretical Computer Science, 2014, 525, pp.30-41. ⟨10.1016/j.tcs.2013.05.006⟩
Journal articles
hal-01171584v1
|
||
Approximating the 2-Interval Pattern problemTheoretical Computer Science, 2008, 395 (2-3), pp.283-297
Journal articles
hal-00619740v1
|
|||
|
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Conference papers
hal-00418241v1
|
||
The Minimum Substring Cover Problem5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183
Conference papers
hal-00620289v1
|
|||
|
Upper and lower bounds for finding connected motifs in vertex-colored graphsJournal of Computer and System Sciences, 2011, 77 (4), pp.799-811. ⟨10.1016/j.jcss.2010.07.003⟩
Journal articles
hal-00606148v1
|
||
|
Local Search for String Problems: Brute Force Is Essentially OptimalCombinatorial Pattern Matching, 2013, Bad Herrenalb, Germany. pp.130-141, ⟨10.1007/978-3-642-38905-4_14⟩
Conference papers
hal-01176607v1
|
||
|
Mod/Resc Parsimony InferenceCombinatorial Pattern Matching, Jun 2010, New York, United States. pp.202--213, ⟨10.1007/978-3-642-13509-5_19⟩
Conference papers
hal-00681830v1
|
||
|
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphISAAC 2012, Dec 2012, Taipei, Taiwan. pp.465-474, ⟨10.1007/978-3-642-35261-4_49⟩
Conference papers
hal-01054925v1
|