A combinatorial approach to automatic discovery of cluster-patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2812, Issue , 2003, Pages 139-150

  Eres, Revital ^a   Landau, Gad M ^a,b   Parida, Laxmi ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Clusters; Combinatorial algorithms on words; Data mining; Design and analysis of algorithms; Discovery; Motifs; Patterns

Indexed keywords

DATA MINING; GENES; PROTEINS;

CLUSTERS; COMBINATORIAL ALGORITHM; DESIGN AND ANALYSIS OF ALGORITHMS; DISCOVERY; MOTIFS; PATTERNS;

CLUSTERING ALGORITHMS;

EID: 35248867070     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39763-2_11     Document Type: Article

References (20)

1. A. Amir, A. Apostolico, G. M. Landau, and G. Satta. Efficient text fingerprinting via parikh mapping. Journal of Discrete Algorithms, 2003. to appear.
2. A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.
3. Brown, Clark, Leader, Simpson, and Lowe. RNA, 7:1817-1832, 2001.
4. T Dandekar, B Snel, M Huynen, and P Bork. Trends Biochem. Sci., 23:324-328, 1998.
5. S Giglio, K W Broman, N Matsumoto, V Calvari, G Gimelli, T Neuman, H Obashi, L Voullaire, D Larizza, R Giorda, J L Weber, D H Ledbetter, and O Zuffardi. Olfactory receptor-gene clusters, genomic-inversion polymorphisms, and common chromosme rearrangements. Am. J. Hum. Genet., 68(4):874-883, 2001.
6. Steffen Heber and Jens Stoye. Finding all common intervals of k permutations. In Proc. of the Twelfth Symp. on Comp. Pattern Matching, volume 2089 of Lecture Notes in Computer Science, pages 207-218. Springer-Verlag, 2001.
7. D. Kihara and M. Kanehisa. Genome Res, 10:731-743, 2000.
8. Z. M. Kedem, G. M. Landau, and K. V. Palem. Parallel suffix-prefix matching algorithm and application. SIAM Journal of Computing, 25(5):998-1023, 1996.
9. R. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strngs, arrays and trees. In Symposium on Theory of Computing, volume 4, pages 125-136, 1972.
10. J. G. Lawrence and J. R. Roth. Genetics, 143:1843-1860, 1996.
11. Akhiro Nakaya, Susumo Goto, and Minoru Kanehisa. Extraction of corelated gene clusters by mulitple graph comparison. Genome Informatics, No 12:44-53, 2001.
12. R Overbeek, M Fonstein, M Dsouza, G D Pusch, and N Maltsev. The use of gene clusters to infer functional coupling. Proc. Natl Acad. Sci. USA, 96(6):2896-2901, 1999.
13. H. Ogata, W. Fujibuchi, and S. Goto. Nucleic Acids Res, 28:4021-4028, 2000.
14. Laxmi Parida. Some results on flexible-pattern matching. In Proc. of the Eleventh Symp. on Comp. Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 33-45. Springer-Verlag, 2000.
15. E M Marcott M Pellegrini, H L Ng, D W Rice, T O Yeates, and D Eisenberg. Detecting protein function and protein-protein interactions. Science, 285:751-753, 1999.
16. B. Snel, G Lehmann, P Bork, and M A Huynen. A web-server to retrieve and display repeatedly occurring neighbourhood of a gene. Nucleic Acids Research, 28(18):3443-3444, 2000.
17. J L Siefert, K A Martin, F Abdi, W R Widger, and G E Fox. J. Mol. Evol., 45:467-472, 1997.
18. J Tamames, G Casari, G Ouzounis, and A Valencia. J. Mol. Evol., 44:66-73, 1997.
19. K. Tomii and M. Kanehisa. Genome Res, 8:1048-1059, 1998.
20. H Watanbe, H Mori, T Itoh, and T Gojobori. J. Mol. Evol., 44:S57-S64, 1997.