( en | de | ru )

 

Disambiguation of "Ann, Hsing-Yen"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient indexing algorithms for one-dimensional discretely-scaled strings.

, , , and . Inf. Process. Lett., 110 (16): 730-734 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Chen-hsing Yen

Wenjung Hsing

Chi-Wu Hsing

Yen Yen Kwan

Tina Yener

 

Other publications of authors with the same name

Dynamic programming algorithms for the mosaic longest common subsequence problem., , , , and . Inf. Process. Lett., 102 (2-3): 99-103 (2007)Efficient indexing algorithms for one-dimensional discretely-scaled strings., , , and . Inf. Process. Lett., 110 (16): 730-734 (2010)Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion., , and . J. Comb. Optim., 28 (4): 800-813 (2014)A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures., , and . Pattern Recognit., 33 (8): 1263-1276 (2000)Efficient algorithms for the block edit problems., , , and . Inf. Comput., 208 (3): 221-229 (2010)Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints., , and . BIBE, page 175-180. IEEE Computer Society, (2011)An Efficient Signature File Strategy for Similarity Retrieval from Large Iconic Image Databases., , and . J. Vis. Lang. Comput., 13 (2): 117-147 (2002)A note on adaptive 2D-H strings., and . Pattern Recognit. Lett., 20 (1): 15-20 (1999)Efficient algorithms for finding interleaving relationship between sequences., , , , and . Inf. Process. Lett., 105 (5): 188-193 (2008)A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings., , , and . Inf. Process. Lett., 108 (6): 360-364 (2008)