Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs (2009)
Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex G in the protein-protein interaction...
Maximum Motif Problem in Vertex-Colored Graphs (2009)
Dondi, Riccardo, Fertin, Guillaume, Vialette, Stéphane
Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In this context, dierent graph motif problems have been considered [12, 6, 4]. Pursuing a line of...
On the Approximability of Comparing Genomes with Duplicates (2009)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thévenin, Annelyse, Vialette, Stéphane
A central problem in comparative genomics consists in computing a (dis-)similarity measure between two genomes, e.g. in order to construct a phylogenetic tree. A large number of such measures has...
Pseudo-Boolean Programming for Partially Ordered Genomes (2009)
Angibaud, Sébastien, Fertin, Guillaume, Thevenin, Annelyse, Vialette, Stéphane
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies,...
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated (2009)
Blin, Guillaume, Fertin, Guillaume, Sikora, Florian, Vialette, Stéphane
A promising and active field of comparative genomics con- sists in comparing two genomes by establishing a one-to-one correspon- dence (i.e., a matching) between their genes. This correspondence is...
On the S-labeling Problem (2009)
Fertin, Guillaume, Vialette, Stéphane
Let G be a graph of order n and size m. A labeling of G is a bijective mapping theta : V(G) --> 1, 2...n, and we call Theta(G) the set of all labelings of G. For any graph G and any labeling theta in...
On Finding Small 2-Generating Sets (2009)
Fagnot, Isabelle, Fertin, Guillaume, Vialette, Stéphane
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element of S is an element...
Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs (2009)
Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex G in the protein-protein interaction...
Maximum Motif Problem in Vertex-Colored Graphs (2009)
Dondi, Riccardo, Fertin, Guillaume, Vialette, Stéphane
Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In this context, different graph motif problems have been considered [12, 6, 4]. Pursuing a line of...
On the Approximability of Comparing Genomes with Duplicates (2009)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thévenin, Annelyse, Vialette, Stéphane
A central problem in comparative genomics consists in computing a (dis-)similarity measure between two genomes, e.g. in order to construct a phylogenetic tree. A large number of such measures has...
Pseudo-Boolean Programming for Partially Ordered Genomes (2009)
Angibaud, Sébastien, Fertin, Guillaume, Thevenin, Annelyse, Vialette, Stéphane
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies,...
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated (2009)
Blin, Guillaume, Fertin, Guillaume, Sikora, Florian, Vialette, Stéphane
A promising and active field of comparative genomics con- sists in comparing two genomes by establishing a one-to-one correspon- dence (i.e., a matching) between their genes. This correspondence is...
On the S-labeling Problem (2009)
Fertin, Guillaume, Vialette, Stéphane
Let G be a graph of order n and size m. A labeling of G is a bijective mapping theta : V(G) --> 1, 2...n, and we call Theta(G) the set of all labelings of G. For any graph G and any labeling theta in...
On Finding Small 2-Generating Sets (2009)
Fagnot, Isabelle, Fertin, Guillaume, Vialette, Stéphane
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element of S is an element...
Blin, Guillaume, Sikora, Florian, Vialette, Stéphane
During the last decade, data on Protein-Protein Interactions (PPI) has increased in a huge manner. Searching for motifs in PPI Network has thus became a crucial problem to interpret this data. A...
Blin, Guillaume, Sikora, Florian, Vialette, Stéphane
During the last decade, data on Protein-Protein Interactions (PPI) has increased in a huge manner. Searching for motifs in PPI Network has thus became a crucial problem to interpret this data. A...
Blin, Guillaume, Hamel, Sylvie, Vialette, Stéphane
Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence and structural similarities....
BIOINFORMATICS ORIGINAL PAPER (2008)
Gene Expression, Gaëlle Lel, Pierre Vincens, Anne Badel-chagnon, Stéphane Vialette, Claude Jacq, ...
Vol. 22 no. 11 2006, pages 1359–1366 doi:10.1093/bioinformatics/btl087 Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms
On the Approximability of Comparing Genomes with Duplicates (2008)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
A central problem in comparative genomics consists in computing a (dis-)similarity measure between two genomes, e.g. in order to construct a phylogeny. All the existing measures are defined on...
Manuscript Extracting Constrained 2-Interval Subsets in 2-Interval Sets ⋆ Abstract (2008)
Guillaume Blin, Guillaume Fertin, Stéphane Vialette
2-interval sets were used in [28,29] for establishing a general representation for macroscopic describers of RNA secondary structures.In this context, we have a 2-interval for each legal local fold...
The Minimum Substring Cover Problem (2008)
Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
Abstract. In this paper we consider the problem of covering a set of strings S with a set C of substrings in S, where C is said to cover S if every string in S can be written as a concatenation of...
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics ⋆ (2008)
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Abstract. A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (⊏) or crossing (≬). Given a...
similarity search under mRNA (2008)
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Fixed-parameter algorithms for protein
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
A Pseudo-Boolean programming approach for
Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
Abstract. In the recent past, RNA structure comparison has appeared as an important field of bioinformatics. In this paper, we introduce a new and general intermediate model for comparing RNA...
Genomes containing Duplicates are Hard to compare (Extended Abstract) ⋆ (2008)
Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Abstract. In this paper, we are interested in the algorithmic complexity of computing (dis)similarity measures between two genomes when they contain duplicated genes. In that case, there are usually...
Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Abstract. Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. In the context of comparative...
Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Abstract. Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. In the context of comparative...
Weak pattern matching in colored graphs: Minimizing the number of connected components (2008)
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
In the context of metabolic network analysis, Lacroix et al. 11 introduced the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors and an...
similarity search under mRNA (2008)
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Fixed-parameter algorithms for protein
A general framework for computing rearrangement distances between genomes with duplicates (2008)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance
On the Approximability of Comparing Genomes with Duplicates (2008)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
A central problem in comparative genomics consists in computing a (dis-)similarity measure between two genomes, e.g. in order to construct a phylogeny. All the existing measures are defined on...
On the Approximability of Comparing Genomes with Duplicates (2008)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
A central problem in comparative genomics consists in computing a (dis-)similarity measure between two genomes, e.g. in order to construct a phylogeny. All the existing measures are defined on...
Blin, Guillaume, Hamel, Sylvie, Vialette, Stéphane
Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence and structural similarities....
Blin, Guillaume, Hamel, Sylvie, Vialette, Stéphane
Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence and structural similarities....
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
Comparing genomes of different species is a fundamental problem in comparative genomics. Recent research has resulted in the introduction of different measures between pairs of genomes: reversal...
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints (2008)
Blin, Guillaume, Fertin, Guillaume, Hermelin, Danny, Vialette, Stéphane
In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a given protein) that additionally...
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
Comparing genomes of different species is a fundamental problem in comparative genomics. Recent research has resulted in the introduction of different measures between pairs of genomes: reversal...
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints (2008)
Blin, Guillaume, Fertin, Guillaume, Hermelin, Danny, Vialette, Stéphane
In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a given protein) that additionally...
On restrictions of 2-interval graphs (2007)
Gambette, Philippe, Vialette, Stéphane
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply...
On restrictions of balanced 2-interval graphs (2007)
Gambette, Philippe, Vialette, Stéphane
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply...
On restrictions of balanced 2-interval graphs (2007)
Gambette, Philippe, Vialette, Stéphane
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply...
Pattern Matching in Protein-Protein Interaction Graphs (2007)
Brevier-Giberti, Gaëlle, Rizzi, Roméo, Vialette, Stéphane
In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the...
On restrictions of balanced 2-interval graphs (2007)
Gambette, Philippe, Vialette, Stéphane
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply...
Pattern Matching in Protein-Protein Interaction Graphs (2007)
Brevier-Giberti, Gaëlle, Rizzi, Roméo, Vialette, Stéphane
In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the...
TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2 (2007)
Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
In this paper, we are interested in the computational complexity of computing (dis)simila-rity measures between two genomes when they contain duplicated genes or genomic markers, a problem that...
TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2 (2007)
Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
In this paper, we are interested in the computational complexity of computing (dis)simila-rity measures between two genomes when they contain duplicated genes or genomic markers, a problem that...
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs (2007)
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Abstract. We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices with a...
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs (2007)
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Abstract. We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices with a...
The Minimum Substring Cover Problem ∗ (2007)
Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
In this paper we consider the problem of covering a set of strings S with a set C of substrings in S, where C is said to cover S if every string in S can be written as a concatenation of the...
Exemplar Longest Common Subsequence (2007)
Bonizzoni, Paola, Della Vedova, Gianluca, Dondi, Riccardo, Fertin, Guillaume, Rizzi, Rafaella, Vialette, Stéphane
In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common...
Comparing Genomes with Duplications: a Computational Complexity Point of View (2007)
Blin, Guillaume, Chauve, Cedric, Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In this paper, we are interested in the computational complexity of computing (dis)similarity measures between two genomes when they contain duplicated genes or genomic markers, a problem that...
Extracting Constrained 2-Interval Subsets in 2-Interval Sets (2007)
Blin, Guillaume, Fertin, Guillaume, Vialette, Stéphane
2-interval sets were used in [S. Vialette, Pattern matching over 2-intervals sets, in: Proc. 13th Annual Symposium Combinatorial Pattern Matching, CPM 2002, in: Lecture Notes in Computer Science,...
Exemplar Longest Common Subsequence (2007)
Bonizzoni, Paola, Della Vedova, Gianluca, Dondi, Riccardo, Fertin, Guillaume, Rizzi, Rafaella, Vialette, Stéphane
In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common...
Comparing Genomes with Duplications: a Computational Complexity Point of View (2007)
Blin, Guillaume, Chauve, Cedric, Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In this paper, we are interested in the computational complexity of computing (dis)similarity measures between two genomes when they contain duplicated genes or genomic markers, a problem that...
Extracting Constrained 2-Interval Subsets in 2-Interval Sets (2007)
Blin, Guillaume, Fertin, Guillaume, Vialette, Stéphane
2-interval sets were used in [S. Vialette, Pattern matching over 2-intervals sets, in: Proc. 13th Annual Symposium Combinatorial Pattern Matching, CPM 2002, in: Lecture Notes in Computer Science,...
A General Framework for Computing Rearrangement Distances between Genomes with Duplicates (2007)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane
Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of breakpoints,...
A General Framework for Computing Rearrangement Distances between Genomes with Duplicates (2007)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane
Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of breakpoints,...
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (2007)
Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stéphane
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices with a bijection...
Weak pattern matching in colored graphs: Minimizing the number of connected components (2007)
Dondi, Riccardo, Fertin, Guillaume, Vialette, Stéphane
In the context of metabolic network analysis, Lacroix et al.11 introduced the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors and an...
Blin, Guillaume, Fertin, Guillaume, Herry, Gaël, Vialette, Stéphane
In the recent past, RNA structure comparison has appeared as an important field of bioinformatics. In this paper, we introduce a new and general intermediate model for comparing RNA structures: the...
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
Comparing genomes of different species has become a crucial problem in comparative genomics. Recent research have resulted in different genomic distance definitions: number of breakpoints, number of...
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (2007)
Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stéphane
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices with a bijection...
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics (2007)
Fertin, Guillaume, Hermelin, Danny, Rizzi, Romeo, Vialette, Stéphane
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (
Weak pattern matching in colored graphs: Minimizing the number of connected components (2007)
Dondi, Riccardo, Fertin, Guillaume, Vialette, Stéphane
In the context of metabolic network analysis, Lacroix et al.11 introduced the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors and an...
Blin, Guillaume, Fertin, Guillaume, Herry, Gaël, Vialette, Stéphane
In the recent past, RNA structure comparison has appeared as an important field of bioinformatics. In this paper, we introduce a new and general intermediate model for comparing RNA structures: the...
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thevenin, Annelyse, Vialette, Stéphane
Comparing genomes of different species has become a crucial problem in comparative genomics. Recent research have resulted in different genomic distance definitions: number of breakpoints, number of...
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics (2007)
Fertin, Guillaume, Hermelin, Danny, Rizzi, Romeo, Vialette, Stéphane
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (
Gaëlle Lelandais, Pierre Vincens, Anne Badel-chagnon, Stéphane Vialette, Claude Jacq, Serge Hazout, ...
Motivation: Molecular evolution, which is classically assessed by comparison of individual proteins or genes between species, can now be studied by comparing co-expressed functional groups of genes....
Approximation of RNA multiple structural alignment (2006)
Marcin Kubica, Romeo Rizzi, Stéphane Vialette
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph that occurs in a set G...
How pseudo-boolean programming can help genome rearrangement distance computation (2006)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
Abstract. Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of...
Exemplar longest common subsequence (2006)
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Laume Fertin, Raffaella Rizzi, Stéphane Vialette
In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common...
Exemplar longest common subsequence (2006)
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Abstract. In the paper we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest...
Exemplar longest common subsequence (2006)
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Abstract. In the paper we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest...
Lelandais, Gaëlle, Vincens, Pierre, Badel-Chagnon, Anne, Vialette, Stéphane, Jacq, Claude, Hazout, Serge
Motivation: Molecular evolution, which is classically assessed by comparison of individual proteins or genes between species, can now be studied by comparing co-expressed functional groups of genes....
Genomes containing Duplicates are Hard to compare (2006)
Chauve, Cedric, Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In this paper, we are interested in the algorithmic complexity of computing (dis)similarity measures between two genomes when they contain duplicated genes. In that case, there are usually two main...
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation (2006)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane
Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of breakpoints,...
Genomes containing Duplicates are Hard to compare (2006)
Chauve, Cedric, Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In this paper, we are interested in the algorithmic complexity of computing (dis)similarity measures between two genomes when they contain duplicated genes. In that case, there are usually two main...
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation (2006)
Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane
Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of breakpoints,...
Approximating the 2-interval pattern problem (2005)
Maxime Crochemore, Danny Hermelin, Gad M. L, Stéphane Vialette
Abstract. We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure prediction, asks...
What makes the arc-preserving subsequence problem hard (2005)
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Abstract. In molecular biology, RNA structure comparison and motif search are of great interest for solving major problems such as phylogeny reconstruction, prediction of molecule folding and...
What makes the arc-preserving subsequence problem hard (2005)
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S, P) by deleting...
What makes the Arc-Preserving Subsequence problem hard ? (2005)
Blin, Guillaume, Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In molecular biology, RNA structure comparison and motif search are of great interest for solving major problems such as phylogeny reconstruction, prediction of molecule folding and identification of...
What makes the Arc-Preserving Subsequence problem hard ? (2005)
Blin, Guillaume, Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane
In molecular biology, RNA structure comparison and motif search are of great interest for solving major problems such as phylogeny reconstruction, prediction of molecule folding and identification of...
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states (2004)
Lelandais, Gaëlle, Marc, Philippe, Vincens, Pierre, Jacq, Claude, Vialette, Stéphane
Abstract Background Information obtained by DNA microarray technology gives a rough snapshot of the transcriptome state, i.e. , the expression level of all the genes expressed in a cell population at...
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. (2004)
Lelandais, Gaëlle, Marc, Philippe, Vincens, Pierre, Jacq, Claude, Vialette, Stéphane
BACKGROUND: Information obtained by DNA microarray technology gives a rough snapshot of the transcriptome state, i.e., the expression level of all the genes expressed in a cell population at any...
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. (2004)
Lelandais, Gaëlle, Marc, Philippe, Vincens, Pierre, Jacq, Claude, Vialette, Stéphane
BACKGROUND: Information obtained by DNA microarray technology gives a rough snapshot of the transcriptome state, i.e., the expression level of all the genes expressed in a cell population at any...
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. (2004)
Lelandais, Gaëlle, Marc, Philippe, Vincens, Pierre, Jacq, Claude, Vialette, Stéphane
BACKGROUND: Information obtained by DNA microarray technology gives a rough snapshot of the transcriptome state, i.e., the expression level of all the genes expressed in a cell population at any...
yMGV: a cross-species expression data mining tool (2004)
Lelandais, Gaëlle, Le Crom, Stéphane, Devaux, Frédéric, Vialette, Stéphane, Church, George M., Jacq, Claude, ...
The yeast Microarray Global Viewer (yMGV @ http://transcriptome.ens.fr/ymgv) was created 3 years ago as a database that houses a collection of Saccharomyces cerevisiae and Schizosaccharo myces...
Sylvestre, Julien, Vialette, Stéphane, Corral Debrinski, Marisol, Jacq, Claude
Abstract Background Subcellular messenger RNA localization is important in most eukaryotic cells, even in unicellular organisms like yeast for which this process has been underestimated. Microarrays...
Margeot, Antoine, Blugeon, Corinne, Sylvestre, Julien, Vialette, Stéphane, Jacq, Claude, Corral-Debrinski, Marisol
We recently demonstrated that polysome-associated mRNAs that co-isolate with mitochondria encode a subset of mitochondrial proteins, and that the 3′ UTRs of these transcripts are essential for...
Sylvestre, Julien, Vialette, Stéphane, Corral Debrinski, Marisol, Jacq, Claude
Mitochondrial biogenesis requires concerted expression of the many genes whose products make up the organelle. Combining biochemical fractionations with oligonucleotide array analyses allowed...
yMGV: a cross-species expression data mining tool
Lelandais, Gaëlle, Le Crom, Stéphane, Devaux, Frédéric, Vialette, Stéphane, Church, George M., Jacq, Claude, ...
The yeast Microarray Global Viewer (yMGV @ http://transcriptome.ens.fr/ymgv) was created 3 years ago as a database that houses a collection of Saccharomyces cerevisiae and Schizosaccharo myces pombe...
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states
Lelandais, Gaëlle, Marc, Philippe, Vincens, Pierre, Jacq, Claude, Vialette, Stéphane
Margeot, Antoine, Blugeon, Corinne, Sylvestre, Julien, Vialette, Stéphane, Jacq, Claude, Corral-Debrinski, Marisol
We recently demonstrated that polysome-associated mRNAs that co-isolate with mitochondria encode a subset of mitochondrial proteins, and that the 3′ UTRs of these transcripts are essential for...
Sylvestre, Julien, Vialette, Stéphane, Corral Debrinski, Marisol, Jacq, Claude
Mitochondrial biogenesis requires concerted expression of the many genes whose products make up the organelle. Combining biochemical fractionations with oligonucleotide array analyses allowed...
yMGV: a cross-species expression data mining tool
Lelandais, Gaëlle, Le Crom, Stéphane, Devaux, Frédéric, Vialette, Stéphane, Church, George M., Jacq, Claude, ...
The yeast Microarray Global Viewer (yMGV @ http://transcriptome.ens.fr/ymgv) was created 3 years ago as a database that houses a collection of Saccharomyces cerevisiae and Schizosaccharo myces pombe...