| T. Akutsu. Approximate string matching with variable length don't care characters. IEICE Trans. Inf. & Syst., E79-D(9):1353--1354, September 1996. |
....those applications in which both algorithms can be applied) We have outlined additional applications where our algorithm can be potentially useful. Other possibilities are: 10 N.F.Almeida Jr. J.C.Setubal and M.Tompa ffl Using the don t care idea in multiple sequence alignments. ffl T. Akutsu [1] studied a variant of the string matching problem in which the pattern string may contain a variable number of don t care characters, though they must be in fixed positions. We would like to adapt our algorithm to solve this problem. ....
T. Akutsu. Approximate string matching with variable length don't care characters. IEICE Trans. Inf. & Syst., E79-D(9):1353--1354, September 1996.
....4. Conclusion We have presented an O(mn log n) time algorithm for approximate string matching with variable length don t cares. It is possible to combine the presented technique with Landau Vishkin algorithm [5] in a straight forward way. However, we can only get an O( k log n)gn) time algorithm [2], which seems to be worse than the presented algorithm in most practical cases. Thus, developing much faster algorithm is left as an open problem. Acknowledgement This research was supported in part by a Grant in Aid for Scientific Research on Priority Areas, Genome Informatics , from the ....
T. Akutsu, "Approximate string matching with variable length don't cares," Research Report, AL95-43-5, pp.33--38, Information Processing Society of Japan, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC