Secure and private sequence comparisons
- 30 October 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- An algorithm for the distance between two finite sequencesJournal of Combinatorial Theory, Series A, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970