PascalFr.i
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

Index « PascalFr.i » - entrée « Concordance forme »
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.
Conceptualisation < Concordance forme < Condition  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 15.
Ident.Authors (with country if any)Title
000060 (2013) Nicolas Normand [France] ; Robin Strand [Suède] ; Pierre Evenou [France] ; Aurore Arlicot [France]Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D
000118 (2011) Violeta I. Perez-Nueno [France] ; David W. Ritchie [France]Using Consensus-Shape Clustering To Identify Promiscuous Ligands and Protein Targets and To Choose the Right Query for Shape-Based Virtual Screening
000381 (2006) Emilie Balland [France] ; Claude Kirchner [France] ; Pierre-Etienne Moreau [France]Formal islands
000574 (2004) Horatiu Cirstea [France] ; Luigi Liquori [France] ; Benjamin Wack [France]Rewriting calculus with fixpoints: Untyped and first-order systems
000577 (2004) Tarek Abbes [France] ; Adel Bouhoula [Tunisie] ; Michaël Rusinowitch [France]Protocol analysis in intrusion detection using decision tree
000583 (2004) Tarek Abbes [France] ; Adel Bouhoula [Tunisie] ; Michael Rusinowitch [France]On the fly pattern matching for intrusion detection with Snort
000590 (2004) Gregory Kucherov [France] ; Laurent Noe [France] ; Mikhail Roytberg [Russie]Multi-seed lossless filtration
000679 (2003) Gilles Barthe [États-Unis, France] ; Horatiu Cirstea ; Claude Kirchner ; Luigi LiquoriPure patterns Type systems
000703 (2003) Roman Kolpakov [Russie] ; Gregory Kucherov [France]Finding approximate repetitions under Hamming distance
000899 (2001) Christophe Ringeissen [France]Matching with free function symbols : A simple extension of matching?
000900 (2001) Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France]Matching power
000904 (2001) Roman Kolpakov [France] ; Gregory Kucherov [France]Finding approximate repetitions under hamming distance
000C23 (1997) G. Kucherov [France] ; M. Rusinowitch [France]Matching a set of strings with variable length don’t cares
000D00 (1996) C. Ringeissen [France]Combining decision algorithms for matching in the union of disjoint equational theories
000D20 (1995) G. Kucherov [France] ; M. RusinowitchUndecidability of ground reducibility for word rewriting systems with variables

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i -k "Concordance forme" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i  \
                -Sk "Concordance forme" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    PascalFr.i
   |clé=    Concordance forme
}}
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