Multiple sequence alignment based on set covers
| dc.creator | Porto, A. H. L. | |
| dc.creator | Barbosa, V. C. | |
| dc.date | 2004-12-10 | |
| dc.date.accessioned | 2026-07-07T07:46:43Z | |
| dc.date.available | 2026-07-07T07:46:43Z | |
| dc.description | We introduce a new heuristic for the multiple alignment of a set of sequences. The heuristic is based on a set cover of the residue alphabet of the sequences, and also on the determination of a significant set of blocks comprising subsequences of the sequences to be aligned. These blocks are obtained with the aid of a new data structure, called a suffix-set tree, which is constructed from the input sequences with the guidance of the residue-alphabet set cover and generalizes the well-known suffix tree of the sequence set. We provide performance results on selected BAliBASE amino-acid sequences and compare them with those yielded by some prominent approaches. | |
| dc.identifier | https://arxiv.org/abs/q-bio/0412021 | |
| dc.identifier | http://arxiv.org/abs/q-bio/0412021 | |
| dc.identifier | Lecture Notes in Computer Science 3907 (2006), 127-137 | |
| dc.identifier | doi:10.1007/11732242_12 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/123921 | |
| dc.subject | Quantitative Methods | |
| dc.title | Multiple sequence alignment based on set covers | |
| dc.type | text |