Checkpoint
Crin
Racine
Checkpoint
Crin
Exploration
Accueil
Racine
Racine

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.

Le cluster Gregory Kucherov - Roman Kolpakov

Terms

40Gregory Kucherov
16Roman Kolpakov
13Laurent Noé
9Vladimir Grebinski

Associations

Freq.WeightAssociation
1212Gregory Kucherov - Roman Kolpakov
1111Gregory Kucherov - Laurent Noé
77Gregory Kucherov - Vladimir Grebinski
Documents par ordre de pertinence
000190 (2005) Mathilde Bouvel ; Vladimir Grebinski ; Gregory KucherovCombinatorial search on graphs motivated by bioinformatics applications : a brief survey
000199 (2005) Gregory Kucherov ; Laurent Noé ; Mikhail RoytbergMulti-seed lossless filtration
000349 (2005) Laurent Noé ; Gregory KucherovYASS : Enhancing the sensitivity of DNA similarity search
000460 (2005) Gregory Kucherov ; Laurent Noé ; Mikhail RoytbergA unifying framework for seed sensitivity and its application to subset seeds
000666 (2004) Gregory Kucherov ; Laurent Noé ; Mikhail RoytbergMulti-seed lossless filtration
000713 (2004) Gregory Kucherov ; Laurent Noé ; Yann PontyEstimating seed sensitivity on homogeneous alignments
000762 (2004) Laurent Noé ; Gregory KucherovYASS : Enhancing the sensitivity of DNA similarity search
000763 (2004) Laurent Noé ; Gregory KucherovImproved hit criteria for DNA local alignment
000918 (2003) Gregory Kucherov ; Laurent NoéYASS : similarity search in DNA sequences
000B49 (2003) Gregory Kucherov ; Laurent Noé ; Yann PontyEstimating seed sensitivity on homogeneous alignments
000C23 (2003) Laurent Noé ; Gregory KucherovYASS : Similarity search in DNA sequences
000C41 (2003) Roman Kolpakov ; Gregory KucherovFinding approximate repetitions under Hamming distance
000C90 (2003) Jean-Pierre Duval ; Roman Kolpakov ; Gregory Kucherov ; Thierry Lecroq ; Arnaud LefebvreLinear-Time Computation of Local Periods
000D95 (2003) Roman Kolpakov ; Ghizlane Bana ; Gregory Kucherovmreps : efficient and flexible detection of tandem repeats in DNA
000F02 (2002) Ghizlane Bana ; Roman Kolpakov ; Mathieu Giraud ; Ralph Rabbat ; Gregory Kucherovmreps : a program for exhaustive search for tandem repeats in DNA sequences
001209 (2002) Laurent Noé ; Gregory KucherovA new method of finding similarity regions in DNA sequences
001616 (2001) Roman Kolpakov ; Gregory KucherovFinding Approximate Repetitions under Hamming Distance
001617 (2001) Roman Kolpakov ; Gregory KucherovFinding Approximate Repetitions under Hamming Distance
001953 (2000) Vladimir Grebinski ; Gregory KucherovOptimal Reconstruction of Graphs under the Additive Model
001E41 (1999) Roman Kolpakov ; Gregory KucherovFinding Maximal Repetitions in a Word in Linear Time
001F31 (1999) Roman Kolpakov ; Gregory Kucherov ; Yuri TarannikovOn repetition-free binary words of minimal density
001F49 (1999) Roman Kolpakov ; Gregory KucherovOn the sum of exponents of maximal repetitions in a word
002008 (1999) Vladimir Grebinski ; Gregory KucherovReconstructing Set Partitions
002182 (1998) Vladimir Grebinski ; Gregory KucherovReconstructing a Hamiltonian Cycle by Querying the Graph : Application to DNA Physical Mapping
002307 (1998) Roman Kolpakov ; Gregory KucherovMaximal Repetitions in Words or How to Find all Squares in Linear Time
002315 (1998) Roman Kolpakov ; Gregory Kucherov ; Yuri TarannikovOn repetition-free binary words of minimal density
002589 (1997) Vladimir Grebinski ; Gregory KucherovOptimal Reconstruction of Graphs Under the Additive Model
002683 (1997) Vladimir Grebinski ; Gregory KucherovOptimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
002807 (1997) Roman Kolpakov ; Gregory KucherovMinimal Letter Frequency in n-power-free Binary Words
002879 (1996) Vladimir Grebinski ; Gregory KucherovReconstructing a Hamiltonian Circuit by Querying the Graph : Application to DNA Physical Mapping
000053 (2005) Laurent NoéRecherche de similarité dans les séquences d'ADN :modèles et algorithmes pour la conception de graines efficaces
000066 (2005) Fabrice Touzain ; Sophie Schbath ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Pierre Leblond ; Gregory KucherovSIGffRid : Programme de recherche des sites de fixation des facteurs de transcription par approche comparative
000A15 (2003) Fabrice Touzain ; Patricia Lavigne ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Pierre Leblond ; Gregory KucherovIdentification of Transcription Factor Binding Sites in Streptomyces coelicolor A3(2) by Phylogenetic Comparison
000A33 (2003) Patricia Lavigne ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Pierre Leblond ; Gregory KucherovIdentification of transcription factor binding sites in the genome of Streptomyces coelicolor A3(2)
000D87 (2003) Gregory Kucherov ; Pascal Ochem ; Michael RaoHow many square occurrences must a binary sequence contain?
000E58 (2002) Laurent NoéRecherche de répétitions distantes dans les séquences
001343 (2002) Gregory Kucherov ; Pascal Ochem ; Michael RaoHow many square occurrences must a binary sequence contain
001B62 (2000) Roman Kolpakov ; Grégory KucherovOn Maximal Repetitions in Words
001C03 (2000) Roman Kolpakov ; Grégory KucherovFinding Repeats With Fixed Gap
001C04 (2000) Roman Kolpakov ; Grégory KucherovFinding Repeats With Fixed Gap
001D05 (1999) Gregory Kucherov ; Michael RusinowitchPatterns in words versus patterns in trees : a brief survey and new results
001F51 (1999) David Plaisted ; Gregory KucherovThe Complexity of Some Complementation Problems
001F81 (1999) David Plaisted ; Gregory KucherovThe complexity of some complementation problems
002019 (1999) Roman Kolpakov ; Kucherov GregoryOn Maximal Repetitions in Words
002187 (1998) Vladimir GrebinskiRecherche Combinatoire : Problèmes de Pesage, Reconstruction de Graphes et Applications
002385 (1998) Vladimir GrebinskiOn the Power of Additive Combinatorial Search Model
002691 (1997) Gregory Kucherov ; Michael RusinowitchMatching a Set of Strings with Variable Length Don't Cares
002C08 (1995) Gregory Kucherov ; Michael RusinowitchMatching a Set of Strings with Variable Length Don't Cares
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