Filtrer vos résultats
- 37
- 33
- 1
- 39
- 25
- 4
- 2
- 1
- 71
- 44
- 12
- 1
- 1
- 1
- 3
- 4
- 2
- 6
- 2
- 4
- 6
- 6
- 3
- 8
- 5
- 4
- 3
- 1
- 1
- 3
- 2
- 2
- 3
- 71
- 59
- 12
- 11
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 71
- 38
- 12
- 12
- 9
- 5
- 5
- 5
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
71 résultats
Common intervals and permutation reconstruction from MinMax -betweenness constraintsJournal of Discrete Algorithms, 2018, 49, pp.8-26
Article dans une revue
hal-01983336v1
|
|||
The Contig Assembly Problem and Its Algorithmic SolutionsAlgorithms for Next-Generation Sequencing Data, pp. 267-298, 2017
Chapitre d'ouvrage
hal-01819204v1
|
|||
Dirac-type characterizations of graphs without long chordless cyclesDiscrete Mathematics, 2002, 256, pp.445--448
Article dans une revue
hal-00442423v1
|
|||
|
On the Complexity of two Problems on Orientations of Mixed GraphsIn Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), Jul 2012, Rennes, France. pp.161-170
Communication dans un congrès
hal-00826863v1
|
||
|
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719
Communication dans un congrès
hal-00425145v1
|
||
|
Converting Suffix Trees into Factor/Suffix Oracles2006
Pré-publication, Document de travail
hal-00023157v1
|
||
|
On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs2022
Pré-publication, Document de travail
hal-03831538v1
|
||
|
Comparing Bacterial Genomes by Searching their Common Intervals1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), 2009, New Orleans, United States. pp.102-113, ⟨10.1007/978-3-642-00727-9_12⟩
Communication dans un congrès
istex
hal-00416466v1
|
||
SIPPER: A flexible method to integrate heterogeneous data into a metabolic networkComputational Advances in Bio and Medical Sciences (ICCABS), 2011 IEEE 1st International Conference on, Feb 2011, Orlando, United States. pp.40 - 45, ⟨10.1109/ICCABS.2011.5729937⟩
Communication dans un congrès
hal-00585102v1
|
|||
|
Algorithms for subnetwork mining in heterogeneous networks11th Symposium on Experimental Algorithms (SEA 2012), Jun 2012, Bordeaux, France. pp.184-194
Communication dans un congrès
hal-00689889v1
|
||
Berge graphs with chordless cycles of bounded lengthJournal of Graph Theory, 1999, 32, pp.73--79
Article dans une revue
hal-00442413v1
|
|||
Even pairs in Artemis graphsDiscrete Mathematics, 2000, 218, pp.185--197
Article dans une revue
hal-00442412v1
|
|||
Holes and dominoes in Meyniel graphsInternational Journal of Foundations of Computer Science, 1999, 10 (2), pp.127--146
Article dans une revue
hal-00442411v1
|
|||
|
Sorting by Transpositions is Difficult38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665
Communication dans un congrès
hal-00606223v1
|
||
Sorting signed permutations by reversals using link-cut treesInformation Processing Letters, 2018, 132, pp.44-48
Article dans une revue
hal-01983332v1
|
|||
|
Hybrid de novo tandem repeat detection using short and long readsBMC Medical Genomics, 2015, 8 (Suppl 3), pp.S5. ⟨10.1186/1755-8794-8-S3-S5⟩
Article dans une revue
hal-01214038v1
|
||
|
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate GenesJournal of Computational Biology, 2008, 15 (8), pp.1093-1115. ⟨10.1089/cmb.2008.0061⟩
Article dans une revue
hal-00416446v1
|
||
|
Path-Driven Orientation of Mixed GraphsDiscrete Applied Mathematics, 2015, 181, pp.98-108. ⟨10.1016/j.dam.2014.10.016⟩
Article dans une revue
hal-01044921v1
|
||
|
Revisiting the Minimum Breakpoint Linearization Problem7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174
Communication dans un congrès
hal-00482856v1
|
||
Datastructures for Filtering and Storing Non-Dominated PointsMOPGP'17 :The 12th International Conference on Multiple Objective Programming and Goal Programming, Oct 2017, Metz, France
Communication dans un congrès
hal-02492921v1
|
|||
|
Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactionsBioinformatics, 2009, 25 (7), pp.926-932. ⟨10.1093/bioinformatics/btp083⟩
Article dans une revue
hal-02352007v1
|
||
|
Integration of omics data to investigate common intervals1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), 2011, Singapore, Singapore. pp.101-105
Communication dans un congrès
hal-00606226v1
|
||
|
Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer ScienceTheoretical Computer Science, 2013, 494, pp.122-133
Article dans une revue
hal-00826880v1
|
||
P_4-domination in minimal imperfect graphsDiscrete Applied Mathematics, 1999, 94, pp.329--336
Article dans une revue
hal-00442414v1
|
|||
An O(n^2) algorithm to color Meyniel graphsDiscrete Mathematics, 2001, 235, pp.107--123
Article dans une revue
hal-00442409v1
|
|||
|
New applications of interval generators to genome comparisonJournal of Discrete Algorithms, 2012, 10, pp.123-139. ⟨10.1016/j.jda.2011.11.002⟩
Article dans une revue
hal-01071349v1
|
||
|
Proper Alignment of MS/MS Spectra from Unsequenced Species11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Sep 2010, Las Vegas, United States. pp.766-772, ⟨10.1007/978-3-642-03223-3_3⟩
Communication dans un congrès
hal-01068873v1
|
||
|
Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions.Bioinformatics, 2009, 25 (7), pp.926-32. ⟨10.1093/bioinformatics/btp083⟩
Article dans une revue
hal-00415905v1
|
||
|
Admissible Pinnacle OrderingsGraphs and Combinatorics, 2021, 37 (4), pp.1205-1214. ⟨10.1007/s00373-021-02306-9⟩
Article dans une revue
hal-03681855v1
|
||
|
Graph matching problems and the NP-hardness of sortedness constraintsTheoretical Computer Science, 2017, 695, pp.16 - 27. ⟨10.1016/j.tcs.2017.07.019⟩
Article dans une revue
hal-01708356v1
|