Picking alignments from (steiner) trees

@article{Pachter2002PickingAF,
  title={Picking alignments from (steiner) trees},
  author={Lior Pachter and Fumei Lam},
  journal={Journal of computational biology : a journal of computational molecular cell biology},
  year={2002},
  volume={10 3-4},
  pages={509-20}
}
The application of Needleman-Wunsch alignment techniques to biological sequences is complicated by two serious problems when the sequences are long: the running time, which scales as the product of the lengths of sequences, and the difficulty in obtaining suitable parameters that produce meaningful alignments. The running time problem is often corrected by reducing the search space, using techniques such as banding, or chaining of high scoring pairs. The parameter problem is more difficult to… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…