Memory-Efficient A* Heuristics for Multiple Sequence Alignment

Memory-Efficient A* Heuristics for Multiple Sequence Alignment (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Matthew McNaughton , Paul Lu , Jonathan Schaeffer , Duane Szafron

Venue:	IN PROCEEDINGS OF THE 18TH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02
Citations:	14 - 1 self

BibTeX

@INPROCEEDINGS{McNaughton02memory-efficienta*,
    author = {Matthew McNaughton and Paul Lu and Jonathan Schaeffer and Duane Szafron},
    title = {Memory-Efficient A* Heuristics for Multiple Sequence Alignment},
    booktitle = {IN PROCEEDINGS OF THE 18TH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02},
    year = {2002},
    pages = {737--743},
    publisher = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

The time and space needs of an A* search are strongly influenced by the quality of the heuristic evaluation function. Usually there is a

Citations

996	A general method applicable to the search for similarities in the amino acid sequence of two proteins - Needleman, Wunsch - 1970
960	T: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res - Thompson, Higgins, et al. - 1994
253	A model of evolutionary change in proteins - Dayhoff, Schwartz, et al. - 1978
216	A Linear Space Algorithm for Computing Maximal Common Subexpressions[J - Hirschberg
127	D: The multiple sequence alignment problem in biology - Carillo, Lipman - 1988
101	BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs - Thompson, Plewniak, et al. - 1999
92	Pattern databases - Culberson, Schaeffer - 1998
57	Hierarchical A*: Searching abstraction hierarchies efficiently - Holte, Perez, et al. - 1996
48	Gap costs for multiple sequence alignment - Altschul - 1989
41	Divide-and-conquer frontier search applied to optimal sequence alignment. InProceedingsof AAAI-2000 - Korf, Zhang - 2000
24	Divide-and-conquer bidirectional search: first results - Korf - 1999
20	M.: Complexity analysis of admissible heuristic search - Korf, Reid - 1998
19	Recent developments in linearspace alignment methods: a survey - Chao, Hardison, et al. - 1994
15	The practical use of the A* algorithm for exact multiple sequence alignment - LERMEN, REINERT - 2000
14	An iterative methods for faster sum-of-pairs multiple sequence alignment - Reinert, Stoye, et al. - 2000
12	Recent progress in the design and analysis of admissible heuristic functions - Korf
11	Speeding up dynamic programming algorithms for finding optimal lattice paths - SPOUGE - 1989
10	Sokoban: enhancing single-agent search using domain knowledge - Junghanns, Schaeffer
1	A selection of potassium channel protein sequences. http://www.cs.ualberta.ca/ bioinfo/sequences/pchannel - Gallin - 2001