| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Irena Rusu |
New applications of interval generators to genome comparison.  |
J. Discrete Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Pancake Flipping is Hard |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Bourdon, Irena Rusu |
Statistical properties of factor oracles. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Sorting by Transpositions Is Difficult. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu |
Tractability and Approximability of Maximal Strip Recovery. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette |
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Bordron, Damien Eveillard, Irena Rusu |
SIPPER: A flexible method to integrate heterogeneous data into a metabolic network. |
ICCABS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Sorting by Transpositions is Difficult |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Revisiting the Minimum Breakpoint Linearization Problem. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier |
Proper Alignment of MS/MS Spectra from Unsequenced Species. |
BIOCOMP |
2010 |
DBLP BibTeX RDF |
|
| 1 | Florian Roussel, Irena Rusu, Henri Thuillier |
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Géraldine Del Mondo, Damien Eveillard, Irena Rusu |
Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions. |
Bioinformatics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
On the Approximability of Comparing Genomes with Duplicates. |
J. Graph Algorithms Appl. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Bourdon, Irena Rusu |
Statistical Properties of Factor Oracles. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
factor recognition, suffix recognition, average-case analysis, indexing structure |
| 1 | Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier |
Comparison of Spectra in Unsequenced Species. |
BSB |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu |
Comparing Bacterial Genomes by Searching Their Common Intervals. |
BICoB |
2009 |
DBLP DOI BibTeX RDF |
circular genome, comparative genomic, common interval |
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
comparative maps, genome comparison, synteny blocks, approximation algorithms, algorithmic complexity |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. |
Journal of Computational Biology |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
On the Approximability of Comparing Genomes with Duplicates |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Irena Rusu |
Maximum weight edge-constrained matchings. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
Converting suffix trees into factor/suffix oracles. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu |
On the Approximability of Comparing Genomes with Duplicates. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette |
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. |
Journal of Computational Biology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet |
Extending the Hardness of RNA Secondary Structure Comparison. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
arc-annotated sequences, NP-hardness, computational biology, edit distance, RNA structures |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. |
RECOMB-CG |
2007 |
DBLP DOI BibTeX RDF |
breakpoint distance, heuristic, genome rearrangement, duplication, pseudo-boolean programming |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette |
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. |
Comparative Genomics |
2006 |
DBLP DOI BibTeX RDF |
heuristic, genome rearrangement, duplication, common intervals, pseudo-boolean programming |
| 1 | Jean-Luc Fouquet, Irena Rusu |
Preface. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Moan, Irena Rusu |
Hard problems in similarity searching. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alban Mancheron, Irena Rusu |
Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Parfenoff, Florian Roussel, Irena Rusu |
Loose vertices in C4-free Berge graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu, Jeremy Spinrad |
Forbidden subgraph decomposition. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Irena Rusu, R. Sritharan |
Dirac-type characterizations of graphs without long chordless cycles. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Roussel, Irena Rusu |
An O(n2) algorithm to color Meyniel graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu, Jeremy Spinrad |
Domination graphs: examples and counterexamples. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
Preface: Volume 5. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Roussel, Irena Rusu |
Recognizing i-triangulated graphs in O(mn) time. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
Even pairs in Artemis graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Roussel, Irena Rusu |
A Linear Algorithm to Color i-Triangulated Graphs. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Roussel, Irena Rusu |
Holes and Dominoes in Meyniel Graphs. |
Int. J. Found. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Florian Roussel, Irena Rusu, Henri Thuillier |
On Graphs with Limited Number of P4-Partners. |
Int. J. Found. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Irena Rusu |
P4-domination in Minimal Imperfect Graphs. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Parfenoff, Florian Roussel, Irena Rusu |
Triangulated Neighbourhoods in C4-Free Berge Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
lexicographic breadth-first search, triangulated graph, perfectness |
| 1 | Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier |
On transversals in minimal imperfect graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
Building counterexamples. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Vassilis Giakoumakis, Irena Rusu |
Weighted Parameters in (P5, P5)-free Graphs. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
Properly orderable graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
Quasi-Parity and Perfect Graphs. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu |
A new class of perfect Hoàng graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")