Repository logo
 
Publication

SimSearch: A new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences

dc.contributor.authorDeusdado, Sérgio
dc.contributor.authorCarvalho, Paulo
dc.date.accessioned2011-05-18T16:37:32Z
dc.date.available2011-05-18T16:37:32Z
dc.date.issued2008
dc.description.abstractIn this paper, we propose SimSearch, an algorithm implementing a new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences. The initial phase of SimSearch is devoted to fulfil the binary similarity matrices by signalling the distances between occurrences of the same symbol. The scoring scheme is further applied, when analysed the maximal extension of the pattern. Employing bit parallelism to analyse the global similarity matrix’s upper triangle, the new methodology searches the sequence(s) for all the exact and approximate patterns in regular or reverse order. The algorithm accepts parameterization to work with greater seeds for near-optimal results. Performance tests show significant efficiency improvement over traditional optimal methods based on dynamic programming. Comparing the new algorithm’s efficiency against heuristic based methods, equalizing the required sensitivity, the proposed algorithm remains acceptable.por
dc.identifier.citationDeusdado, Sérgio; Carvalho, Paulo (2008). SimSearch: A new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences. In Corchado, Juan M. 2nd International Workshop on Practical Applications of Computational Biology and Bioinformatics. Berlin: Springer-Verlag. p. 206-216. ISBN 978-3-540-85860-7. (Advances in Soft Computing; 49)por
dc.identifier.isbn978-3-540-85860-7
dc.identifier.otherDOI: 10.1007/978-3-540-85861-4_25
dc.identifier.urihttp://hdl.handle.net/10198/4385
dc.language.isoengpor
dc.publisherSpringer-Verlagpor
dc.relation.publisherversionhttp://www.springerlink.com/content/t3701n3011675773/por
dc.subjectSimilarity discoverypor
dc.subjectDynamic programmingpor
dc.subjectDistance seriespor
dc.titleSimSearch: A new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequencespor
dc.typebook part
dspace.entity.typePublication
oaire.citation.conferencePlaceBerlinpor
oaire.citation.endPage216por
oaire.citation.startPage206por
oaire.citation.titleAdvances in Soft Computingpor
person.familyNameDeusdado
person.givenNameSérgio
person.identifier.ciencia-id1D14-2CBC-54F2
person.identifier.orcid0000-0003-2638-2230
person.identifier.scopus-author-id15764598600
rcaap.rightsopenAccesspor
rcaap.typebookPartpor
relation.isAuthorOfPublication1363c41f-0861-40ea-a87a-4a24d9658f03
relation.isAuthorOfPublication.latestForDiscovery1363c41f-0861-40ea-a87a-4a24d9658f03

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
2008-SimSearch_deusdado_carvalho_Salamanca.pdf
Size:
90.21 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: