-
4
-
-
1242319103
-
Pattern discovery and the algorithmics of surprise
-
Frasconi P., and Shamir R. (Eds), IOS Press
-
Apostolico A. Pattern discovery and the algorithmics of surprise. In: Frasconi P., and Shamir R. (Eds). Artificial Intelligence and Heuristic Methods for Bioinformatics (2003), IOS Press 111-127
-
(2003)
Artificial Intelligence and Heuristic Methods for Bioinformatics
, pp. 111-127
-
-
Apostolico, A.1
-
5
-
-
37249023148
-
Optimal extraction of irredundant motif bases
-
Proceedings of COCOON 07. Lin G. (Ed)
-
Apostolico A., and Tagliacollo C. Optimal extraction of irredundant motif bases. In: Lin G. (Ed). Proceedings of COCOON 07. Springer Lecture Notes in Computer Science, LNCS vol. 4598 (2007) 360-371
-
(2007)
Springer Lecture Notes in Computer Science, LNCS
, vol.4598
, pp. 360-371
-
-
Apostolico, A.1
Tagliacollo, C.2
-
6
-
-
0036036814
-
-
Richard Cole, Ramesh Hariharan, Verifying candidate matches in sparse and wildcard matching, in: STOC '02: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, 2002, pp. 592-601
-
Richard Cole, Ramesh Hariharan, Verifying candidate matches in sparse and wildcard matching, in: STOC '02: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, 2002, pp. 592-601
-
-
-
-
7
-
-
0002743213
-
String matching and other products
-
Karp R. (Ed), American Mathematical Society, Providence, RI
-
Fischer M.J., and Paterson M.S. String matching and other products. In: Karp R. (Ed). Proceedings of the SIAM-AMS Complexity of Computation (1974), American Mathematical Society, Providence, RI 113-125
-
(1974)
Proceedings of the SIAM-AMS Complexity of Computation
, pp. 113-125
-
-
Fischer, M.J.1
Paterson, M.S.2
-
8
-
-
0345566149
-
A guided tour to approximate string matching
-
Navarro G. A guided tour to approximate string matching. ACM Computing Surveys 33 1 (2001) 31-88
-
(2001)
ACM Computing Surveys
, vol.33
, Issue.1
, pp. 31-88
-
-
Navarro, G.1
-
10
-
-
55049133800
-
-
Laxmi Parida, Algorithmic techniques in computational genomics, Ph.D. Thesis, Department of Computer Science, New York University, 1998
-
Laxmi Parida, Algorithmic techniques in computational genomics, Ph.D. Thesis, Department of Computer Science, New York University, 1998
-
-
-
-
11
-
-
19944377164
-
Bases of motifs for generating repeated patterns with wild cards
-
Pisanti N., Crochemore M., Grossi R., and Sagot M.-F. Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2 1 (2005) 40-50
-
(2005)
IEEE/ACM Transactions on Computational Biology and Bioinformatics
, vol.2
, Issue.1
, pp. 40-50
-
-
Pisanti, N.1
Crochemore, M.2
Grossi, R.3
Sagot, M.-F.4
-
12
-
-
0033886876
-
-
Laxmi Parida, Isidore Rigoutsos, Aris Floratos, Dan Platt, Yuan Gao, Pattern discovery on character sets and real-valued data: Linear bound on irredundant motifs and an efficient polynomial time algorithm, in: Symposium on Discrete Algorithms, 2000, pp. 297-308
-
Laxmi Parida, Isidore Rigoutsos, Aris Floratos, Dan Platt, Yuan Gao, Pattern discovery on character sets and real-valued data: Linear bound on irredundant motifs and an efficient polynomial time algorithm, in: Symposium on Discrete Algorithms, 2000, pp. 297-308
-
-
-
|