--- _id: '3215' abstract: - lang: eng text: 'Most cryptographic primitives such as encryption, authentication or secret sharing require randomness. Usually one assumes that perfect randomness is available, but those primitives might also be realized under weaker assumptions. In this work we continue the study of building secure cryptographic primitives from imperfect random sources initiated by Dodis and Spencer (FOCS’02). Their main result shows that there exists a (high-entropy) source of randomness allowing for perfect encryption of a bit, and yet from which one cannot extract even a single weakly random bit, separating encryption from extraction. Our main result separates encryption from 2-out-2 secret sharing (both in the information-theoretic and in the computational settings): any source which can be used to achieve one-bit encryption also can be used for 2-out-2 secret sharing of one bit, but the converse is false, even for high-entropy sources. Therefore, possibility of extraction strictly implies encryption, which in turn strictly implies 2-out-2 secret sharing.' acknowledgement: Supported in part by NSF career award CCR-0133806 and NSF grant CCR-0311095. Supported by the Swiss National Science Foundation, project No. 200020-103847/1. alternative_title: - LNCS author: - first_name: Yevgeniy full_name: Dodis, Yevgeniy last_name: Dodis - first_name: Krzysztof Z full_name: Krzysztof Pietrzak id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Bartosz full_name: Przydatek, Bartosz last_name: Przydatek citation: ama: 'Dodis Y, Pietrzak KZ, Przydatek B. Separating sources for encryption and secret sharing. In: Vol 3876. Springer; 2006:601-616. doi:10.1007/11681878_31' apa: 'Dodis, Y., Pietrzak, K. Z., & Przydatek, B. (2006). Separating sources for encryption and secret sharing (Vol. 3876, pp. 601–616). Presented at the TCC: Theory of Cryptography Conference, Springer. https://doi.org/10.1007/11681878_31' chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Bartosz Przydatek. “Separating Sources for Encryption and Secret Sharing,” 3876:601–16. Springer, 2006. https://doi.org/10.1007/11681878_31. ieee: 'Y. Dodis, K. Z. Pietrzak, and B. Przydatek, “Separating sources for encryption and secret sharing,” presented at the TCC: Theory of Cryptography Conference, 2006, vol. 3876, pp. 601–616.' ista: 'Dodis Y, Pietrzak KZ, Przydatek B. 2006. Separating sources for encryption and secret sharing. TCC: Theory of Cryptography Conference, LNCS, vol. 3876, 601–616.' mla: Dodis, Yevgeniy, et al. Separating Sources for Encryption and Secret Sharing. Vol. 3876, Springer, 2006, pp. 601–16, doi:10.1007/11681878_31. short: Y. Dodis, K.Z. Pietrzak, B. Przydatek, in:, Springer, 2006, pp. 601–616. conference: name: 'TCC: Theory of Cryptography Conference' date_created: 2018-12-11T12:02:04Z date_published: 2006-04-11T00:00:00Z date_updated: 2021-01-12T07:41:51Z day: '11' doi: 10.1007/11681878_31 extern: 1 intvolume: ' 3876' month: '04' page: 601 - 616 publication_status: published publisher: Springer publist_id: '3466' quality_controlled: 0 status: public title: Separating sources for encryption and secret sharing type: conference volume: 3876 year: '2006' ... --- _id: '3217' abstract: - lang: eng text: |- To prove that a secure key-agreement protocol exists one must at least show P ≠NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom functions is secure against at least two adaptive queries must falsify the decisional Diffie-Hellman assumption, a standard assumption from public-key cryptography. Hence proving any of this two seemingly unrelated statements would require a significant breakthrough. We show that at least one of the two statements is true. To our knowledge this gives the first positive cryptographic result (namely that composition implies some weak adaptive security) which holds in Minicrypt, but not in Cryptomania, i.e. under the assumption that one-way functions exist, but public-key cryptography does not. acknowledgement: Author was supported during the writing of this work by the Swiss National Science Foundation, project No. 200020-103847/1. Part of this work is supported by the Commission of the European Communities through the IST program under contract IST-2002-507932 alternative_title: - LNCS author: - first_name: Krzysztof Z full_name: Krzysztof Pietrzak id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Composition implies adaptive security in minicrypt. In: Vol 4004. Springer; 2006:328-338. doi:10.1007/11761679_20' apa: 'Pietrzak, K. Z. (2006). Composition implies adaptive security in minicrypt (Vol. 4004, pp. 328–338). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. https://doi.org/10.1007/11761679_20' chicago: Pietrzak, Krzysztof Z. “Composition Implies Adaptive Security in Minicrypt,” 4004:328–38. Springer, 2006. https://doi.org/10.1007/11761679_20. ieee: 'K. Z. Pietrzak, “Composition implies adaptive security in minicrypt,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2006, vol. 4004, pp. 328–338.' ista: 'Pietrzak KZ. 2006. Composition implies adaptive security in minicrypt. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4004, 328–338.' mla: Pietrzak, Krzysztof Z. Composition Implies Adaptive Security in Minicrypt. Vol. 4004, Springer, 2006, pp. 328–38, doi:10.1007/11761679_20. short: K.Z. Pietrzak, in:, Springer, 2006, pp. 328–338. conference: name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques' date_created: 2018-12-11T12:02:04Z date_published: 2006-07-11T00:00:00Z date_updated: 2021-01-12T07:41:52Z day: '11' doi: 10.1007/11761679_20 extern: 1 intvolume: ' 4004' month: '07' page: 328 - 338 publication_status: published publisher: Springer publist_id: '3464' quality_controlled: 0 status: public title: Composition implies adaptive security in minicrypt type: conference volume: 4004 year: '2006' ... --- _id: '3216' abstract: - lang: eng text: |- We prove a new upper bound on the advantage of any adversary for distinguishing the encrypted CBC-MAC (EMAC) based on random permutations from a random function. Our proof uses techniques recently introduced in [BPR05], which again were inspired by [DGH + 04]. The bound we prove is tight — in the sense that it matches the advantage of known attacks up to a constant factor — for a wide range of the parameters: let n denote the block-size, q the number of queries the adversary is allowed to make and ℓ an upper bound on the length (i.e. number of blocks) of the messages, then for ℓ ≤ 2 n/8 and q≥ł2 the advantage is in the order of q 2/2 n (and in particular independent of ℓ). This improves on the previous bound of q 2ℓΘ(1/ln ln ℓ)/2 n from [BPR05] and matches the trivial attack (which thus is basically optimal) where one simply asks random queries until a collision is found. acknowledgement: Part of this work is supported by the Commission of the European Communities through the IST program under contract IST-2002-507932 ECRYPT. alternative_title: - LNCS author: - first_name: Krzysztof Z full_name: Krzysztof Pietrzak id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. A tight bound for EMAC. In: Vol 4052. Springer; 2006:168-179. doi:10.1007/11787006_15' apa: 'Pietrzak, K. Z. (2006). A tight bound for EMAC (Vol. 4052, pp. 168–179). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/11787006_15' chicago: Pietrzak, Krzysztof Z. “A Tight Bound for EMAC,” 4052:168–79. Springer, 2006. https://doi.org/10.1007/11787006_15. ieee: 'K. Z. Pietrzak, “A tight bound for EMAC,” presented at the ICALP: Automata, Languages and Programming, 2006, vol. 4052, pp. 168–179.' ista: 'Pietrzak KZ. 2006. A tight bound for EMAC. ICALP: Automata, Languages and Programming, LNCS, vol. 4052, 168–179.' mla: Pietrzak, Krzysztof Z. A Tight Bound for EMAC. Vol. 4052, Springer, 2006, pp. 168–79, doi:10.1007/11787006_15. short: K.Z. Pietrzak, in:, Springer, 2006, pp. 168–179. conference: name: 'ICALP: Automata, Languages and Programming' date_created: 2018-12-11T12:02:04Z date_published: 2006-07-28T00:00:00Z date_updated: 2021-01-12T07:41:52Z day: '28' doi: 10.1007/11787006_15 extern: 1 intvolume: ' 4052' month: '07' page: 168 - 179 publication_status: published publisher: Springer publist_id: '3463' quality_controlled: 0 status: public title: A tight bound for EMAC type: conference volume: 4052 year: '2006' ... --- _id: '3522' abstract: - lang: eng text: We observed sharp wave/ripples (SWR) during exploration within brief (< 2.4 s) interruptions of or during theta oscillations. CA1 network responses of SWRs occurring during exploration (eSWR) and SWRs detected in waking immobility or sleep were similar. However, neuronal activity during eSWR was location dependent, and eSWR-related firing was stronger inside the place field than outside. The eSPW-related firing increase was stronger than the baseline increase inside compared to outside, suggesting a “supralinear” summation of eSWR and place-selective inputs. Pairs of cells with similar place fields and/or correlated firing during exploration showed stronger coactivation during eSWRs and subsequent sleep-SWRs. Sequential activation of place cells was not required for the reactivation of waking co-firing patterns; cell pairs with symmetrical cross-correlations still showed reactivated waking co-firing patterns during sleep-SWRs. We suggest that place-selective firing during eSWRs facilitates initial associations between cells with similar place fields that enable place-related ensemble patterns to recur during subsequent sleep-SWRs. author: - first_name: Joseph full_name: Joseph O'Neill id: 426376DC-F248-11E8-B48F-1D18A9856A87 last_name: O'Neill - first_name: Timothy full_name: Senior,Timothy last_name: Senior - first_name: Jozsef L full_name: Jozsef Csicsvari id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 citation: ama: O’Neill J, Senior T, Csicsvari JL. Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior. Neuron. 2006;49(1):143-155. doi:10.1016/j.neuron.2005.10.037 apa: O’Neill, J., Senior, T., & Csicsvari, J. L. (2006). Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2005.10.037 chicago: O’Neill, Joseph, Timothy Senior, and Jozsef L Csicsvari. “Place-Selective Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory Behavior.” Neuron. Elsevier, 2006. https://doi.org/10.1016/j.neuron.2005.10.037. ieee: J. O’Neill, T. Senior, and J. L. Csicsvari, “Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior,” Neuron, vol. 49, no. 1. Elsevier, pp. 143–155, 2006. ista: O’Neill J, Senior T, Csicsvari JL. 2006. Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior. Neuron. 49(1), 143–155. mla: O’Neill, Joseph, et al. “Place-Selective Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory Behavior.” Neuron, vol. 49, no. 1, Elsevier, 2006, pp. 143–55, doi:10.1016/j.neuron.2005.10.037. short: J. O’Neill, T. Senior, J.L. Csicsvari, Neuron 49 (2006) 143–155. date_created: 2018-12-11T12:03:46Z date_published: 2006-01-05T00:00:00Z date_updated: 2021-01-12T07:44:03Z day: '05' doi: 10.1016/j.neuron.2005.10.037 extern: 1 intvolume: ' 49' issue: '1' month: '01' page: 143 - 155 publication: Neuron publication_status: published publisher: Elsevier publist_id: '2863' quality_controlled: 0 status: public title: Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior type: journal_article volume: 49 year: '2006' ... --- _id: '3607' abstract: - lang: eng text: We apply new analytical methods to understand the consequences of population bottlenecks for expected additive genetic variance. We analyze essentially all models for multilocus epistasis that have been numerically simulated to demonstrate increased additive variance. We conclude that for biologically plausible models, large increases in expected additive variance–attributable to epistasis rather than dominance–are unlikely. Naciri-Graven and Goudet (2003) found that as the number of epistatically interacting loci increases, additive variance tends to be inflated more after a bottleneck. We argue that this result reflects biologically unrealistic aspects of their models. Specifically, as the number of loci increases, higher-order epistatic interactions become increasingly important in these models, with an increasing fraction of the genetic variance becoming nonadditive, contrary to empirical observations. As shown by Barton and Turelli (2004), without dominance, conversion of nonadditive to additive variance depends only on the variance components and not on the number of loci per se. Numerical results indicating that more inbreeding is needed to produce maximal release of additive variance with more loci follow directly from our analytical results, which show that high levels of inbreeding (F > 0.5) are needed for significant conversion of higher-order components. We discuss alternative approaches to modeling multilocus epistasis and understanding its consequences. author: - first_name: Michael full_name: Turelli, Michael last_name: Turelli - first_name: Nicholas H full_name: Nicholas Barton id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Turelli M, Barton NH. Will population bottlenecks and multilocus epistasis increase additive genetic variance? Evolution; International Journal of Organic Evolution. 2006;60(9):1763-1776. doi:10.1111/j.0014-3820.2006.tb00521.x apa: Turelli, M., & Barton, N. H. (2006). Will population bottlenecks and multilocus epistasis increase additive genetic variance? Evolution; International Journal of Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.0014-3820.2006.tb00521.x chicago: Turelli, Michael, and Nicholas H Barton. “Will Population Bottlenecks and Multilocus Epistasis Increase Additive Genetic Variance?” Evolution; International Journal of Organic Evolution. Wiley-Blackwell, 2006. https://doi.org/10.1111/j.0014-3820.2006.tb00521.x. ieee: M. Turelli and N. H. Barton, “Will population bottlenecks and multilocus epistasis increase additive genetic variance?,” Evolution; International Journal of Organic Evolution, vol. 60, no. 9. Wiley-Blackwell, pp. 1763–1776, 2006. ista: Turelli M, Barton NH. 2006. Will population bottlenecks and multilocus epistasis increase additive genetic variance? Evolution; International Journal of Organic Evolution. 60(9), 1763–1776. mla: Turelli, Michael, and Nicholas H. Barton. “Will Population Bottlenecks and Multilocus Epistasis Increase Additive Genetic Variance?” Evolution; International Journal of Organic Evolution, vol. 60, no. 9, Wiley-Blackwell, 2006, pp. 1763–76, doi:10.1111/j.0014-3820.2006.tb00521.x. short: M. Turelli, N.H. Barton, Evolution; International Journal of Organic Evolution 60 (2006) 1763–1776. date_created: 2018-12-11T12:04:13Z date_published: 2006-09-01T00:00:00Z date_updated: 2021-01-12T07:44:37Z day: '01' doi: 10.1111/j.0014-3820.2006.tb00521.x extern: 1 intvolume: ' 60' issue: '9' month: '09' page: 1763 - 1776 publication: Evolution; International Journal of Organic Evolution publication_status: published publisher: Wiley-Blackwell publist_id: '2776' quality_controlled: 0 status: public title: Will population bottlenecks and multilocus epistasis increase additive genetic variance? type: journal_article volume: 60 year: '2006' ... --- _id: '3683' abstract: - lang: eng text: Many algorithms to remove distortion from document images have be proposed in recent years, but so far there is no reliable method for comparing their performance. In this paper we propose a collection of methods to measure the quality of such restoration algorithms for document image which show a non-linear distortion due to perspective or page curl. For the result from these measurement to be meaningful, a common data set of ground truth is required. We therefore started with the buildup of a document image database that is meant to serve as a common data basis for all kinds of restoration from images of 3D-shaped document. The long term goal would be to establish this database and following extensions in the area of document image dewarping as an as fruitful and indispensable tool as e.g. the NIST database is for OCR, or the Caltech database is for object and face recognition. author: - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Thomas full_name: Breuel,Thomas M last_name: Breuel citation: ama: 'Lampert C, Breuel T. Objective quality measurement for geometric document image restoration. In: Springer; 2006.' apa: 'Lampert, C., & Breuel, T. (2006). Objective quality measurement for geometric document image restoration. Presented at the DAS: Document Analysis Systems, Springer.' chicago: Lampert, Christoph, and Thomas Breuel. “Objective Quality Measurement for Geometric Document Image Restoration.” Springer, 2006. ieee: 'C. Lampert and T. Breuel, “Objective quality measurement for geometric document image restoration,” presented at the DAS: Document Analysis Systems, 2006.' ista: 'Lampert C, Breuel T. 2006. Objective quality measurement for geometric document image restoration. DAS: Document Analysis Systems.' mla: Lampert, Christoph, and Thomas Breuel. Objective Quality Measurement for Geometric Document Image Restoration. Springer, 2006. short: C. Lampert, T. Breuel, in:, Springer, 2006. conference: name: 'DAS: Document Analysis Systems' date_created: 2018-12-11T12:04:36Z date_published: 2006-03-16T00:00:00Z date_updated: 2021-01-12T07:45:07Z day: '16' extern: 1 main_file_link: - open_access: '0' url: http://pub.ist.ac.at/~chl/papers/lampert-das2006.pdf month: '03' publication_status: published publisher: Springer publist_id: '2692' quality_controlled: 0 status: public title: Objective quality measurement for geometric document image restoration type: conference year: '2006' ... --- _id: '3685' abstract: - lang: eng text: 'Video compression currently is dominated by engineering and fine-tuned heuristic methods. In this paper, we propose to instead apply the well-developed machinery of machine learning in order to support the optimization of existing video encoders and the creation of new ones. Exemplarily, we show how by machine learning we can improve one encoding step that is crucial for the performance of all current video standards: macroblock mode decision. By formulating the problem in a Bayesian setup, we show that macroblock mode decision can be reduced to a classification problem with a cost function for misclassification that is sample dependent. We demonstrate how to apply different machine learning techniques to obtain suitable classifiers and we show in detailed experiments that all of these perform better than the state-of-the-art heuristic method' author: - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Lampert C. Machine learning for video compression: Macroblock mode decision. In: IEEE; 2006:936-940. doi:10.1109/ICPR.2006.778' apa: 'Lampert, C. (2006). Machine learning for video compression: Macroblock mode decision (pp. 936–940). Presented at the ICPR: International Conference on Pattern Recognition, IEEE. https://doi.org/10.1109/ICPR.2006.778' chicago: 'Lampert, Christoph. “Machine Learning for Video Compression: Macroblock Mode Decision,” 936–40. IEEE, 2006. https://doi.org/10.1109/ICPR.2006.778.' ieee: 'C. Lampert, “Machine learning for video compression: Macroblock mode decision,” presented at the ICPR: International Conference on Pattern Recognition, 2006, pp. 936–940.' ista: 'Lampert C. 2006. Machine learning for video compression: Macroblock mode decision. ICPR: International Conference on Pattern Recognition, 936–940.' mla: 'Lampert, Christoph. Machine Learning for Video Compression: Macroblock Mode Decision. IEEE, 2006, pp. 936–40, doi:10.1109/ICPR.2006.778.' short: C. Lampert, in:, IEEE, 2006, pp. 936–940. conference: name: 'ICPR: International Conference on Pattern Recognition' date_created: 2018-12-11T12:04:37Z date_published: 2006-09-18T00:00:00Z date_updated: 2021-01-12T07:45:08Z day: '18' doi: 10.1109/ICPR.2006.778 extern: 1 month: '09' page: 936 - 940 publication_status: published publisher: IEEE publist_id: '2689' quality_controlled: 0 status: public title: 'Machine learning for video compression: Macroblock mode decision' type: conference year: '2006' ... --- _id: '3750' abstract: - lang: eng text: We applied a single-cell assay to characterize how transcription dynamics affects protein expression levels of a tetracycline-inducible gene expression system. Transcriptional activity of the tetracycline promoter in response to a steady level of inducer is steady in ΔacrAB efflux mutant but pulsating in wildtype Escherichia coli cells. We found that the expression level of the green fluorescent protein is several folds higher in ΔacrAB efflux mutant than in wildtype cells. author: - first_name: Thuc full_name: Le,Thuc T. last_name: Le - first_name: Calin C full_name: Calin Guet id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Philippe full_name: Cluzel,Philippe last_name: Cluzel citation: ama: Le T, Guet CC, Cluzel P. Protein expression enhancement in efflux-deleted mutant bacteria. Protein Expression and Purification. 2006;48(1):28-31. apa: Le, T., Guet, C. C., & Cluzel, P. (2006). Protein expression enhancement in efflux-deleted mutant bacteria. Protein Expression and Purification. Elsevier. chicago: Le, Thuc, Calin C Guet, and Philippe Cluzel. “Protein Expression Enhancement in Efflux-Deleted Mutant Bacteria.” Protein Expression and Purification. Elsevier, 2006. ieee: T. Le, C. C. Guet, and P. Cluzel, “Protein expression enhancement in efflux-deleted mutant bacteria,” Protein Expression and Purification, vol. 48, no. 1. Elsevier, pp. 28–31, 2006. ista: Le T, Guet CC, Cluzel P. 2006. Protein expression enhancement in efflux-deleted mutant bacteria. Protein Expression and Purification. 48(1), 28–31. mla: Le, Thuc, et al. “Protein Expression Enhancement in Efflux-Deleted Mutant Bacteria.” Protein Expression and Purification, vol. 48, no. 1, Elsevier, 2006, pp. 28–31. short: T. Le, C.C. Guet, P. Cluzel, Protein Expression and Purification 48 (2006) 28–31. date_created: 2018-12-11T12:04:58Z date_published: 2006-07-01T00:00:00Z date_updated: 2021-01-12T07:51:56Z day: '01' extern: 1 intvolume: ' 48' issue: '1' month: '07' page: 28 - 31 publication: Protein Expression and Purification publication_status: published publisher: Elsevier publist_id: '2478' quality_controlled: 0 status: public title: Protein expression enhancement in efflux-deleted mutant bacteria type: journal_article volume: 48 year: '2006' ... --- _id: '3767' abstract: - lang: eng text: Models of RNA secondary structure folding are widely used to study evolution in theory and simulation. However, systematic studies of the parameters involved are rare. In this paper, we study by simulation how RNA evolution is influenced by three different factors, namely the mutation rate, scaling of the fitness function, and distance measure. We found that for low mutation rates the qualitative evolutionary behavior is robust with respect to the scaling of the fitness function. For efficient mutation rates, which are close to the error threshold, scaling and distance measure have a strong influence on the evolutionary behavior. A global distance measure that takes sequence information additively into account lowers the error threshold. When using a local sequence-structure alignment for the distance, we observed a smoother evolution of the fitness over time. Finally, in addition to the well known error threshold, we identify another threshold of the mutation rate, called divergence threshold, where the qualitative transient behavior changes from a localized to an exploratory search. author: - first_name: Anne full_name: Anne Kupczok id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87 last_name: Kupczok - first_name: Peter full_name: Dittrich,Peter last_name: Dittrich citation: ama: Kupczok A, Dittrich P. Determinants of simulated RNA evolution. Journal of Theoretical Biology. 2006;238(3):726-735. doi:10.1016/j.jtbi.2005.06.019 apa: Kupczok, A., & Dittrich, P. (2006). Determinants of simulated RNA evolution. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2005.06.019 chicago: Kupczok, Anne, and Peter Dittrich. “Determinants of Simulated RNA Evolution.” Journal of Theoretical Biology. Elsevier, 2006. https://doi.org/10.1016/j.jtbi.2005.06.019. ieee: A. Kupczok and P. Dittrich, “Determinants of simulated RNA evolution.,” Journal of Theoretical Biology, vol. 238, no. 3. Elsevier, pp. 726–35, 2006. ista: Kupczok A, Dittrich P. 2006. Determinants of simulated RNA evolution. Journal of Theoretical Biology. 238(3), 726–35. mla: Kupczok, Anne, and Peter Dittrich. “Determinants of Simulated RNA Evolution.” Journal of Theoretical Biology, vol. 238, no. 3, Elsevier, 2006, pp. 726–35, doi:10.1016/j.jtbi.2005.06.019. short: A. Kupczok, P. Dittrich, Journal of Theoretical Biology 238 (2006) 726–35. date_created: 2018-12-11T12:05:03Z date_published: 2006-01-01T00:00:00Z date_updated: 2021-01-12T07:52:03Z day: '01' doi: 10.1016/j.jtbi.2005.06.019 extern: 1 intvolume: ' 238' issue: '3' month: '01' page: 726 - 35 publication: Journal of Theoretical Biology publication_status: published publisher: Elsevier publist_id: '2461' quality_controlled: 0 status: public title: Determinants of simulated RNA evolution. type: journal_article volume: 238 year: '2006' ... --- _id: '3813' abstract: - lang: eng text: Hyperpolarization-activated channels (Ih or HCN channels) are widely expressed in principal neurons in the central nervous system. However, Ih in inhibitory GABAergic interneurons is less well characterized. We examined the functional properties of Ih in fast-spiking basket cells (BCs) of the dentate gyrus, using hippocampal slices from 17- to 21-day-old rats. Bath application of the Ih channel blocker ZD 7288 at a concentration of 30 microm induced a hyperpolarization of 5.7 +/- 1.5 mV, an increase in input resistance and a correlated increase in apparent membrane time constant. ZD 7288 blocked a hyperpolarization-activated current in a concentration-dependent manner (IC50, 1.4 microm). The effects of ZD 7288 were mimicked by external Cs+. The reversal potential of Ih was -27.4 mV, corresponding to a Na+ to K+ permeability ratio (PNa/PK) of 0.36. The midpoint potential of the activation curve of Ih was -83.9 mV, and the activation time constant at -120 mV was 190 ms. Single-cell expression analysis using reverse transcription followed by quantitative polymerase chain reaction revealed that BCs coexpress HCN1 and HCN2 subunit mRNA, suggesting the formation of heteromeric HCN1/2 channels. ZD 7288 increased the current threshold for evoking antidromic action potentials by extracellular stimulation, consistent with the expression of Ih in BC axons. Finally, ZD 7288 decreased the frequency of miniature inhibitory postsynaptic currents (mIPSCs) in hippocampal granule cells, the main target cells of BCs, to 70 +/- 4% of the control value. In contrast, the amplitude of mIPSCs was unchanged, consistent with the presence of Ih in inhibitory terminals. In conclusion, our results suggest that Ih channels are expressed in the somatodendritic region, axon and presynaptic elements of fast-spiking BCs in the hippocampus. author: - first_name: Yexica full_name: Aponte, Yexica last_name: Aponte - first_name: Cheng full_name: Lien, Cheng-Chang last_name: Lien - first_name: Ellen full_name: Reisinger, Ellen last_name: Reisinger - first_name: Peter M full_name: Peter Jonas id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: Aponte Y, Lien C, Reisinger E, Jonas PM. Hyperpolarization-activated cation channels in fast-spiking interneurons of rat hippocampus. Journal of Physiology. 2006;574(Pt 1):229-243. doi:10.1113/jphysiol.2005.104042 apa: Aponte, Y., Lien, C., Reisinger, E., & Jonas, P. M. (2006). Hyperpolarization-activated cation channels in fast-spiking interneurons of rat hippocampus. Journal of Physiology. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.2005.104042 chicago: Aponte, Yexica, Cheng Lien, Ellen Reisinger, and Peter M Jonas. “Hyperpolarization-Activated Cation Channels in Fast-Spiking Interneurons of Rat Hippocampus.” Journal of Physiology. Wiley-Blackwell, 2006. https://doi.org/10.1113/jphysiol.2005.104042. ieee: Y. Aponte, C. Lien, E. Reisinger, and P. M. Jonas, “Hyperpolarization-activated cation channels in fast-spiking interneurons of rat hippocampus,” Journal of Physiology, vol. 574, no. Pt 1. Wiley-Blackwell, pp. 229–43, 2006. ista: Aponte Y, Lien C, Reisinger E, Jonas PM. 2006. Hyperpolarization-activated cation channels in fast-spiking interneurons of rat hippocampus. Journal of Physiology. 574(Pt 1), 229–43. mla: Aponte, Yexica, et al. “Hyperpolarization-Activated Cation Channels in Fast-Spiking Interneurons of Rat Hippocampus.” Journal of Physiology, vol. 574, no. Pt 1, Wiley-Blackwell, 2006, pp. 229–43, doi:10.1113/jphysiol.2005.104042. short: Y. Aponte, C. Lien, E. Reisinger, P.M. Jonas, Journal of Physiology 574 (2006) 229–43. date_created: 2018-12-11T12:05:19Z date_published: 2006-01-01T00:00:00Z date_updated: 2021-01-12T07:52:23Z day: '01' doi: 10.1113/jphysiol.2005.104042 extern: 1 intvolume: ' 574' issue: Pt 1 main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1817792/ month: '01' oa: 1 page: 229 - 43 publication: Journal of Physiology publication_status: published publisher: Wiley-Blackwell publist_id: '2397' quality_controlled: 0 status: public title: Hyperpolarization-activated cation channels in fast-spiking interneurons of rat hippocampus type: journal_article volume: 574 year: '2006' ...