Jonas S Almeida
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jonas S Almeida has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Susana Vinga
INESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
2 shared publications - Alexandra M. Carvalho
Instituto de Telecomunicações, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
1 shared publication - Alexandre P. Francisco
INESC-ID, Lisbon, Portugal
1 shared publication - Helena Futscher Deus
Digital Enterprise Research Institute (DERI), National University of Ireland, Galway, Ireland
1 shared publication - Luís Manuel Silveira Russo
INESC-ID, Lisbon, Portugal
1 shared publication - Wolfgang Maass
Saarland University Saarbrücken Germany
1 shared publication
Latest Publications
- Open Access
- 2 May 2012
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 7 (1) , 10
Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2 -L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations.
- 2 May 2012
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 7 (1) , 10
Open AccessPattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2 -L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations.
- Open Access
- 20 July 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , 387
S3DB core: a framework for RDF generation and management in bioinformatics infrastructures
Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined research initiatives, substantial issues of data heterogeneity, source distribution, and privacy currently stand in the way towards the personalization of Medicine.
- 20 July 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , 387
Open AccessS3DB core: a framework for RDF generation and management in bioinformatics infrastructures
Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined research initiatives, substantial issues of data heterogeneity, source distribution, and privacy currently stand in the way towards the personalization of Medicine.
- Open Access
- 31 March 2009
- Published by Springer Nature in BMC Bioinformatics
- Vol. 10 (1) , 100
Biological sequences as pictures – a generic two dimensional solution for iterated maps
Representing symbolic sequences graphically using iterated maps has enjoyed an enduring popularity since it was first proposed in Jeffrey 1990 as chaos game representation (CGR). The usefulness of this representation goes beyond the convenience of a scale independent representation, it provides a variable memory length representation of transition. This includes the representation of succession with non-integer order, which comes with the promise of generalizing Markovian formalisms. The original proposal targeted genomic sequences only but since then several generalizations have been proposed, many specifically designed to handle protein data.
- 31 March 2009
- Published by Springer Nature in BMC Bioinformatics
- Vol. 10 (1) , 100
Open AccessBiological sequences as pictures – a generic two dimensional solution for iterated maps
Representing symbolic sequences graphically using iterated maps has enjoyed an enduring popularity since it was first proposed in Jeffrey 1990 as chaos game representation (CGR). The usefulness of this representation goes beyond the convenience of a scale independent representation, it provides a variable memory length representation of transition. This includes the representation of succession with non-integer order, which comes with the promise of generalizing Markovian formalisms. The original proposal targeted genomic sequences only but since then several generalizations have been proposed, many specifically designed to handle protein data.