Pedro J. Tejada

Learn More
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed runlengths (i.e., maximum number of consecutive occurrences of the same symbol). We show(More)
We present a simple method based on computational-geometry for extracting contours from digital images. Unlike traditional image processing methods, our proposed method first extracts a set of oriented feature points from the input images, then applies a sequence of geometric techniques, including clustering, linking, and simplification, to find contours(More)
RNA secondary structure prediction is a fundamental problem in structural bioinformatics. The prediction problem is difficult because RNA secondary structures may contain pseudoknots formed by crossing base pairs. We introduce k-partite secondary structures as a simple classification of RNA secondary structures with pseudoknots. An RNA secondary structure(More)
Let S be a set of n symbols. Let A be an n × n square grid with each cell labeled by a distinct symbol in S. Let B be another n × n square grid, also with each cell labeled by a distinct symbol in S. Then each symbol in S labels two cells, one in A and one in B. Define the combined distance between two symbols in S as the distance between the two cells in A(More)
  • 1