Result 1 to 20 of 132 total
Parameterized searching with mismatches for run-length encoded strings. (English)
Theor. Comput. Sci. 454, 23-29 (2012).
1
Range LCP. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 683-692 (2011).
2
Image compression by 2D motif basis (English)
DCC, 153-162 (2011).
4
Sequence similarity by gapped LZW (English)
DCC, 343-352 (2011).
5
Optimal extraction of irredundant motif bases. (English)
Int. J. Found. Comput. Sci. 21, No. 6, 1035-1047 (2010).
6
Parameterized searching with mismatches for run-length encoded strings. (Extended abstract). (English)
Chavez, Edgar (ed.) et al., String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16320-3/pbk). Lecture Notes in Computer Science 6393, 365-371 (2010).
7
A PTAS for the square tiling problem. (English)
Chavez, Edgar (ed.) et al., String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16320-3/pbk). Lecture Notes in Computer Science 6393, 118-126 (2010).
8
Maximal words in sequence comparisons based on subword composition. (English)
Elomaa, Tapio (ed.) et al., Algorithms and applications. Essays dedicated to Esko Ukkonen on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-12475-4/pbk). Lecture Notes in Computer Science 6060, 34-44 (2010).
9
VARUN: discovering extensible motifs under saturation constraints (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 7, No. 4, 752-762 (2010).
10
Maximal words in sequence comparisons based on subword composition (English)
Algorithms and Applications, 34-44 (2010).
11
Parameterized searching with mismatches for run-length encoded strings - (Extended abstract) (English)
SPIRE, 365-371 (2010).
12
A PTAS for the square tiling problem (English)
SPIRE, 118-126 (2010).
13
Alignment of biological sequences with quality scores. (English)
Int. J. Bioinform. Res. Appl. 5, No. 1, 97-113 (2009).
14
Ask not what stringology can do for you: advances in pattern matching driven by computational biology. (English)
Commun. Inf. Syst. 9, No. 3, 235-252 (2009).
15
The subsequence composition of a string. (English)
Theor. Comput. Sci. 410, No. 43, 4360-4371 (2009).
16
Discovering subword associations in strings in time linear in the output size. (English)
J. Discrete Algorithms 7, No. 2, 227-238 (2009).
17
Graph compression by BFS (English)
Algorithms 2, No. 3, 1031-1044 (2009).
18
Probing the randomness of proteins by their subsequence composition (English)
DCC, 173-182 (2009).
19
Incremental discovery of the irredundant motif bases for all suffixes of a string in $O(n^2\log n)$time. (English)
Theor. Comput. Sci. 408, No. 2-3, 106-115 (2008).
20
Result 1 to 20 of 132 total
Start
Contact
Print
General Help
