Chaining multiple-alignment fragments in sub-quadratic time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 38-47

  Myers, Gene ^a   Miller, Webb ^b  

^a UNIVERSITY OF ARIZONA   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY;

DIRECTED ACYCLIC GRAPH (DAG); MULTIPLE ALIGNMENT; MULTIPLE SEQUENCE ALIGNMENT ALGORITHM; PATH PROBLEMS; PENALTY FUNCTION; PROBLEM INSTANCES; QUADRATIC TIME; SPARSE DYNAMIC PROGRAMMING;

DYNAMIC PROGRAMMING;

EID: 84967416712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Bentley and H. Maurer, Efficient worst-case data structures for range searching, Acta Informatica, 13 (1980), pp. 155-168.
2. K.-M. Chao and W. Miller, Linear-space algorithms that build local alignments from fragments, to appear in Algorithmica.
3. K.-M. Chao, J. Zhang, J. Ostell and W. Miller, A local alignment tool for very long DNA sequences, to appear in CABIOS.
4. D. Eppstein, Z. Galil, Ft. Giancarlo and G. F. Italiano, Sparse dynamic programming. I: linear cost functions; II: convex and concave cost functions, J. Assoc. Comput. Mach., 39 (1992), pp. 519-567.
5. D. B. Johnson, A priority queue in which initialization and queue operations take O(loglogD) time, Math. Syst. Theory, 15 (1982), pp. 295-309.
6. G. Lueker, A data structure for orthogonal range queries, Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science (1978), pp. 28-34.
7. W. Miller, M. Boguski, B. Raghavachari, Z. Zheng and R. C. Hardison, Constructing aligned sequence blocks, Journal of Computational Biology, 1 (1994), pp. 51-64.
8. E. Myers and X. Huang, An 0(N2 logN) restriction map comparison and search algorithm, Bull. Math. Biol., 54 (1992), pp. 599-618.
9. F. Preparata and M. Shamos, Computational Geometry, Springer-Verlag, New York, 1988.
10. G. Schuler, S. Altschul and D. Lipman, A workbench for multiple alignment construction and analysis, Proteins: Structure, Function and Genetics, 9 (1991), pp. 180-190.
11. E. Sobel and H. Martinez, A multiple alignment program, Nucl. Acids Res., 14 (1986), pp. 363-374.
12. D. E. Willard, Predicate-oriented database search algorithms, Ph. D. Thesis, Harvard University, and Aiken Computation Laboratory Report TR-20-78, 1978.
13. W. Wilbur and D. Lipman, Rapid similarity searches of nucleic acid and protein data banks, Proc. Nat. Acad. Sci. USA, 80 (1983), pp. 726-730.
14. Z. Zhang, B. Raghavachari, R. Hardison and W. Miller, Chaining multiple-alignment blocks, Journal of Computational Biology, 1 (1994), pp. 217-226.