Author:
Mohamad Mustafa,Rappaport David,Toussaint Godfried
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Ben-Dor, A., Karp, R.M., Schwikowski, B., Shamir, R.: The restriction scaffold problem. J. Comput. Biol. 10(2), 385–398 (2003)
2. Buss, S.R., Yianilos, P.N.: A bipartite matching approach to approximate string comparison and search. Technical Report, NEC Research Institute (1995)
3. Colannino, J., Damian, M., Hurtado, F., Iacono, J., Meijer, H., Ramaswami, S., Toussaint, G.: An O $$(n \log n)$$ ( n log n ) time algorithm for the restriction scaffold assignment problem. J. Comput. Biol. 13(4), 979–989 (2006)
4. Colannino, J., Damian, M., Hurtado, F., Langerman, S., Meijer, H., Ramaswami, S., Souvaine, D., Toussaint, G.: Efficient many-to-many point matching in one dimension. Graphs Comb. 23, 169–178 (2007)
5. Demirci, M.F., Shokoufandeh, A., Keselman, Y., Bretzner, L., Dickinson, S.: Object recognition as many-to-many feature matching. Int. J. Comput. Vis. 69(2), 203–222 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献