Team

Member of the Combinatorics and Bio-informatics (ComBi) team of LINA

Topics (since 2000)

  • Algorithms and data structures
  • Comparative genomics
  • Protein identification by MS/MS
  • Integration of genomic and metabolic data

Publications

Books and book chapters

Journals

  • Path-driven orientation of mixed graphs
    G. Fertin, H. Mohamed-Babou, I. Rusu
    In Discrete Appl. Math. 181, 98-108 (2015).
  • Pancake Flipping is hard
    L. Bulteau, G. Fertin, I. Rusu
    In J. Comput. Syst. Sci. 81(8): 1556-1574 (2015).
  • Tandem repeat detection using short and long reads
    G. Fertin, G. Jean, A. Radulescu, I. Rusu
    In BMC Med. Genomics 8 (Suppl 3): S5 (2015).
  • Extending common intervals searching from permutations to sequences
    I. Rusu
    In J. Discrete Algorithms 29: 27-46 (2014).
  • Easy identification of generalized common nested intervals pdf
    F. de Montgolfier, M. Raffinot, I. Rusu
    In J. Comput. Biol. 21(7): 520-533 (2014).
  • MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations pdf
    I. Rusu
    Theor. Comput. Sci. 90-111 (2014).
  • Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms pdf
    L. Bulteau, G. Fertin, I. Rusu
    In J. Discrete Algorithms 19, 1-22, 2013.
  • Tractability and approximability of maximal strip recovery pdf
    L. Bulteau, G. Fertin, M. Jiang, I. Rusu
    Theor. Comput. Sci. 440-441, 14-28, 2012.
  • Sorting by Transpositions Is Difficult pdf
    L. Bulteau, G. Fertin, I. Rusu
    SIAM J. Discrete Math. 26(3), 1148-1180, 2012.
  • New applications of interval generators to genome comparison pdf
    I. Rusu
    Journal of Discrete Algorithms 10, 123-139, 2012.
  • Integrated analysis of the gene neighbouring impact on bacterial metabolic networks pdf
    P. Bordron P., D. Eveillard D., I. Rusu
    IET Systems Biology 5(4), 261-268, 2011.
  • Statistical Properties of Factor Oracles pdf
    J. Bourdon, I. Rusu
    Journal of Discrete Algorithms 9(1), 57-66, 2011.
  • Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions pdf
    G. del Mondo, D. Eveillard, I. Rusu
    Bioinformatics 25(7), 926-932, 2009.
  • On the Approximability of Comparing Genomes with Duplicates pdf
    S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette
    Journal of Graph Algorithms and Applications 13(1), 19-53, 2009.
  • Maximum weight edge-constraint matchings pdf
    I. Rusu
    Discrete Applied Mathematics 156(5), 662-672, 2008.
  • Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicated Genes pdf
    S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette
    Journal of Computational Biology 15(8), 1093-1115, 2008.
  • Converting Suffix Trees into Factor/Suffix Oracles pdf
    I. Rusu
    Journal of Discrete Algorithms 6(2), 324-340, 2008.
  • A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates pdf
    S. Angibaud, G. Fertin, I. Rusu, S. Vialette
    Journal of Computational Biology 14(4), 379-393, 2007.
  • Hard problems in similarity searching pdf
    C. Moan, I. Rusu
    Discrete Applied Mathematics 144, 213-227 (2004).

Conferences

  • Pancake Flipping Is Hard pdf
    L. Bulteau, G. Fertin, I. Rusu
    In Proc. MFCS 2012, LNCS Vol. 7464, 247-258, 2012.
  • Algorithms for Subnetwork Mining in Heterogeneous Networks pdf
    G. Fertin, H. Mohamed-Babou, I. Rusu
    In Proc. SEA 2012, LNCS Vol. 7276, 184-194, 2012.
  • Algorithmic Aspects of Heterogeneous Biological Networks Comparison pdf
    G. Blin, G. Fertin, H. Mohamed-Babou, I. Rusu, F. Sikora, S. Vialette
    In Proc. 5th International Conference on Combinatorial Optimization and Applications (COCOA 2011), LNCS Vol. 6831, pp 272-286, 2011
  • Sorting by Transpositions is Difficult pdf
    L. Bulteau, G. Fertin, I. Rusu In Proc. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), LNCS Vol. 6755, pp 654-665, 2011.
  • Tractability and Approximability of Maximal Strip Recovery pdf
    L. Bulteau, G. Fertin, M. Jiang, I. Rusu In Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), LNCS Vol. 6661, pp 336-349, 2011.
  • SIPPER: A flexible method to integrate heterogeneous data into a metabolic network pdf
    P. Bordron, D. Eveillard, I. Rusu In Proc. IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS 2011), 40-45, IEEE Explore Digital Library doi: 10.1109/ICCABS.2011.5729937, 2011.
  • Revisiting the Minimum Breakpoint Linearization Problem pdf
    L. Bulteau, G. Fertin, I. Rusu
    In Proc. 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010) , LNCS Vol. 6108, 163-174, 2010.
  • Proper Alignment of MS/MS Spectra from Unsequenced Species pdf
    F. Cliquet, G. Fertin, I. Rusu, D. Tessier
    In Proceedings of Bioinformatics and Computational Biology (BIOCOMP) 2010, CSREA Press, 766-772, 2010.
  • Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms pdf
    L. Bulteau, G. Fertin, I. Rusu
    In Proc. 20th International Symposium on Algorithms and Computation (ISAAC 2009) , LNBI Vol. 5878, 710-719, 2009.
  • Statistical properties of factor oracles pdf
    J. Bourdon, I. Rusu
    In Proc. 20th Annual Symposium on Combinatorial Pattern Matching (CPM'09) , LNCS Vol. 5577, 326-338, 2009.
  • Comparing Bacterial Genomes by Searching their Common Intervals pdf
    S. Angibaud, D. Eveillard, G. Fertin, I. Rusu
    In Proc. 1st International Conferenceon Bioinformatics and Computational Biology (BICoB 2009), LNBI Vol. 5462, 102-113, 2009.
  • Comparison of Spectra in Unsequenced Species pdf
    F. Cliquet, G. Fertin, I. Rusu, D. Tessier
    In Proc. 4th Brazilian Symposium on Bioinformatics (BSB 2009) , LNBI Vol. 5576, 24-35, 2009.
  • On the Approximability of Comparing Genomes with Duplicates pdf
    S. Angibaud, G. Fertin, I. Rusu
    In Proc. 2nd Workshop on Algorithms and Computation (WALCOM 2008), LNCS 4921, 34-45, 2008.
  • A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes pdf
    S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette
    In Proc. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007) , LNBI 4751, 16-29, 2007.
  • Extending the Hardness of RNA Secondary Structure Comparison pdf
    G. Blin, G. Fertin, I. Rusu, C. Sinoquet
    In Proceedings 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), LNCS 4614, 140-151, 2007.
  • How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation pdf
    S. Angibaud, G. Fertin, I. Rusu, S. Vialette
    In Proceedings 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006) , LNBI 4205, 75-86, 2006.
  • Pattern discovery allowing wild-cards, substitution matrices and multiple score functions pdf
    A. Mancheron, I. Rusu
    Proceedings of WABI 2003, LNBI 2812, 124-138, 2003.

In a previous life, I worked in graph theory. Publications here.

FarCry - Mollio