An O(n log n)-time algorithm for the restriction scaffold assignment problem

Journal of Computational Biology

Volumn 13, Issue 4, 2006, Pages 979-989

  Colannino, Justin ^a   Damian, Mirela ^b   Hurtado, Ferran ^c   Iacono, John ^d   Meijer, Henk ^e   Ramaswami, Suneeta ^f   Toussaint, Godfried ^a  

^a MCGILL UNIVERSITY   (Canada)

^b VILLANOVA UNIVERSITY   (United States)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d POLYTECHNIC UNIVERSITY   (United States)

^e QUEEN S UNIVERSITY   (Canada)

^f RUTGERS UNIVERSITY   (United States)

Author keywords

Algorithm; Assignment; Linear; Matching; Minimum cost; Restricted scaffold

Indexed keywords

ALGORITHM; ARTICLE; COST; LINEAR SYSTEM; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MEASUREMENT; PRIORITY JOURNAL; PROBLEM SOLVING; RESTRICTION SCAFFOLD ASSIGNMENT PROBLEM; TIME;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATA INTERPRETATION, STATISTICAL; LINEAR MODELS;

EID: 33745323054     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.979     Document Type: Article

References (18)

1. Aggarwal, A., Bar-Noy, A., Khuller, S., Kravets, D., and Schieber, B. 1995. Efficient minimum cost matching and transportation using the quadrangle inequality. J. Algorithms 19(1), 116-143.
2. Avis, D. 1983. A survey of heuristics for the weighted matching problem. Networks 13, 475-493.
3. Ben-Dor, A., Karp, R.M., Schwikowski, B., and Shamir, R. 2003. The restriction scaffold problem. J. Comp. Biol. 10(2), 385-398.
4. Buss, S.R., and Yianilos, P.N. 1998. Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours. SIAM J. Computing 27(1), 170-201.
5. Colannino, J., and Toussaint, G. 2005. An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Proc. Lett. 95(4), 466-471.
6. Díaz-Bañez, M., Farigu, G., Gómez, F., Rappaport, D., and Toussaint, G.T. 2004. El compás flamenco: A phylogenetic analysis. Proc. of BRIDGES: Math. Connections in Art, Music and Science, Southwestern College, Winfield, Kansas.
7. Edmonds, J., and Karp, R.M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. for Computing Machinery 19, 248-264.
8. Eiter, T., and Mannila, H. 1997. Distance measures for point sets and their computation. Acta Informatica 34(2), 109-133.
9. Fredman, M.L., and Tarjan, R.E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Computing Machinery 34, 596-615.
10. Galil, Z. 1986. Efficient algorithms for finding maximum matchings in graphs. ACM Computing Surveys 18, 23-38.
11. Karp, R.M., and Li, S.-Y.R. 1975. Two special cases of the assignment problem. Disc. Math. 13(46), 129-142.
12. Keijsper, J., and Pendavingh, R. 1998. An efficient algorithm for minimum-weight bibranching. J. Comb. Theory 73(Series B), 130-145.
13. Kuhn, H.W. 1955. The Hungarian method for the assignment problem. Naval Res. Logistics 2, 83-97.
14. Schrijver, A. 1982. Min-max relations for directed graphs. Annals Disc. Math. 16, 261-280.
15. Tomizawa, N. 1972. On some techniques useful for the solution of transportation network problems. Networks 1, 173-194.
16. Toussaint, G.T. 2003. Classification and phylogenetic analysis of African ternary rhythm timelines. Proc. of BRIDGES: Math. Connections in Art, Music and Science, 25-36.
17. Toussaint, G.T. 2004. A comparison of rhythmic similarity measures. Proc. 5th Int. Conf. on Music Information Retrieval, 242-245.
18. Werman, M., Peleg, S., Melter, R., and Kong, T. 1986. Bipartite graph matching for points on a line or a circle. J. Algorithms 7, 277-284.