Next Article in Journal
Radio Frequency Interference Detection and Mitigation Algorithms Based on Spectrogram Analysis
Next Article in Special Issue
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing
Previous Article in Journal
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
Algorithms 2011, 4(4), 223-238; doi:10.3390/a4040223

Notes on Article Versions

NoteDate
article html file updated23 January 2013 00:26 CET
article html file updated26 January 2013 05:43 CET
article html file updated29 January 2013 00:14 CET
article html file updated6 February 2013 02:55 CET
article html file updated6 February 2013 23:08 CET
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
{"cc_re__cc_re__cc_by_3_0": ["NA Secondary Structure Prediction\">\n\n            <meta name=\"dc.creator\" content=\"Frank Weinberg\">\n            <meta name=\"dc.creator\" content=\"Markus E. Nebel\">\n    \n    <meta name=\"dc.type\" content=\"Article\">\n    <meta name=\"dc.source\" content=\"Algorithms 2011, Vol. 4, Pages 223-238\">\n    <meta name=\"dc.date\" content=\"2011-10-21\">\n            <meta name =\"dc.identifier\" content=\"10.3390/a4040223\">\n    \n    <meta name=\"dc.publisher\" content=\"Molecular Diversity Preservation International\">\n    <meta name=\"dc.rights\" content=\"http://creativecommons.org/licenses/by/3.0/\">\n    <meta name=\"dc.format\" content=\"application/pdf\" >\n    <meta name=\"dc.language\" content=\"en\" >\n\t<meta name=\"dc.description\" content=\"In order to be able to capture effects from co-transcriptional folding, we extend stochastic context-free grammars such that the probability of applying a rule can depend on the length of the subword that is eventually generated from the symbols introduced by the rule, and we show that existing algorithms for training and for determining the most probable pars"], "copyright__copyright__copyright": ["ms in Asynchronous Data Stream over a Sliding Window\nAlgorithms 2011, 4(4), 223-238; doi:10.3390/a4040223\n\nNotes on Article Versions\n\nNoteDate\narticle html file updated23 January 2013 00:26 CET\narticle html file updated26 January 2013 05:43 CET\narticle html file updated29 January 2013 00:14 CET\narticle html file updated6 February 2013 02:55 CET\narticle html file updated6 February 2013 23:08 CET\nAlgorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert"]}