Blin, Guillaume - Institut d'électronique et d'informatique Gaspard-Monge, Universite de Marne-la-Vallee

• En quelques mots La bio-information L'informatique Du support l'ordinateur Les apports de l'informatique La bio-informatique
• Introduction Nested common intervals on permutations Nested common intervals on sequences Conclusion Finding Nested Common Intervals
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
• RNA in few words Preliminaries EDIT(STEM. STEM) hardness Conclusion Comparing RNA structures with
• RNA in few words Preliminaries Maximum Arc-Preserving Common Subsequence problem Idea of the proof Conclusion Comparing RNA structures: towards an
• The breakpoint distance for signed sequences (extended abstract)
• RNA in few words Preliminaries Idea of the proof Conclusion Extending the hardness of RNA secondary
• What makes the Arc-Preserving Subsequence problem hard?
• Extending the Hardness of RNA Secondary Structure Comparison
• --Combinatoire et Bio-Informatique (ComBi) --RESEARCH REPORT
• The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
• Extracting Constrained 2-Interval Subsets in 2-Interval Sets
• Conserved Interval Distance Computation between Non-trivial Genomes
• Algorithmic of RNA Arc-annotated sequences The align hierarchy Derived results from existing model New results Conclusion How to compare arc-annotated sequences: the
• How to compare arc-annotated sequences: The alignment hierarchy
• Algorithmic of RNA Arc-annotated sequences The align hierarchy Derived results from existing model New results How to compare arc-annotated sequences: the
• Combinatoire et Bio-informatique: Comparaison de structures d'ARN et
• Comparison of Minisatellites S`everine Berard and Eric Rivals
• Preliminaries Bad news Some hope Experimental results Conclusion Inferring gene orders from gene maps using the
• 20060908 file:///home/associe/gblin/W3/cours/cours01/TD09.html #1TDdesystmen9varargsCeTDprsentelesfonctionsvariadiquessc'estvvdirepouvantaccepterunnombrevariabled'arguments.Detellesfonctionssontprintf,execl...Ladocumentationconcernantladclaration,ladfinit
• Graphes et ARN: une collaboration
• New results for the 2-interval pattern problem
• Combinatoire et Bio-informatique: Comparaison de structures d'ARN et
• What is RNA? Using graphs to represent RNA
• de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• X Y S R X Y
• UMLV L1 Page 1 Unix SUPPORT DE TD
• A faster algorithm for finding minimum Tucker submatrices
• Comparing RNA structures with biologically relevant operations cannot be done without
• COLE DOCTORALE STIM SCIENCES ET TECHNOLOGIES DE L'INFORMATION ET DES MATRIAUX
• Universit a di Pisa Dipartimento di Informatica
• The breakpoint distance for signed sequences
• Breakpoints distance. Let P = p1, . . . , pm be a signed permutation. A breakpoint in P is a pair of consecutive elements pipi+1 such that pi+1 = pi + 1. We denote
• New results for the 2-interval pattern problem Guillaume Blin1
• UMLV L1 Page 1 Emacs SUPPORT DE TD
• What makes the Arc-Preserving Subsequence problem hard?
• Curriculum vitae dtaill Guillaume Blin
• Java Avanc Eclipse pour les null
• Preliminaries Conserved Interval Distance between Non-trivial
• UMLV L1 Page 1 HTML SUPPORT DE TD
• Comparing RNA Structures: Towards an Intermediate Model Between the Edit and the
• Bio-Algorithmique : Etude algorithmique de probl`emes biologiques Guillaume BLIN
• Etude de l'ARN via l'utilisation de graphes
• TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 1 Comparing Genomes with Duplications: a
• NP-compltude de EDIT(Nested, Nested)
• Inferring gene orders from gene maps using the breakpoint distance
• Combinatoire et Bio-informatique: Comparaison de structures d'ARN et
• Cours Syst`eme 17 fevrier 2005
• Gene Maps Linearization using Genomic Rearrangement Guillaume Blin
• Preliminaries Refinement of the APS problem
• Situation professionnelle Ce tableau vous permet de remplir les rubriques Ministre , Profession et Etablissement d'exercice vous concernant.