Hsing-Yen Ann

According to our database, Hsing-Yen Ann authored at least 11 papers between 1999 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2014

Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion.

Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng

J. Comb. Optim., 2014

2013

Efficient algorithms for the longest common subsequence problem with sequential substring constraints.

Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann

J. Complex., 2013

2012

Fast algorithms for computing the constrained LCS of run-length encoded strings.

Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor

Theor. Comput. Sci., 2012

2010

Efficient indexing algorithms for one-dimensional discretely-scaled strings.

Yung-Hsing Peng, Chang-Biau Yang, Kuo-Si Huang, Hsing-Yen Ann

Inf. Process. Lett., 2010

Efficient algorithms for the block edit problems.

Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, Bern-Cherng Liaw

Inf. Comput., 2010

2008

Efficient algorithms for finding interleaving relationship between sequences.

Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng

Inf. Process. Lett., 2008

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings.

Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor

Inf. Process. Lett., 2008

2007

Dynamic programming algorithms for the mosaic longest common subsequence problem.

Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann

Inf. Process. Lett., 2007

2002

An Efficient Signature File Strategy for Similarity Retrieval from Large Iconic Image Databases.

Ye-In Chang, Hsing-Yen Ann, Wei-Horng Yeh

J. Vis. Lang. Comput., 2002

2000

A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures.

Ye-In Chang, Hsing-Yen Ann, Wei-Horng Yeh

Pattern Recognit., 2000

1999

A note on adaptive 2D-H strings.

Ye-In Chang, Hsing-Yen Ann

Pattern Recognit. Lett., 1999