Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Combinatorial search on graphs motivated by bioinformatics applications : A brief survey

Identifieur interne : 000554 ( PascalFrancis/Curation ); précédent : 000553; suivant : 000555

Combinatorial search on graphs motivated by bioinformatics applications : A brief survey

Auteurs : Mathilde Bouvel [France] ; Vladimir Grebinski [États-Unis] ; Gregory Kucherov [France]

Source :

RBID : Pascal:06-0070705

Descripteurs français

English descriptors

Abstract

The goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.
pA  
A01 01  1    @0 0302-9743
A05       @2 3787
A08 01  1  ENG  @1 Combinatorial search on graphs motivated by bioinformatics applications : A brief survey
A09 01  1  ENG  @1 Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers
A11 01  1    @1 BOUVEL (Mathilde)
A11 02  1    @1 GREBINSKI (Vladimir)
A11 03  1    @1 KUCHEROV (Gregory)
A14 01      @1 Département d'Informatique, Ecole Normale Supérieure de Cachan @2 94235 @3 FRA @Z 1 aut.
A14 02      @1 CompuGene Inc @2 Jamesburg, NJ 08831 @3 USA @Z 2 aut.
A14 03      @1 INRIA/LORIA, 615, rue du Jardin Botanique, B.P. 101 @2 54602, Villers-lès-Nancy @3 FRA @Z 3 aut.
A20       @1 16-27
A21       @1 2005
A23 01      @0 ENG
A26 01      @0 3-540-31000-2
A43 01      @1 INIST @2 16343 @5 354000138680970020
A44       @0 0000 @1 © 2006 INIST-CNRS. All rights reserved.
A45       @0 22 ref.
A47 01  1    @0 06-0070705
A60       @1 P @2 C
A61       @0 A
A64 01  1    @0 Lecture notes in computer science
A66 01      @0 DEU
C01 01    ENG  @0 The goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.
C02 01  X    @0 001D02A06
C03 01  X  FRE  @0 Théorie graphe @5 01
C03 01  X  ENG  @0 Graph theory @5 01
C03 01  X  SPA  @0 Teoría grafo @5 01
C03 02  X  FRE  @0 Informatique théorique @5 02
C03 02  X  ENG  @0 Computer theory @5 02
C03 02  X  SPA  @0 Informática teórica @5 02
C03 03  X  FRE  @0 Bioinformatique @5 06
C03 03  X  ENG  @0 Bioinformatics @5 06
C03 03  X  SPA  @0 Bioinformática @5 06
C03 04  X  FRE  @0 Interrogation base donnée @5 07
C03 04  X  ENG  @0 Database query @5 07
C03 04  X  SPA  @0 Interrogación base datos @5 07
C03 05  X  FRE  @0 Génétique @5 18
C03 05  X  ENG  @0 Genetics @5 18
C03 05  X  SPA  @0 Genética @5 18
C03 06  X  FRE  @0 Génome @5 19
C03 06  X  ENG  @0 Genome @5 19
C03 06  X  SPA  @0 Genoma @5 19
C03 07  X  FRE  @0 Séquençage @5 20
C03 07  X  ENG  @0 Sequencing @5 20
C03 07  X  SPA  @0 Sequencing @5 20
C03 08  X  FRE  @0 Reconstruction graphe @5 23
C03 08  X  ENG  @0 Graph reconstruction @5 23
C03 08  X  SPA  @0 Reconstrucción grafo @5 23
N21       @1 037
N44 01      @1 OTO
N82       @1 OTO
pR  
A30 01  1  ENG  @1 Graph-theoretic concepts in computer science. International workshop @2 31 @3 Metz FRA @4 2005-06-23

Links toward previous steps (curation, corpus...)


Links to Exploration step

Pascal:06-0070705

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Combinatorial search on graphs motivated by bioinformatics applications : A brief survey</title>
<author>
<name sortKey="Bouvel, Mathilde" sort="Bouvel, Mathilde" uniqKey="Bouvel M" first="Mathilde" last="Bouvel">Mathilde Bouvel</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Département d'Informatique, Ecole Normale Supérieure de Cachan</s1>
<s2>94235</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author>
<name sortKey="Grebinski, Vladimir" sort="Grebinski, Vladimir" uniqKey="Grebinski V" first="Vladimir" last="Grebinski">Vladimir Grebinski</name>
<affiliation wicri:level="1">
<inist:fA14 i1="02">
<s1>CompuGene Inc</s1>
<s2>Jamesburg, NJ 08831</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author>
<name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation wicri:level="1">
<inist:fA14 i1="03">
<s1>INRIA/LORIA, 615, rue du Jardin Botanique, B.P. 101</s1>
<s2>54602, Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">06-0070705</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 06-0070705 INIST</idno>
<idno type="RBID">Pascal:06-0070705</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000479</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000554</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Combinatorial search on graphs motivated by bioinformatics applications : A brief survey</title>
<author>
<name sortKey="Bouvel, Mathilde" sort="Bouvel, Mathilde" uniqKey="Bouvel M" first="Mathilde" last="Bouvel">Mathilde Bouvel</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Département d'Informatique, Ecole Normale Supérieure de Cachan</s1>
<s2>94235</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author>
<name sortKey="Grebinski, Vladimir" sort="Grebinski, Vladimir" uniqKey="Grebinski V" first="Vladimir" last="Grebinski">Vladimir Grebinski</name>
<affiliation wicri:level="1">
<inist:fA14 i1="02">
<s1>CompuGene Inc</s1>
<s2>Jamesburg, NJ 08831</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author>
<name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation wicri:level="1">
<inist:fA14 i1="03">
<s1>INRIA/LORIA, 615, rue du Jardin Botanique, B.P. 101</s1>
<s2>54602, Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint>
<date when="2005">2005</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Bioinformatics</term>
<term>Computer theory</term>
<term>Database query</term>
<term>Genetics</term>
<term>Genome</term>
<term>Graph reconstruction</term>
<term>Graph theory</term>
<term>Sequencing</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Théorie graphe</term>
<term>Informatique théorique</term>
<term>Bioinformatique</term>
<term>Interrogation base donnée</term>
<term>Génétique</term>
<term>Génome</term>
<term>Séquençage</term>
<term>Reconstruction graphe</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr">
<term>Génétique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">The goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0302-9743</s0>
</fA01>
<fA05>
<s2>3787</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG">
<s1>Combinatorial search on graphs motivated by bioinformatics applications : A brief survey</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>BOUVEL (Mathilde)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>GREBINSKI (Vladimir)</s1>
</fA11>
<fA11 i1="03" i2="1">
<s1>KUCHEROV (Gregory)</s1>
</fA11>
<fA14 i1="01">
<s1>Département d'Informatique, Ecole Normale Supérieure de Cachan</s1>
<s2>94235</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>CompuGene Inc</s1>
<s2>Jamesburg, NJ 08831</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03">
<s1>INRIA/LORIA, 615, rue du Jardin Botanique, B.P. 101</s1>
<s2>54602, Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20>
<s1>16-27</s1>
</fA20>
<fA21>
<s1>2005</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA26 i1="01">
<s0>3-540-31000-2</s0>
</fA26>
<fA43 i1="01">
<s1>INIST</s1>
<s2>16343</s2>
<s5>354000138680970020</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>22 ref.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>06-0070705</s0>
</fA47>
<fA60>
<s1>P</s1>
<s2>C</s2>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01">
<s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>The goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D02A06</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE">
<s0>Théorie graphe</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG">
<s0>Graph theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA">
<s0>Teoría grafo</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE">
<s0>Informatique théorique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Computer theory</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>Informática teórica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Bioinformatique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Bioinformatics</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Bioinformática</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Interrogation base donnée</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Database query</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Interrogación base datos</s0>
<s5>07</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE">
<s0>Génétique</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG">
<s0>Genetics</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA">
<s0>Genética</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE">
<s0>Génome</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG">
<s0>Genome</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA">
<s0>Genoma</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE">
<s0>Séquençage</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG">
<s0>Sequencing</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA">
<s0>Sequencing</s0>
<s5>20</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE">
<s0>Reconstruction graphe</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG">
<s0>Graph reconstruction</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA">
<s0>Reconstrucción grafo</s0>
<s5>23</s5>
</fC03>
<fN21>
<s1>037</s1>
</fN21>
<fN44 i1="01">
<s1>OTO</s1>
</fN44>
<fN82>
<s1>OTO</s1>
</fN82>
</pA>
<pR>
<fA30 i1="01" i2="1" l="ENG">
<s1>Graph-theoretic concepts in computer science. International workshop</s1>
<s2>31</s2>
<s3>Metz FRA</s3>
<s4>2005-06-23</s4>
</fA30>
</pR>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000554 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000554 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:06-0070705
   |texte=   Combinatorial search on graphs motivated by bioinformatics applications : A brief survey
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022