| 2009 |
|---|
| 20 | EE | Vincent Berry,
Christophe Paul,
Sylvain Guillemot,
François Nicolas:
Linear time 3-approximation for the MAST problem.
ACM Transactions on Algorithms 5(2): (2009) |
| 19 | EE | Julien Cassaigne,
François Nicolas:
On the Morse-Hedlund complexity gap
CoRR abs/0903.1627: (2009) |
| 18 | EE | Julien Cassaigne,
François Nicolas:
On polynomial growth functions of D0L-systems
CoRR abs/0904.1752: (2009) |
| 2008 |
|---|
| 17 | EE | Sylvain Guillemot,
François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees
CoRR abs/0802.0024: (2008) |
| 16 | EE | Morris Michael,
François Nicolas,
Esko Ukkonen:
On the complexity of finding gapped motifs
CoRR abs/0802.0314: (2008) |
| 15 | EE | François Nicolas:
(Generalized) Post Correspondence Problem and semi-Thue systems
CoRR abs/0802.0726: (2008) |
| 14 | EE | Sylvain Guillemot,
François Nicolas,
Vincent Berry,
Christophe Paul:
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
CoRR abs/0802.2736: (2008) |
| 13 | EE | Julien Cassaigne,
Christian Mauduit,
François Nicolas:
Asymptotic behavior of growth functions of D0L-systems
CoRR abs/0804.1327: (2008) |
| 12 | EE | François Nicolas:
A simple, polynomial-time algorithm for the matrix torsion problem
CoRR abs/0806.2068: (2008) |
| 11 | EE | Julien Cassaigne,
François Nicolas:
On the decidability of semigroup freeness
CoRR abs/0808.3112: (2008) |
| 10 | EE | François Nicolas,
Eric Rivals:
Hardness of optimal spaced seed design.
J. Comput. Syst. Sci. 74(5): 831-849 (2008) |
| 2007 |
|---|
| 9 | EE | Vincent Berry,
François Nicolas:
Maximum agreement and compatible supertrees.
J. Discrete Algorithms 5(3): 564-591 (2007) |
| 8 | EE | François Nicolas,
Eric Rivals:
Longest common subsequence problem for unoriented and cyclic strings.
Theor. Comput. Sci. 370(1-3): 1-18 (2007) |
| 2006 |
|---|
| 7 | EE | Sylvain Guillemot,
François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.
CPM 2006: 165-176 |
| 6 | EE | Vincent Berry,
François Nicolas:
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(3): 289-302 (2006) |
| 2005 |
|---|
| 5 | EE | Vincent Berry,
Sylvain Guillemot,
François Nicolas,
Christophe Paul:
On the Approximation of Computing Evolutionary Trees.
COCOON 2005: 115-125 |
| 4 | EE | François Nicolas,
Eric Rivals:
Hardness of Optimal Spaced Seed Design.
CPM 2005: 144-155 |
| 3 | EE | François Nicolas,
Eric Rivals:
Hardness results for the center and median string problems under the weighted and unweighted edit distances.
J. Discrete Algorithms 3(2-4): 390-415 (2005) |
| 2004 |
|---|
| 2 | EE | Vincent Berry,
François Nicolas:
Maximum Agreement and Compatible Supertrees (Extended Abstract).
CPM 2004: 205-219 |
| 2003 |
|---|
| 1 | EE | François Nicolas,
Eric Rivals:
Complexities of the Centre and Median String Problems.
CPM 2003: 315-327 |
