SCOPUS 정보 검색 플랫폼

Mathematical and Computer Modelling

Volumn 42, Issue 7-8, 2005, Pages 855-866

Implementing approximate regularities

(4) Christodoulakis, M a Iliopoulos, C S a Park, Kunsoo b Sim, Jeong Seop c

a KING'S COLLEGE LONDON (United Kingdom)

b Seoul National University (South Korea)

c Inha University (South Korea)

Author keywords

Approximate cover; Approximate period; Approximate regularities; Approximate seed; Edit distance; Hamming distance; Restricted smallest distance approximation; Smallest distance approximation; Weighted edit distance

Indexed keywords

APPROXIMATE COVER; APPROXIMATE PERIOD; APPROXIMATE REGULARITIES; APPROXIMATE SEED; EDIT DISTANCE; HAMMING DISTANCE; SMALLEST DISTANCE APPROXIMATION; WEIGHTED EDIT DISTANCE;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

COMPUTATIONAL METHODS;

EID: 29144457597 PISSN: 08957177 EISSN: None Source Type: Journal
DOI: 10.1016/j.mcm.2005.09.013 Document Type: Conference Paper

Times cited : (8)

References (7)

1
- 0004463119
- Algorithms for computing evolutionary chains in molecular and musical sequences
- M. Crochemore, C.S. Iliopoulos, and H. Yu Algorithms for computing evolutionary chains in molecular and musical sequences Proc. 9th Australasian Workshop on Combinatorial Algorithms 1998 172 185
- (1998) Proc. 9th Australasian Workshop on Combinatorial Algorithms , pp. 172-185
- Crochemore, M.¹ Iliopoulos, C.S.² Yu, H.³

2
- 34748868569
- An algorithm for approximate tandem repeats
- Springer-Verlag
- G.M. Landau, and J.P. Schmidt An algorithm for approximate tandem repeats Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, Padova, Italy Volume 684 1993 Springer-Verlag 120 133
- (1993) Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, Padova, Italy , vol.684 , pp. 120-133
- Landau, G.M.¹ Schmidt, J.P.²

3
- 0001596047
- All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings
- J.P. Schmidt All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings SIAM Journal on Computing 27 4 1998 972 992
- (1998) SIAM Journal on Computing , vol.27 , Issue.4 , pp. 972-992
- Schmidt, J.P.¹

4
- 0034916536
- Approximate periods of strings
- J.S. Sim, C.S. Iliopoulos, K. Park, and W.F. Smyth Approximate periods of strings Theoretical Computer Science 262 2001 557 568
- (2001) Theoretical Computer Science , vol.262 , pp. 557-568
- Sim, J.S.¹ Iliopoulos, C.S.² Park, K.³ Smyth, W.F.⁴

5
- 29144508855
- Finding approximate covers of strings
- J.S. Sim, K. Park, S. Kim, and J. Lee Finding approximate covers of strings Journal of Korea Information Science Society 29 1 2002 16 21
- (2002) Journal of Korea Information Science Society , vol.29 , Issue.1 , pp. 16-21
- Sim, J.S.¹ Park, K.² Kim, S.³ Lee, J.⁴

6
- 29144496055
- Approximate seeds of strings
- M. Christodoulakis, C.S. Iliopoulos, K. Park, and J.S. Sim Approximate seeds of strings Proceedings of the Prague Stringology Conference 2003 25 36
- (2003) Proceedings of the Prague Stringology Conference , pp. 25-36
- Christodoulakis, M.¹ Iliopoulos, C.S.² Park, K.³ Sim, J.S.⁴

7
- 84937406750
- A dynamic edit distance table
- Springer Berlin
- S. Kim, and K. Park A dynamic edit distance table Proc. 11th Symp. Combinatorial Pattern Matching Volume 1848 2000 Springer Berlin 60 68
- (2000) Proc. 11th Symp. Combinatorial Pattern Matching , vol.1848 , pp. 60-68
- Kim, S.¹ Park, K.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.