Membre

Fiche Membre

En un clic !

Thématiques de recherche
Pôles d’expertises
Nos équipes
Formation par la recherche
- Doctorats
- Masters
HDR
Thèses
Publications

Composante(s) d’expertise Pôle associée(s)

SDD

Intégration de donnéesModélisation de systèmes / problèmes / donnéesOptimisation combinatoire / discrète

Expertises équipes

BioinformatiqueBiologie des SystèmesMétagénomiqueModélisation Biologique

Iréna Rusu Robini

HDR

Enseignant chercheur / Enseignante chercheuse – Professeur / professeure des universités

Equipe :

Employeur : Nantes Université

Expertises :

Algorithmique combinatoireComplexité algorithmiqueThéorie des graphes

Coordonnées

Email :

Adresse(s)

Informations non disponibles pour l’instant

Publications déposées sur HAL

Nombre de publications retournées : 76

Revues internationales avec comité de lecture

[1] C. Moan, I. Rusu. Hard problems in similarity searching, in Discrete Applied Mathematics, vol. 144, no. 1-2, pp. 213-227, DOI

[2] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. A General Framework for Computing Rearrangement Distances between Genomes with Duplicates, in Journal of Computational Biology, vol. 14, no. 4, pp. 379-393, DOI

[3] I. Rusu. Converting suffix trees into factor/suffix oracles, in Journal of Discrete Algorithms, vol. 6, no. 2, pp. 324-340, DOI

[4] I. Rusu. Maximum weight edge-constrained matchings, in Discrete Applied Mathematics, vol. 156, no. 5, pp. 662-672, DOI

[5] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes, in Journal of Computational Biology, vol. 15, no. 8, pp. 1093-1115, DOI

[6] S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, S. Vialette. On the Approximability of Comparing Genomes with Duplicates, in Journal of Graph Algorithms and Applications, vol. 13, no. 1, pp. 19-53,

[7] G. Mondo, D. Eveillard, I. Rusu. Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions, in Bioinformatics, vol. 25, no. 7, pp. 926-932, DOI

[8] G. Mondo, D. Eveillard, I. Rusu. Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions., in Bioinformatics, vol. 25, no. 7, pp. 926-32, DOI

[9] F. Roussel, I. Rusu, H. Thuillier. The Strong Perfect Graph Conjecture: 40 years of Attempts, and its Resolution, in Discrete Mathematics, vol. 309, no. 20, pp. 6092-6113,

[10] J. Bourdon, I. Rusu. Statistical Properties of Factor Oracles, in Journal of Discrete Algorithms, vol. 9, no. 2011, pp. 59-66, DOI

[11] I. Rusu. New applications of interval generators to genome comparison, in Journal of Discrete Algorithms, vol. 10, pp. 123-139, DOI

[12] L. Bulteau, G. Fertin, M. Jiang, I. Rusu. Tractability and approximability of maximal strip recovery, in Theoretical Computer Science, vol. 440-441, pp. 14-28, DOI

[13] L. Bulteau, G. Fertin, I. Rusu. Sorting by Transpositions is Difficult, in SIAM Journal on Discrete Mathematics, vol. 26, no. 3, pp. 1148-1180, DOI

[14] I. Rusu. MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations, in Theoretical Computer Science, vol. 543, pp. 90-111, DOI

[15] L. Bulteau, G. Fertin, I. Rusu. Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science, in Theoretical Computer Science, vol. 494, pp. 122-133,

[16] L. Bulteau, G. Fertin, I. Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms, in Journal of Discrete Algorithms, vol. 19, pp. 1-22,

[17] F. de Montgolfier, M. Raffinot, I. Rusu. Easy identification of generalized common and conserved nested intervals, in Journal of Computational Biology, vol. 21, no. 7, pp. 520-533, DOI

[18] G. Fertin, H. Mohamed-Babou, I. Rusu. Path-Driven Orientation of Mixed Graphs, in Discrete Applied Mathematics, vol. 181, pp. 98-108, DOI

[19] L. Bulteau, G. Fertin, I. Rusu. , in Journal of Computer and System Sciences, vol. 81, no. 8, pp. 1556-1574, DOI

[20] G. Fertin, G. Jean, A. Radulescu, I. Rusu. Hybrid de novo tandem repeat detection using short and long reads, in BMC Medical Genomics, vol. 8, no. Suppl 3, pp. S5, DOI

[21] G. Fertin, C. Komusiewicz, H. Mohamed-Babou, I. Rusu. Finding Supported Paths in Heterogeneous Networks, in Algorithms, DOI

[22] I. Rusu. Permutation reconstruction from MinMax-Betweenness constraints, in Discrete Applied Mathematics, vol. 207, pp. 106-119, DOI

[23] I. Rusu. log-Lists and their applications to sorting by transpositions, reversals and block-interchanges, in Theoretical Computer Science, vol. 660, pp. 1 – 15, DOI

[24] I. Rusu. Graph matching problems and the NP-hardness of sortedness constraints, in Theoretical Computer Science, vol. 695, pp. 16 – 27, DOI

[25] G. Fertin, I. Rusu, S. Vialette. The S-labeling problem: An algorithmic tour, in Discrete Applied Mathematics, vol. 246, pp. 49-61, DOI

[26] L. Pelletier, I. Rusu. Common intervals and permutation reconstruction from MinMax -betweenness constraints, in Journal of Discrete Algorithms, vol. 49, pp. 8-26,

[27] I. Rusu. Sorting signed permutations by reversals using link-cut trees, in Information Processing Letters, vol. 132, pp. 44-48, DOI

[28] I. Rusu. Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT, in Theoretical Computer Science, vol. 771, pp. 23-38, DOI

[29] I. Rusu. Sorting Permutations with Fixed Pinnacle Set, in The Electronic Journal of Combinatorics, vol. 27, no. 3, DOI

[30] I. Rusu, B. Tenner. Admissible Pinnacle Orderings, in Graphs and Combinatorics, vol. 37, no. 4, pp. 1205-1214, DOI

[31] I. Rusu. Hamiltonian problems in directed graphs with simple row patterns, in Theoretical Computer Science, vol. 916, pp. 70-85, DOI

[32] I. Rusu. Forced pairs in A-Stick graphs, in Discrete Mathematics, vol. 345, no. 9, pp. 112962, DOI

[33] I. Rusu. Raney numbers, threshold sequences and Motzkin-like paths, in Discrete Mathematics, vol. 345, no. 11, pp. 113065, DOI

[34] I. Rusu. On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs, in Theoretical Computer Science, vol. 952, pp. 113773, DOI

[35] D. Chakraborty, K. Gajjar, I. Rusu. Recognizing geometric intersection graphs stabbed by a line, in Theoretical Computer Science, vol. 995, pp. 114488, DOI

[36] I. Rusu. Cluster vertex deletion problems on cubic graphs, in Theoretical Computer Science, vol. 1068, pp. 115775, DOI

Revues nationales avec comité de lecture

[37] F. Roussel, I. Rusu. , in International Journal of Foundations of Computer Science, vol. 10, no. 2, pp. 127–146,

[38] I. Rusu. Berge graphs with chordless cycles of bounded length, in Journal of Graph Theory, vol. 32, pp. 73–79,

[39] I. Rusu. P_4-domination in minimal imperfect graphs, in Discrete Applied Mathematics, vol. 94, pp. 329–336,

[40] F. Roussel, I. Rusu. , in Information Processing Letters, vol. 76, pp. 141–147,

[41] I. Rusu. Even pairs in Artemis graphs, in Discrete Mathematics, vol. 218, pp. 185–197,

[42] F. Roussel, I. Rusu. An O(n^2) algorithm to color Meyniel graphs, in Discrete Mathematics, vol. 235, pp. 107–123,

[43] I. Rusu, J. Spinrad. Domination graphs: examples and counterexamples, in Discrete Applied Mathematics, vol. 110, pp. 289–300,

[44] I. Parfenoff, F. Roussel, I. Rusu. Loose vertices in C_4-free Berge graphs, in Discrete Mathematics, vol. 258, pp. 137–160,

[45] I. Rusu, J. Spinrad. , in Discrete Mathematics, vol. 247, pp. 159–168,

[46] V. Chvâtal, I. Rusu, R. Sritharan. Dirac-type characterizations of graphs without long chordless cycles, in Discrete Mathematics, vol. 256, pp. 445–448,

Conférences internationales avec comité de lecture et actes

[47] A. Mancheron, I. Rusu. Pattern discovery allowing gaps, substitution matrices and multiple score functions, in Workshop on Algorithms in BioInformatics (WABI), Budapest, Hongrie,

[48] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation, in 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Montreal, Canada, Canada,

[49] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes, in 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), San Diego, états-Unis,

[50] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation, in 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), Montréal, Canada,

[51] G. Blin, G. Fertin, I. Rusu, C. Sinoquet. Extending the Hardness of RNA Secondary Structure Comparison, in 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Hangzhou, Chine,

[52] S. Angibaud, G. Fertin, I. Rusu. On the Approximability of Comparing Genomes with Duplicates, in 2nd Workshop on Algorithms and Computation (WALCOM 2008), Dhaka, Bangladesh,

[53] F. Cliquet, G. Fertin, I. Rusu, D. Tessier. Comparison of Spectra in Unsequenced Species, in 4th Brazilian Symposium on Bioinformatics (BSB 2009), Porto Alegre, Brésil, DOI

[54] L. Bulteau, G. Fertin, I. Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms, in ISAAC 2009 (20th International Symposium on Algorithms and Computation), Hawaii, états-Unis,

[55] S. Angibaud, D. Eveillard, G. Fertin, I. Rusu. Comparing Bacterial Genomes by Searching their Common Intervals, in 1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), New Orleans, états-Unis, DOI

[56] L. Bulteau, G. Fertin, I. Rusu. Revisiting the Minimum Breakpoint Linearization Problem, in 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Prague, France,

[57] F. Cliquet, G. Fertin, I. Rusu, D. Tessier. Proper Alignment of MS/MS Spectra from Unsequenced Species, in 11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Las Vegas, états-Unis, DOI

[58] G. Blin, G. Fertin, H. Mohamed-Babou, I. Rusu, F. Sikora, S. Vialette. Algorithmic Aspects of Heterogeneous Biological Networks Comparison, in COCOA 2011, Zhangjiajie, Chine, DOI

[59] L. Bulteau, G. Fertin, I. Rusu. Sorting by Transpositions is Difficult, in 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zürich, Suisse,

[60] L. Bulteau, G. Fertin, M. Jiang, I. Rusu. Tractability and Approximability of Maximal Strip Recovery, in 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Palermo, Italie,

[61] S. Angibaud, P. Bordron, D. Eveillard, G. Fertin, I. Rusu. Integration of omics data to investigate common intervals, in 1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), Singapore, Singapour,

[62] P. Bordron, D. Eveillard, I. Rusu. SIPPER: A flexible method to integrate heterogeneous data into a metabolic network, in Computational Advances in Bio and Medical Sciences (ICCABS), 2011 IEEE 1st International Conference on, Orlando, états-Unis, DOI

[63] G. Fertin, H. Mohamed-Babou, I. Rusu. Algorithms for subnetwork mining in heterogeneous networks, in 11th Symposium on Experimental Algorithms (SEA 2012), Bordeaux, France,

[64] L. Bulteau, G. Fertin, I. Rusu. , in 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Bratislava, Slovaquie,

[65] L. Bulteau, G. Fertin, C. Komusiewicz, I. Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications, in 13th Workshop on Algorithms in Bioinformatics (WABI2013), Nice, France, DOI

[66] G. Fertin, G. Jean, A. Radulescu, I. Rusu. DExTaR: Detection of Exact Tandem Repeats based on the de Bruijn graph, in IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2014), Belfast, Irlande, DOI

[67] G. Fertin, I. Rusu, S. Vialette. Algorithmic aspects of the S-Labeling problem, in 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italie,

[68] G. Fertin, I. Rusu, S. Vialette. Obtaining a Triangular Matrix by Independent Row-Column Permutations, in 26th International Symposium on Algorithms and Computation, Nagoya, France, DOI

[69] L. Bulteau, G. Fertin, A. Labarre, R. Rizzi, I. Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three, in The 22nd International Computing and Combinatorics Conference (COCOON), Ho Chi Minh City, Viêt Nam, DOI

[70] D. Dumez, X. Gandibleux, I. Rusu. Datastructures for Filtering and Storing Non-Dominated Points, in MOPGP'17 :The 12th International Conference on Multiple Objective Programming and Goal Programming, Metz, France,

Conférences nationales avec comité de lecture et actes

[71] G. Fertin, H. Mohamed-Babou, I. Rusu. On the Complexity of two Problems on Orientations of Mixed Graphs, in In Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), Rennes, France,

Ouvrages – Chapitres d'ouvrages et directions d'ouvrages

[72] G. Fertin, A. Labarre, I. Rusu, E. Tannier, S. Vialette. Combinatorics of Genome Rearrangements,

[73] G. Fertin, I. Rusu. Computing Genomic Distances: An Algorihtmic Viewpoint, DOI

[74] G. Jean, A. Radulescu, I. Rusu. The Contig Assembly Problem and Its Algorithmic Solutions,

Autres publications

[75] I. Rusu. Converting Suffix Trees into Factor/Suffix Oracles,

[76] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. On the Approximability of Comparing Genomes with Duplicates,

Pas de projets référencées pour l’instant

Pas de plateformes référencées pour l’instant

Pas de logiciels de référencés pour l’instant