{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T05:25:53Z","timestamp":1785561953201,"version":"3.56.0"},"reference-count":9,"publisher":"Oxford University Press (OUP)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Summary: The Sequence Alignment Benchmark (SABmark) provides sets of multiple alignment problems derived from the SCOP classification. These sets, Twilight Zone and Superfamilies, both cover the entire known fold space using sequences with very low to low, and low to intermediate similarity, respectively. In addition, each set has an alternate version in which unalignable but apparently similar sequences are added to each problem.<\/jats:p><jats:p>Availability: SABmark is available from http:\/\/bioinformatics.vub.ac.be<\/jats:p><jats:p>Contact: \u00a0ivwalle@vub.ac.be<\/jats:p>","DOI":"10.1093\/bioinformatics\/bth493","type":"journal-article","created":{"date-parts":[[2004,8,28]],"date-time":"2004-08-28T01:15:02Z","timestamp":1093655702000},"page":"1267-1268","source":"Crossref","is-referenced-by-count":177,"title":["SABmark\u2014a benchmark for sequence alignment that covers the entire known fold space"],"prefix":"10.1093","volume":"21","author":[{"given":"Ivo","family":"Van Walle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ignace","family":"Lasters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lode","family":"Wyns","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2004,8,27]]},"reference":[{"key":"2023013107283062400_B1","doi-asserted-by":"crossref","unstructured":"Altschul, S., Madden, T., Sch\u00e4ffer, A., Zhang, J., Zhang, Z., Miller, W., Lipman, D. 1997Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res.253389\u20133402","DOI":"10.1093\/nar\/25.17.3389"},{"key":"2023013107283062400_B2","doi-asserted-by":"crossref","unstructured":"Bahr, A., Thompson, J., Thierry, J., Poch, O. 2001BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations. Nucleic Acids Res.29323\u2013326","DOI":"10.1093\/nar\/29.1.323"},{"key":"2023013107283062400_B3","doi-asserted-by":"crossref","unstructured":"Boutonnet, N., Rooman, M., Ochagavia, M., Richelle, J., Wodak, S. 1995Optimal protein structure alignments by multiple linkage clustering: application to distantly related proteins. Protein Eng.8647\u2013662","DOI":"10.1093\/protein\/8.7.647"},{"key":"2023013107283062400_B4","doi-asserted-by":"crossref","unstructured":"Chandonia, J.-M., Hon, G., Walker, N.S., Conte, L.L., Koehl, P., Levitt, M., Brenner, S.E. 2004The ASTRAL Compendium in 2004. Nucleic Acids Res.32D189\u2013D192","DOI":"10.1093\/nar\/gkh034"},{"key":"2023013107283062400_B5","unstructured":"Murzin, A., Brenner, S., Hubbard, T., Chothia, C. 1995SCOP: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol.247536\u2013540"},{"key":"2023013107283062400_B6","doi-asserted-by":"crossref","unstructured":"Raghava, G.P.S., Searle, S.M.J., Audley, P.C., Barber, J.D., Barton, G.J. 2003OXBench:a benchmark for evaluation of protein multiple sequence alignment accuracy. BMC Bioinformatics447","DOI":"10.1186\/1471-2105-4-47"},{"key":"2023013107283062400_B7","doi-asserted-by":"crossref","unstructured":"Sauder, J., Arthur, J., Dunbrack, R. 2000Large-scale comparison of protein sequence alignment algorithms with structure alignments. Proteins406\u201322","DOI":"10.1002\/(SICI)1097-0134(20000701)40:1<6::AID-PROT30>3.0.CO;2-7"},{"key":"2023013107283062400_B8","doi-asserted-by":"crossref","unstructured":"Shindyalov, I. and Bourne, P. 1998Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Eng.11739\u2013747","DOI":"10.1093\/protein\/11.9.739"},{"key":"2023013107283062400_B9","doi-asserted-by":"crossref","unstructured":"Van Walle, I., Lasters, I., Wyns, L. 2004Align-m\u2014a new algorithm for multiple alignment of highly divergent sequences. Bioinformatics201428\u20131435","DOI":"10.1093\/bioinformatics\/bth116"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/7\/1267\/48966932\/bioinformatics_21_7_1267.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/7\/1267\/48966932\/bioinformatics_21_7_1267.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T12:12:12Z","timestamp":1734523932000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/7\/1267\/268759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,27]]},"references-count":9,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2005,4,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bth493","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,4,1]]},"published":{"date-parts":[[2004,8,27]]}}}