The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gregory Kucherov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gregory Kucherov, Michaël Rusinowitch
    Matching a Set of Strings with Variable Length don't Cares. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:178, n:1-2, pp:129-154 [Journal]
  2. Gregory Kucherov
    A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:204-213 [Conf]
  3. Gregory Kucherov, Laurent Noé, Yann Ponty
    Estimating Seed Sensitivity on Homogeneous Alignments. [Citation Graph (0, 0)][DBLP]
    BIBE, 2004, pp:387-394 [Conf]
  4. Dieter Hofbauer, Maria Huber, Gregory Kucherov
    Some Results on Top-Context-Free Tree Languages. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:157-171 [Conf]
  5. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    Multi-seed Lossless Filtration (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:297-310 [Conf]
  6. Gregory Kucherov, Michaël Rusinowitch
    Matching a Set of Strings with Variable Length Don't Cares. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:230-247 [Conf]
  7. Gregory Kucherov, Michaël Rusinowitch
    The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:262-275 [Conf]
  8. Gregory Kucherov, Mohamed Tajine
    Decidability of Regularity and Related Properties of Ground Normal Form Languages. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:272-286 [Conf]
  9. Gregory Kucherov, Michaël Rusinowitch
    Patterns in Words versus Patterns in Trees: A Brief Survey and New Results. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1999, pp:283-296 [Conf]
  10. Vladimir Grebinski, Gregory Kucherov
    Optimal Reconstruction of Graphs Under the Additive Model. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:246-258 [Conf]
  11. Roman M. Kolpakov, Gregory Kucherov
    Finding Approximate Repetitions under Hamming Distance. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:170-181 [Conf]
  12. Alexandre V. Zamulin, V. A. Kositov, Gregory Kucherov, E. V. Pak
    The Database Programming Language Atlant: Principal Features and Implementation techniques. [Citation Graph (0, 0)][DBLP]
    East/West Database Workshop, 1990, pp:385-402 [Conf]
  13. Roman M. Kolpakov, Gregory Kucherov
    On Maximal Repetitions in Words. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:374-385 [Conf]
  14. Roman M. Kolpakov, Gregory Kucherov
    Finding Maximal Repetitions in a Word in Linear Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:596-604 [Conf]
  15. Vladimir Grebinski, Gregory Kucherov
    Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:166-173 [Conf]
  16. Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
    Optimal Linear Arrangement of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:267-279 [Conf]
  17. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
    Linear-Time Computation of Local Periods. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:388-397 [Conf]
  18. Roman M. Kolpakov, Gregory Kucherov
    Minimal Letter Frequency in n-th Power-Free Binary Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:347-357 [Conf]
  19. Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov
    On Repetition-Free Binary Words of Minimal Density. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:683-692 [Conf]
  20. Gregory Kucherov
    On Relationship Between Term Rewriting Systems and Regular Tree Languages. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:299-311 [Conf]
  21. Gregory Kucherov, Michaël Rusinowitch
    On ground reducibility problem for word rewriting systems with variables. [Citation Graph (0, 0)][DBLP]
    SAC, 1994, pp:271-276 [Conf]
  22. Vladimir Grebinski, Gregory Kucherov
    Reconstructing Set Partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:915-916 [Conf]
  23. Roman M. Kolpakov, Gregory Kucherov
    Finding Repeats with Fixed Gap. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:162-168 [Conf]
  24. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:251-263 [Conf]
  25. Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
    Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:16-27 [Conf]
  26. François Bertault, Gregory Kucherov
    Visualization of Dynamic Automata Using Padnon. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1997, pp:25-28 [Conf]
  27. Vladimir Grebinski, Gregory Kucherov
    Optimal Reconstruction of Graphs under the Additive Model. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:104-124 [Journal]
  28. Laurent Noé, Gregory Kucherov
    Improved hit criteria for DNA local alignment. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:149- [Journal]
  29. Gregory Kucherov, Pascal Ochem, Michaël Rao
    How Many Square Occurrences Must a Binary Sequence Contain? [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  30. Vladimir Grebinski, Gregory Kucherov
    Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:147-165 [Journal]
  31. Gregory Kucherov, Mohamed Tajine
    Decidability of Regularity and Related Properties of Ground Normal Form Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:1, pp:91-100 [Journal]
  32. Gregory Kucherov, Michaël Rusinowitch
    Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:4, pp:209-215 [Journal]
  33. David A. Plaisted, Gregory Kucherov
    The Complexity of Some Complementation Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:159-165 [Journal]
  34. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    A Unifying Framework for Seed Sensitivity and its Application to Subset Seeds. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:2, pp:553-570 [Journal]
  35. Gregory Kucherov, Andrey A. Mironov, Mikhail A. Roytberg
    An Overview of the Algorithmic Session of MCCMB'05. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:2, pp:- [Journal]
  36. Roman M. Kolpakov, Ghizlane Bana, Gregory Kucherov
    mreps: efficient and flexible detection of tandem repeats in DNA. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2003, v:31, n:13, pp:3672-3678 [Journal]
  37. Laurent Noé, Gregory Kucherov
    YASS: enhancing the sensitivity of DNA similarity search. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2005, v:33, n:Web-Server-Issue, pp:540-543 [Journal]
  38. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    Multiseed Lossless Filtration. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2005, v:2, n:1, pp:51-61 [Journal]
  39. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
    Linear-time computation of local periods. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:229-240 [Journal]
  40. Roman M. Kolpakov, Gregory Kucherov
    Finding approximate repetitions under Hamming distance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:135-156 [Journal]
  41. Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov
    On Repetition-Free Binary Words of Minimal Density. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:218, n:1, pp:161-175 [Journal]
  42. Gregory Kucherov, Pierre Lescanne, Peter D. Mosses
    Valentin M. Antimirov (1961-1995). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:289-290 [Journal]
  43. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    Subset Seed Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:180-191 [Conf]
  44. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    A unifying framework for seed sensitivity and its application to subset seeds [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  45. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    A unifying framework for seed sensitivity and its application to subset seeds (Extended abstract) [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  46. Gregory Kucherov, Laurent Noé, Yann Ponty
    Estimating seed sensitivity on homogeneous alignments [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  47. Searching for Gapped Palindromes. [Citation Graph (, )][DBLP]


  48. CPM's 20th Anniversary: A Statistical Retrospective. [Citation Graph (, )][DBLP]


  49. Protein Similarity Search with Subset Seeds on a Dedicated Reconfigurable Hardware. [Citation Graph (, )][DBLP]


  50. Seed Design Framework for Mapping SOLiD Reads. [Citation Graph (, )][DBLP]


  51. Back-Translation for Discovering Distant Protein Homologies. [Citation Graph (, )][DBLP]


  52. Efficient Seeding Techniques for Protein Similarity Search. [Citation Graph (, )][DBLP]


  53. SIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically driven statistics. [Citation Graph (, )][DBLP]


  54. Optimal neighborhood indexing for protein similarity search. [Citation Graph (, )][DBLP]


  55. On maximal repetitions of arbitrary exponent [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002