Database Reference
In-Depth Information
33. Sanchez, G., Llados, J., and Tombre, K. (2002). A Mean String Algorithm
to Compute the Average Among a Set of 2D Shapes.
Pattern Recognition
Letters
,
(1-3), 203-213.
34. Sankoff, D. and Kruskal, J.B. (1983). (eds.).
Time Warps, String Edits, and
Macromolecules: The Theory and Practice of String Comparison
, Addison-
Wesley.
35. Sim, J.S. and Park, K. (2001). The Consensus String Problem for a Metric
is NP-Complete.
Journal of Discrete Algorithms
,
2
(1).
36. Stephen, G.A. (1994).
String Searching Algorithms
, World Scientific.
37. Subramanyan, K. and Dean, D. (2000). A Procedure to Average 3D Anatom-
ical Structures.
Medical Image Analysis
,
4
(4), 317-334.
38. Wagner, R.A. and Fischer, M.J. (1974). The String-to-String Correction
Problem.
Journal of the ACM
,
21
(1), 168-173.
39. Wang, L. and Jiang, Y. (1994). On the Complexity of Multiple Sequence
Alignment.
Journal of Computational Biology
,
1
(4), 337-348.
23
