Edit distance with duplications and contractions revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6661 LNCS, Issue , 2011, Pages 441-454

  Pinhas, Tamar ^a   Tsur, Dekel ^a   Zakov, Shay ^a   Ziv Ukelson, Michal ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; EDIT DISTANCE; INPUT STRING; MATRIX-VECTOR; ON-LINE ALGORITHMS; RUN-LENGTH ENCODING; RUNNING TIME; SQUARE MATRICES; TIME ALGORITHMS; TIME COMPLEXITY;

COST FUNCTIONS; ELECTROSTATIC DISCHARGE; PATTERN MATCHING;

ALGORITHMS;

EID: 79960101635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_37     Document Type: Conference Paper

References (15)

1. Abouelhoda, M.I., Giegerich, R., Behzadi, B., Steyaert, J.-M.: Alignment of minisatellite maps based on run-length encoding scheme. J. of Bioinformatics and Computational Biology 7(2), 287-308 (2009)
2. Akutsu, T.: Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages. J. of Combinatorial Optimization 3(2), 321-336 (1999)
3. Arlazarov, V.L., Dinic, E.A., Kronod, M.A., Faradzev, I.A.: On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl. 11, 1209-1210 (1970)
4. Behzadi, B., Steyaert, J.M.: The minisatellite transformation problem revisited: A run length encoded approach. Algorithms in Bioinformatics, 290-301 (2004)
5. Behzadi, B., Steyaert, J.M.: An improved algorithm for generalized comparison of minisatellites. J. of Discrete Algorithms 3(2-4), 375-389 (2005)
6. Benedí, J.M., Sánchez, J.A.: Fast stochastic context-free parsing: A stochastic version of the Valiant algorithm. Pattern Recognition and Image Analysis, 80-88 (2007)
7. Bérard, S., Nicolas, F., Buard, J., Gascuel, O., Rivals, E.: A fast and specific alignment method for minisatellite maps. Evolutionary bioinformatics online 2, 303 (2006)
8. Bérard, S., Rivals, E.: Comparison of minisatellites. J. of Computational biology 10(3-4), 357-372 (2003)
9. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proc. 39th ACM Symposium on Theory of Computing (STOC), pp. 590-598 (2007)
10. Chappelier, J.C., Rajman, M.: A generalized CYK algorithm for parsing stochastic CFG. In: Tabulation en analyse syntaxique et déduction. Journées, pp. 133-137 (1998)
11. Jobling, M.A., Heyer, E., Dieltjes, P., de Knijff, P.: Y-chromosome-specific microsatellite mutation rates re-examined using a minisatellite, MSY1. Human Molecular Genetics 8(11), 2117-2120 (1999)
12. Kasami, T.: An efficient recognition and syntax-analysis algorithm for context-free languages. Defense Technical Information Center (1965)
13. Valiant, L.G.: General context-free recognition in less than cubic time. J. of Computer and System Sciences 10(2), 308-314 (1975)
14. Williams, R.: Matrix-vector multiplication in sub-quadratic time(some preprocessing required). In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 995-1001 (2007)
15. Zakov, S., Tsur, D., Ziv-Ukelson, M.: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. In: Algorithms in Bioinformatics, pp. 65-77 (2010)