Hsing-Yen Ann
According to our database1,
Hsing-Yen Ann
authored at least 11 papers
between 1999 and 2014.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2014
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion.
J. Comb. Optim., 2014
2011
Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints.
Proceedings of the 11th IEEE International Conference on Bioinformatics and Bioengineering, 2011
2010
Inf. Process. Lett., 2010
2009
Fast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009
2008
Inf. Process. Lett., 2008
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings.
Inf. Process. Lett., 2008
2007
Inf. Process. Lett., 2007
2002
An Efficient Signature File Strategy for Similarity Retrieval from Large Iconic Image Databases.
J. Vis. Lang. Comput., 2002
2000
A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures.
Pattern Recognit., 2000
1999