[{"issue":"1","doi":"10.1016/S1369526602000031","month":"02","oa_version":"None","_id":"2990","quality_controlled":"1","date_updated":"2021-01-12T07:40:17Z","date_published":"2003-02-01T00:00:00Z","year":"2003","publist_id":"3711","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","type":"journal_article","intvolume":"         6","page":"7 - 12","publisher":"Elsevier","volume":6,"abstract":[{"text":"Plant growth is marked by its adaptability to continuous changes in environment. A regulated, differential distribution of auxin underlies many adaptation processes including organogenesis, meristem patterning and tropisms. In executing its multiple roles, auxin displays some characteristics of both a hormone and a morphogen. Studies on auxin transport, as well as tracing the intracellular movement of its molecular components, have suggested a possible scenario to explain how growth plasticity is conferred at the cellular and molecular level. The plant perceives stimuli and changes the subcellular position of auxin-transport components accordingly. These changes modulate auxin fluxes, and the newly established auxin distribution triggers the corresponding developmental response.","lang":"eng"}],"date_created":"2018-12-11T12:00:43Z","language":[{"iso":"eng"}],"extern":"1","day":"01","citation":{"apa":"Friml, J. (2003). Auxin transport - Shaping the plant. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S1369526602000031\">https://doi.org/10.1016/S1369526602000031</a>","ieee":"J. Friml, “Auxin transport - Shaping the plant,” <i>Current Opinion in Plant Biology</i>, vol. 6, no. 1. Elsevier, pp. 7–12, 2003.","chicago":"Friml, Jiří. “Auxin Transport - Shaping the Plant.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S1369526602000031\">https://doi.org/10.1016/S1369526602000031</a>.","ama":"Friml J. Auxin transport - Shaping the plant. <i>Current Opinion in Plant Biology</i>. 2003;6(1):7-12. doi:<a href=\"https://doi.org/10.1016/S1369526602000031\">10.1016/S1369526602000031</a>","ista":"Friml J. 2003. Auxin transport - Shaping the plant. Current Opinion in Plant Biology. 6(1), 7–12.","short":"J. Friml, Current Opinion in Plant Biology 6 (2003) 7–12.","mla":"Friml, Jiří. “Auxin Transport - Shaping the Plant.” <i>Current Opinion in Plant Biology</i>, vol. 6, no. 1, Elsevier, 2003, pp. 7–12, doi:<a href=\"https://doi.org/10.1016/S1369526602000031\">10.1016/S1369526602000031</a>."},"author":[{"last_name":"Friml","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"}],"publication":"Current Opinion in Plant Biology","publication_status":"published","title":"Auxin transport - Shaping the plant"},{"doi":"10.1105/tpc.008433","month":"03","issue":"3","_id":"2992","quality_controlled":0,"date_updated":"2021-01-12T07:40:18Z","status":"public","type":"journal_article","year":"2003","date_published":"2003-03-01T00:00:00Z","publist_id":"3710","publisher":"American Society of Plant Biologists","intvolume":"        15","page":"612 - 625","abstract":[{"text":"Plants have many polarized cell types, but relatively little is known about the mechanisms that establish polarity. The orc mutant was identified originally by defects in root patterning, and positional cloning revealed that the affected gene encodes STEROL METHYLTRANSFERASE1, which is required for the appropriate synthesis and composition of major membrane sterols. smt1orc mutants displayed several conspicuous cell polarity defects. Columella root cap cells revealed perturbed polar positioning of different organelles, and in the smt1orc root epidermis, polar initiation of root hairs was more randomized. Polar auxin transport and expression of the auxin reporter DR5-β-glucuronidase were aberrant in smt1orc. Patterning defects in smt1orc resembled those observed in mutants of the PIN gene family of putative auxin efflux transporters. Consistently, the membrane localization of the PIN1 and PIN3 proteins was disturbed in smt1orc, whereas polar positioning of the influx carrier AUX1 appeared normal. Our results suggest that balanced sterol composition is a major requirement for cell polarity and auxin efflux in Arabidopsis.","lang":"eng"}],"volume":15,"date_created":"2018-12-11T12:00:44Z","day":"01","extern":1,"publication_status":"published","title":"Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function","author":[{"last_name":"Willemsen","full_name":"Willemsen, Viola","first_name":"Viola"},{"last_name":"Friml","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"},{"last_name":"Grebe","full_name":"Grebe, Markus","first_name":"Markus"},{"full_name":"Van Den Toorn, Albert","last_name":"Van Den Toorn","first_name":"Albert"},{"full_name":"Palme, Klaus","last_name":"Palme","first_name":"Klaus"},{"first_name":"Ben","last_name":"Scheres","full_name":"Scheres, Ben"}],"publication":"Plant Cell","citation":{"ieee":"V. Willemsen, J. Friml, M. Grebe, A. Van Den Toorn, K. Palme, and B. Scheres, “Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function,” <i>Plant Cell</i>, vol. 15, no. 3. American Society of Plant Biologists, pp. 612–625, 2003.","apa":"Willemsen, V., Friml, J., Grebe, M., Van Den Toorn, A., Palme, K., &#38; Scheres, B. (2003). Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.008433\">https://doi.org/10.1105/tpc.008433</a>","mla":"Willemsen, Viola, et al. “Cell Polarity and PIN Protein Positioning in Arabidopsis Require STEROL METHYLTRANSFERASE1 Function.” <i>Plant Cell</i>, vol. 15, no. 3, American Society of Plant Biologists, 2003, pp. 612–25, doi:<a href=\"https://doi.org/10.1105/tpc.008433\">10.1105/tpc.008433</a>.","chicago":"Willemsen, Viola, Jiří Friml, Markus Grebe, Albert Van Den Toorn, Klaus Palme, and Ben Scheres. “Cell Polarity and PIN Protein Positioning in Arabidopsis Require STEROL METHYLTRANSFERASE1 Function.” <i>Plant Cell</i>. American Society of Plant Biologists, 2003. <a href=\"https://doi.org/10.1105/tpc.008433\">https://doi.org/10.1105/tpc.008433</a>.","ama":"Willemsen V, Friml J, Grebe M, Van Den Toorn A, Palme K, Scheres B. Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. <i>Plant Cell</i>. 2003;15(3):612-625. doi:<a href=\"https://doi.org/10.1105/tpc.008433\">10.1105/tpc.008433</a>","short":"V. Willemsen, J. Friml, M. Grebe, A. Van Den Toorn, K. Palme, B. Scheres, Plant Cell 15 (2003) 612–625.","ista":"Willemsen V, Friml J, Grebe M, Van Den Toorn A, Palme K, Scheres B. 2003. Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. 15(3), 612–625."}},{"_id":"2993","date_updated":"2021-01-12T07:40:18Z","quality_controlled":0,"issue":"1","month":"04","doi":"10.1046/j.1365-313X.2003.01705.x","date_published":"2003-04-01T00:00:00Z","year":"2003","publist_id":"3709","status":"public","type":"journal_article","volume":34,"abstract":[{"text":"Plant biology is currently experiencing a growing demand for easy and reliable mRNA and protein localisation techniques. Here, we present novel whole mount in situ hybridisation and immunolocalisation protocols, suitable to localise mRNAs and proteins in Arabidopsis seedlings. We demonstrate that these methods can be used in different organs of Arabidopsis seedlings as well as in other plant species. In order to achieve better reproducibility and higher throughput, we modified these protocols for automation to be performed by a liquid handling robot. In addition, we show that other procedures such as reporter enzyme assays and tissue clearing can be similarly automated. We present examples of application of our protocols including mRNA localisation and proteins and epitope tag (co)localisations which demonstrate that these methods provide reliable and versatile tools for expression, localisation and anatomical studies in plants.","lang":"eng"}],"date_created":"2018-12-11T12:00:44Z","publisher":"Wiley-Blackwell","intvolume":"        34","page":"115 - 124","publication":"Plant Journal","author":[{"orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Jirí Friml","last_name":"Friml"},{"orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","full_name":"Eva Benková","last_name":"Benková"},{"first_name":"Ulrike","full_name":"Mayer, Ulrike","last_name":"Mayer"},{"full_name":"Palme, Klaus","last_name":"Palme","first_name":"Klaus"},{"first_name":"Gerhard","full_name":"Muster, Gerhard","last_name":"Muster"}],"citation":{"ama":"Friml J, Benková E, Mayer U, Palme K, Muster G. Automated whole mount localisation techniques for plant seedlings. <i>Plant Journal</i>. 2003;34(1):115-124. doi:<a href=\"https://doi.org/10.1046/j.1365-313X.2003.01705.x\">10.1046/j.1365-313X.2003.01705.x</a>","chicago":"Friml, Jiří, Eva Benková, Ulrike Mayer, Klaus Palme, and Gerhard Muster. “Automated Whole Mount Localisation Techniques for Plant Seedlings.” <i>Plant Journal</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1365-313X.2003.01705.x\">https://doi.org/10.1046/j.1365-313X.2003.01705.x</a>.","ista":"Friml J, Benková E, Mayer U, Palme K, Muster G. 2003. Automated whole mount localisation techniques for plant seedlings. Plant Journal. 34(1), 115–124.","short":"J. Friml, E. Benková, U. Mayer, K. Palme, G. Muster, Plant Journal 34 (2003) 115–124.","mla":"Friml, Jiří, et al. “Automated Whole Mount Localisation Techniques for Plant Seedlings.” <i>Plant Journal</i>, vol. 34, no. 1, Wiley-Blackwell, 2003, pp. 115–24, doi:<a href=\"https://doi.org/10.1046/j.1365-313X.2003.01705.x\">10.1046/j.1365-313X.2003.01705.x</a>.","apa":"Friml, J., Benková, E., Mayer, U., Palme, K., &#38; Muster, G. (2003). Automated whole mount localisation techniques for plant seedlings. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1365-313X.2003.01705.x\">https://doi.org/10.1046/j.1365-313X.2003.01705.x</a>","ieee":"J. Friml, E. Benková, U. Mayer, K. Palme, and G. Muster, “Automated whole mount localisation techniques for plant seedlings,” <i>Plant Journal</i>, vol. 34, no. 1. Wiley-Blackwell, pp. 115–124, 2003."},"publication_status":"published","title":"Automated whole mount localisation techniques for plant seedlings","day":"01","extern":1},{"day":"20","extern":1,"author":[{"full_name":"Reinhardt, Didier","last_name":"Reinhardt","first_name":"Didier"},{"full_name":"Pesce, Eva-Rachele","last_name":"Pesce","first_name":"Eva"},{"first_name":"Pia","last_name":"Stieger","full_name":"Stieger, Pia"},{"last_name":"Mandel","full_name":"Mandel, Therese","first_name":"Therese"},{"first_name":"Kurt","last_name":"Baltensperger","full_name":"Baltensperger, Kurt"},{"first_name":"Malcolm","full_name":"Bennett, Malcolm","last_name":"Bennett"},{"full_name":"Traas, Jan","last_name":"Traas","first_name":"Jan"},{"last_name":"Friml","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Cris","last_name":"Kuhlemeier","full_name":"Kuhlemeier, Cris"}],"citation":{"apa":"Reinhardt, D., Pesce, E., Stieger, P., Mandel, T., Baltensperger, K., Bennett, M., … Kuhlemeier, C. (2003). Regulation of phyllotaxis by polar auxin transport. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature02081\">https://doi.org/10.1038/nature02081</a>","ieee":"D. Reinhardt <i>et al.</i>, “Regulation of phyllotaxis by polar auxin transport,” <i>Nature</i>, vol. 426, no. 6964. Nature Publishing Group, pp. 255–260, 2003.","ista":"Reinhardt D, Pesce E, Stieger P, Mandel T, Baltensperger K, Bennett M, Traas J, Friml J, Kuhlemeier C. 2003. Regulation of phyllotaxis by polar auxin transport. Nature. 426(6964), 255–260.","short":"D. Reinhardt, E. Pesce, P. Stieger, T. Mandel, K. Baltensperger, M. Bennett, J. Traas, J. Friml, C. Kuhlemeier, Nature 426 (2003) 255–260.","chicago":"Reinhardt, Didier, Eva Pesce, Pia Stieger, Therese Mandel, Kurt Baltensperger, Malcolm Bennett, Jan Traas, Jiří Friml, and Cris Kuhlemeier. “Regulation of Phyllotaxis by Polar Auxin Transport.” <i>Nature</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/10.1038/nature02081\">https://doi.org/10.1038/nature02081</a>.","ama":"Reinhardt D, Pesce E, Stieger P, et al. Regulation of phyllotaxis by polar auxin transport. <i>Nature</i>. 2003;426(6964):255-260. doi:<a href=\"https://doi.org/10.1038/nature02081\">10.1038/nature02081</a>","mla":"Reinhardt, Didier, et al. “Regulation of Phyllotaxis by Polar Auxin Transport.” <i>Nature</i>, vol. 426, no. 6964, Nature Publishing Group, 2003, pp. 255–60, doi:<a href=\"https://doi.org/10.1038/nature02081\">10.1038/nature02081</a>."},"publication":"Nature","publication_status":"published","title":"Regulation of phyllotaxis by polar auxin transport","intvolume":"       426","page":"255 - 260","publisher":"Nature Publishing Group","volume":426,"abstract":[{"lang":"eng","text":"The regular arrangement of leaves around a plant's stem, called phyllotaxis, has for centuries attracted the attention of philosophers, mathematicians and natural scientists; however, to date, studies of phyllotaxis have been largely theoretical. Leaves and flowers are formed from the shoot apical meristem, triggered by the plant hormone auxin. Auxin is transported through plant tissues by specific cellular influx and efflux carrier proteins. Here we show that proteins involved in auxin transport regulate phyllotaxis. Our data indicate that auxin is transported upwards into the meristem through the epidermis and the outermost meristem cell layer. Existing leaf primordia act as sinks, redistributing auxin and creating its heterogeneous distribution in the meristem. Auxin accumulation occurs only at certain minimal distances from existing primordia, defining the position of future primordia. This model for phyllotaxis accounts for its reiterative nature, as well as its regularity and stability."}],"date_created":"2018-12-11T12:00:45Z","year":"2003","date_published":"2003-11-20T00:00:00Z","publist_id":"3707","status":"public","type":"journal_article","issue":"6964","month":"11","doi":"10.1038/nature02081","_id":"2994","quality_controlled":0,"date_updated":"2021-01-12T07:40:18Z"},{"status":"public","type":"journal_article","year":"2003","date_published":"2003-11-13T00:00:00Z","publist_id":"3708","_id":"2995","quality_controlled":0,"date_updated":"2021-01-12T07:40:19Z","doi":"10.1038/nature02085","month":"11","issue":"6963","title":"Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis","publication_status":"published","publication":"Nature","citation":{"ieee":"J. Friml <i>et al.</i>, “Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis,” <i>Nature</i>, vol. 426, no. 6963. Nature Publishing Group, pp. 147–153, 2003.","apa":"Friml, J., Vieten, A., Sauer, M., Weijers, D., Schwarz, H., Hamann, T., … Jürgens, G. (2003). Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature02085\">https://doi.org/10.1038/nature02085</a>","mla":"Friml, Jiří, et al. “Efflux Dependent Auxin Gradients Establish the Apical Basal Axis of Arabidopsis.” <i>Nature</i>, vol. 426, no. 6963, Nature Publishing Group, 2003, pp. 147–53, doi:<a href=\"https://doi.org/10.1038/nature02085\">10.1038/nature02085</a>.","ama":"Friml J, Vieten A, Sauer M, et al. Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. <i>Nature</i>. 2003;426(6963):147-153. doi:<a href=\"https://doi.org/10.1038/nature02085\">10.1038/nature02085</a>","chicago":"Friml, Jiří, Anne Vieten, Michael Sauer, Dolf Weijers, Heinz Schwarz, Thorsten Hamann, Remko Offringa, and Gerd Jürgens. “Efflux Dependent Auxin Gradients Establish the Apical Basal Axis of Arabidopsis.” <i>Nature</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/10.1038/nature02085\">https://doi.org/10.1038/nature02085</a>.","short":"J. Friml, A. Vieten, M. Sauer, D. Weijers, H. Schwarz, T. Hamann, R. Offringa, G. Jürgens, Nature 426 (2003) 147–153.","ista":"Friml J, Vieten A, Sauer M, Weijers D, Schwarz H, Hamann T, Offringa R, Jürgens G. 2003. Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. 426(6963), 147–153."},"author":[{"full_name":"Jirí Friml","last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"full_name":"Vieten, Anne","last_name":"Vieten","first_name":"Anne"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"first_name":"Dolf","last_name":"Weijers","full_name":"Weijers, Dolf"},{"full_name":"Schwarz, Heinz","last_name":"Schwarz","first_name":"Heinz"},{"last_name":"Hamann","full_name":"Hamann, Thorsten","first_name":"Thorsten"},{"first_name":"Remko","full_name":"Offringa, Remko","last_name":"Offringa"},{"first_name":"Gerd","full_name":"Jürgens, Gerd","last_name":"Jürgens"}],"day":"13","extern":1,"volume":426,"abstract":[{"lang":"eng","text":"Axis formation occurs in plants, as in animals, during early embryogenesis. However, the underlying mechanism is not known. Here we show that the first manifestation of the apical-basal axis in plants, the asymmetric division of the zygote, produces a basal cell that transports and an apical cell that responds to the signalling molecule auxin. This apical-basal auxin activity gradient triggers the specification of apical embryo structures and is actively maintained by a novel component of auxin efflux, PIN7, which is located apically in the basal cell. Later, the developmentally regulated reversal of PIN7 and onset of PIN1 polar localization reorganize the auxin gradient for specification of the basal root pole. An analysis of pin quadruple mutants identifies PIN-dependent transport as an essential part of the mechanism for embryo axis formation. Our results indicate how the establishment of cell polarity, polar auxin efflux and local auxin response result in apical-basal axis formation of the embryo, and thus determine the axiality of the adult plant.\n"}],"date_created":"2018-12-11T12:00:45Z","publisher":"Nature Publishing Group","page":"147 - 153","intvolume":"       426"},{"page":"591 - 602","publisher":"Cell Press","intvolume":"       115","abstract":[{"lang":"eng","text":"Plants, compared to animals, exhibit an amazing adaptability and plasticity in their development. This is largely dependent on the ability of plants to form new organs, such as lateral roots, leaves, and flowers during postembryonic development. Organ primordia develop from founder cell populations into organs by coordinated cell division and differentiation. Here, we show that organ formation in Arabidopsis involves dynamic gradients of the signaling molecule auxin with maxima at the primordia tips. These gradients are mediated by cellular efflux requiring asymmetrically localized PIN proteins, which represent a functionally redundant network for auxin distribution in both aerial and underground organs. PIN1 polar localization undergoes a dynamic rearrangement, which correlates with establishment of auxin gradients and primordium development. Our results suggest that PIN-dependent, local auxin gradients represent a common module for formation of all plant organs, regardless of their mature morphology or developmental origin.\n"}],"volume":115,"date_created":"2018-12-11T12:00:46Z","extern":1,"day":"26","publication_status":"published","title":"Local, efflux-dependent auxin gradients as a common module for plant organ formation","publication":"Cell","author":[{"orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","last_name":"Benková"},{"first_name":"Marta","last_name":"Michniewicz","full_name":"Michniewicz, Marta"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"first_name":"Thomas","full_name":"Teichmann, Thomas","last_name":"Teichmann"},{"last_name":"Seifertová","full_name":"Seifertová, Daniela","first_name":"Daniela"},{"full_name":"Jürgens, Gerd","last_name":"Jürgens","first_name":"Gerd"},{"last_name":"Friml","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"}],"citation":{"mla":"Benková, Eva, et al. “Local, Efflux-Dependent Auxin Gradients as a Common Module for Plant Organ Formation.” <i>Cell</i>, vol. 115, no. 5, Cell Press, 2003, pp. 591–602, doi:<a href=\"https://doi.org/10.1016/S0092-8674(03)00924-3\">10.1016/S0092-8674(03)00924-3</a>.","short":"E. Benková, M. Michniewicz, M. Sauer, T. Teichmann, D. Seifertová, G. Jürgens, J. Friml, Cell 115 (2003) 591–602.","ista":"Benková E, Michniewicz M, Sauer M, Teichmann T, Seifertová D, Jürgens G, Friml J. 2003. Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. 115(5), 591–602.","ama":"Benková E, Michniewicz M, Sauer M, et al. Local, efflux-dependent auxin gradients as a common module for plant organ formation. <i>Cell</i>. 2003;115(5):591-602. doi:<a href=\"https://doi.org/10.1016/S0092-8674(03)00924-3\">10.1016/S0092-8674(03)00924-3</a>","chicago":"Benková, Eva, Marta Michniewicz, Michael Sauer, Thomas Teichmann, Daniela Seifertová, Gerd Jürgens, and Jiří Friml. “Local, Efflux-Dependent Auxin Gradients as a Common Module for Plant Organ Formation.” <i>Cell</i>. Cell Press, 2003. <a href=\"https://doi.org/10.1016/S0092-8674(03)00924-3\">https://doi.org/10.1016/S0092-8674(03)00924-3</a>.","ieee":"E. Benková <i>et al.</i>, “Local, efflux-dependent auxin gradients as a common module for plant organ formation,” <i>Cell</i>, vol. 115, no. 5. Cell Press, pp. 591–602, 2003.","apa":"Benková, E., Michniewicz, M., Sauer, M., Teichmann, T., Seifertová, D., Jürgens, G., &#38; Friml, J. (2003). Local, efflux-dependent auxin gradients as a common module for plant organ formation. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/S0092-8674(03)00924-3\">https://doi.org/10.1016/S0092-8674(03)00924-3</a>"},"doi":"10.1016/S0092-8674(03)00924-3","month":"11","issue":"5","_id":"2996","quality_controlled":0,"date_updated":"2021-01-12T07:40:19Z","status":"public","type":"journal_article","date_published":"2003-11-26T00:00:00Z","year":"2003","publist_id":"3706"},{"_id":"3139","quality_controlled":0,"date_updated":"2019-04-26T07:22:24Z","issue":"1","month":"02","doi":"10.1016/S0959-4388(03)00006-0","date_published":"2003-02-01T00:00:00Z","year":"2003","publist_id":"3557","status":"public","type":"review","abstract":[{"text":"Significant advances have been made during the past few years in our understanding of how the spinal monosynaptic reflex develops. Transcription factors in the Neurogenin, Runt, ETS, and LIM families control sequential steps of the specification of various subtypes of dorsal root ganglia sensory neurons. The initiation of muscle spindle differentiation requires neuregulin 1, derived from Ia afferent sensory neurons, and signaling through ErbB receptors in intrafusal muscle fibers. Several retrograde signals from the periphery are important for the establishment of late connectivity in the reflex circuit. Finally, neurotrophin 3 released from muscle spindles regulates the strength of sensory-motor connections within the spinal cord postnatally.","lang":"eng"}],"volume":13,"date_created":"2018-12-11T12:01:37Z","intvolume":"        13","page":"96 - 102","publisher":"Elsevier","publication":"Current Opinion in Neurobiology","citation":{"ieee":"H. Chen, S. Hippenmeyer, S. Arber, and E. Frank, “Development of the monosynaptic stretch reflex circuit,” <i>Current Opinion in Neurobiology</i>, vol. 13, no. 1. Elsevier, pp. 96–102, 2003.","apa":"Chen, H., Hippenmeyer, S., Arber, S., &#38; Frank, E. (2003). Development of the monosynaptic stretch reflex circuit. <i>Current Opinion in Neurobiology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0959-4388(03)00006-0\">https://doi.org/10.1016/S0959-4388(03)00006-0</a>","mla":"Chen, Hsiao, et al. “Development of the Monosynaptic Stretch Reflex Circuit.” <i>Current Opinion in Neurobiology</i>, vol. 13, no. 1, Elsevier, 2003, pp. 96–102, doi:<a href=\"https://doi.org/10.1016/S0959-4388(03)00006-0\">10.1016/S0959-4388(03)00006-0</a>.","ista":"Chen H, Hippenmeyer S, Arber S, Frank E. 2003. Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. 13(1), 96–102.","short":"H. Chen, S. Hippenmeyer, S. Arber, E. Frank, Current Opinion in Neurobiology 13 (2003) 96–102.","chicago":"Chen, Hsiao, Simon Hippenmeyer, Silvia Arber, and Eric Frank. “Development of the Monosynaptic Stretch Reflex Circuit.” <i>Current Opinion in Neurobiology</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0959-4388(03)00006-0\">https://doi.org/10.1016/S0959-4388(03)00006-0</a>.","ama":"Chen H, Hippenmeyer S, Arber S, Frank E. Development of the monosynaptic stretch reflex circuit. <i>Current Opinion in Neurobiology</i>. 2003;13(1):96-102. doi:<a href=\"https://doi.org/10.1016/S0959-4388(03)00006-0\">10.1016/S0959-4388(03)00006-0</a>"},"author":[{"first_name":"Hsiao","full_name":"Chen, Hsiao Huei","last_name":"Chen"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Simon Hippenmeyer","last_name":"Hippenmeyer"},{"full_name":"Arber, Silvia","last_name":"Arber","first_name":"Silvia"},{"full_name":"Frank, Eric","last_name":"Frank","first_name":"Eric"}],"title":"Development of the monosynaptic stretch reflex circuit","publication_status":"published","extern":1,"day":"01"},{"abstract":[{"lang":"eng","text":"Tripartite G-protein-coupled receptors (GPCRs) represent one of the largest groups of signal transducers, transmitting signals from hormones, neuropeptides, odorants, food and light. Ligand-bound receptors catalyse GDP/GTP exchange on the G-protein α-subunit (Gα), leading to α-GTP separation from the βγ subunits and pathway activation. Activating mutations in the receptors or G proteins underlie many human diseases, including some cancers, dwarfism and premature puberty. Regulators of G-protein signalling (RGS proteins) are known to modulate the level and duration of ligand-induced signalling by accelerating the intrinsic GTPase activity of the Gα subunit, and thus reformation of the inactive GDP-bound Gα. Here we find that even in the absence of receptor, mutation of the RGS family member Sst2 (refs 6-9) permits spontaneous activation of the G-protein-coupled mating pathway in Saccharomyces cerevisiae at levels normally seen only in the presence of ligand. Our work demonstrates the occurence of spontaneous tripartite G-protein signalling in vivo and identifies a requirement for RGS proteins in preventing such receptor-independent activation."}],"volume":5,"date_created":"2018-12-11T12:01:41Z","publisher":"Nature Publishing Group","intvolume":"         5","page":"231 - 235","citation":{"ieee":"D. E. Siekhaus and D. Drubin, “Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant,” <i>Nature Cell Biology</i>, vol. 5, no. 3. Nature Publishing Group, pp. 231–235, 2003.","apa":"Siekhaus, D. E., &#38; Drubin, D. (2003). Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb941\">https://doi.org/10.1038/ncb941</a>","mla":"Siekhaus, Daria E., and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” <i>Nature Cell Biology</i>, vol. 5, no. 3, Nature Publishing Group, 2003, pp. 231–35, doi:<a href=\"https://doi.org/10.1038/ncb941\">10.1038/ncb941</a>.","ama":"Siekhaus DE, Drubin D. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. <i>Nature Cell Biology</i>. 2003;5(3):231-235. doi:<a href=\"https://doi.org/10.1038/ncb941\">10.1038/ncb941</a>","chicago":"Siekhaus, Daria E, and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/10.1038/ncb941\">https://doi.org/10.1038/ncb941</a>.","ista":"Siekhaus DE, Drubin D. 2003. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. 5(3), 231–235.","short":"D.E. Siekhaus, D. Drubin, Nature Cell Biology 5 (2003) 231–235."},"publication":"Nature Cell Biology","author":[{"last_name":"Siekhaus","full_name":"Daria Siekhaus","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353"},{"first_name":"David","full_name":"Drubin, David G","last_name":"Drubin"}],"publication_status":"published","title":"Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant","day":"01","extern":1,"_id":"3150","date_updated":"2021-01-12T07:41:24Z","quality_controlled":0,"issue":"3","month":"03","doi":"10.1038/ncb941","date_published":"2003-03-01T00:00:00Z","year":"2003","publist_id":"3544","status":"public","type":"journal_article"},{"author":[{"full_name":"Rayburn, Lowell Y","last_name":"Rayburn","first_name":"Lowell"},{"full_name":"Gooding, Holly C","last_name":"Gooding","first_name":"Holly"},{"last_name":"Choksi","full_name":"Choksi, Semil P","first_name":"Semil"},{"first_name":"Dhea","last_name":"Maloney","full_name":"Maloney, Dhea"},{"last_name":"Kidd","full_name":"Kidd, Ambrose R","first_name":"Ambrose"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","orcid":"0000-0001-8323-8353","last_name":"Siekhaus","full_name":"Daria Siekhaus"},{"last_name":"Bender","full_name":"Bender, Michael","first_name":"Michael"}],"citation":{"ieee":"L. Rayburn <i>et al.</i>, “Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development,” <i>Genetics</i>, vol. 163, no. 1. Genetics Society of America, pp. 227–237, 2003.","apa":"Rayburn, L., Gooding, H., Choksi, S., Maloney, D., Kidd, A., Siekhaus, D. E., &#38; Bender, M. (2003). Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. <i>Genetics</i>. Genetics Society of America.","mla":"Rayburn, Lowell, et al. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” <i>Genetics</i>, vol. 163, no. 1, Genetics Society of America, 2003, pp. 227–37.","short":"L. Rayburn, H. Gooding, S. Choksi, D. Maloney, A. Kidd, D.E. Siekhaus, M. Bender, Genetics 163 (2003) 227–237.","ista":"Rayburn L, Gooding H, Choksi S, Maloney D, Kidd A, Siekhaus DE, Bender M. 2003. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. 163(1), 227–237.","chicago":"Rayburn, Lowell, Holly Gooding, Semil Choksi, Dhea Maloney, Ambrose Kidd, Daria E Siekhaus, and Michael Bender. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” <i>Genetics</i>. Genetics Society of America, 2003.","ama":"Rayburn L, Gooding H, Choksi S, et al. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. <i>Genetics</i>. 2003;163(1):227-237."},"publication":"Genetics","publication_status":"published","title":"Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development","day":"01","extern":1,"date_created":"2018-12-11T12:01:41Z","volume":163,"abstract":[{"lang":"eng","text":"Biosynthesis of most peptide hormones and neuropeptides requires proteolytic excision of the active peptide from inactive proprotein precursors, an activity carried out by subtilisin-like proprotein convertases (SPCs) in constitutive or regulated secretory pathways. The Drosophila amontillado (amon) gene encodes a homolog of the mammalian PC2 protein, an SPC that functions in the regulated secretory pathway in neuroendocrine tissues. We have identified amon mutants by isolating ethylmethanesulfonate (EMS)-induced lethal and visible mutations that define two complementation groups in the amon interval at 97D1 of the third chromosome. DNA sequencing identified the amon complementation group and the DNA sequence change for each of the nine amon alleles isolated. amon mutants display partial embryonic lethality, are defective in larval growth, and arrest during the first to second instar larval molt. Mutant larvae can be rescued by heat-shock-induced expression of the amon protein. Rescued larvae arrest at the subsequent larval molt, suggesting that amon is also required for the second to third instar larval molt. Our data indicate that the amon proprotein convertase is required during embryogenesis and larval development in Drosophila and support the hypothesis that AMON acts to proteolytically process peptide hormones that regulate hatching, larval growth, and larval ecdysis."}],"publisher":"Genetics Society of America","page":"227 - 237","intvolume":"       163","publist_id":"3545","year":"2003","date_published":"2003-01-01T00:00:00Z","type":"journal_article","status":"public","date_updated":"2021-01-12T07:41:25Z","quality_controlled":0,"_id":"3151","issue":"1","month":"01"},{"publisher":"IEEE","page":"26 - 33","intvolume":"         1","date_created":"2018-12-11T12:01:48Z","abstract":[{"lang":"eng","text":"Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut algorithms can be used to find globally minimum geodesic contours (minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of boundary conditions. Second, we show how to minimize metrication artifacts in existing graph-cut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematics -differential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using Cauchy-Crofton formula from integral geometry."}],"volume":1,"day":"30","extern":1,"publication_status":"published","title":"Computing geodesics and minimal surfaces via graph cuts","citation":{"mla":"Boykov, Yuri, and Vladimir Kolmogorov. <i>Computing Geodesics and Minimal Surfaces via Graph Cuts</i>. Vol. 1, IEEE, 2003, pp. 26–33, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>.","ama":"Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: Vol 1. IEEE; 2003:26-33. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>.","short":"Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.","ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.","ieee":"Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.","apa":"Boykov, Y., &#38; Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>"},"author":[{"full_name":"Boykov, Yuri","last_name":"Boykov","first_name":"Yuri"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"}],"month":"09","doi":"10.1109/ICCV.2003.1238310","date_updated":"2021-01-12T07:41:33Z","quality_controlled":0,"_id":"3170","type":"conference","conference":{"name":"ICCV: International Conference on Computer Vision"},"status":"public","publist_id":"3511","date_published":"2003-09-30T00:00:00Z","year":"2003"},{"_id":"3171","quality_controlled":0,"date_updated":"2021-01-12T07:41:34Z","month":"06","doi":"10.1007/978-3-540-45063-4_32","alternative_title":["LNCS"],"conference":{"name":"EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition"},"status":"public","type":"conference","year":"2003","date_published":"2003-06-26T00:00:00Z","publist_id":"3512","abstract":[{"text":"Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few years, two promising approaches have been developed 11,12 that formulate the scene reconstruction problem in terms of energy minimization, and minimize the energy using graph cuts. These energy minimization approaches treat the input images symmetrically, handle visibility constraints correctly, and allow spatial smoothness to be enforced. However, these algorithm propose different problem formulations, and handle a limited class of smoothness terms. One algorithm 11 uses a problem formulation that is restricted to two-camera stereo, and imposes smoothness between a pair of cameras. The other algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness only with respect to a single camera. In this paper we give a more general energy minimization formulation for the problem, which allows a larger class of spatial smoothness constraints. We show that our formulation includes both of the previous approaches as special cases, as well as permitting new energy functions. Experimental results on real data with ground truth are also included. ","lang":"eng"}],"volume":2683,"date_created":"2018-12-11T12:01:48Z","publisher":"Springer","page":"501 - 516","intvolume":"      2683","publication_status":"published","title":"Generalized multi camera scene reconstruction using graph cuts","citation":{"mla":"Kolmogorov, Vladimir, et al. <i>Generalized Multi Camera Scene Reconstruction Using Graph Cuts</i>. Vol. 2683, Springer, 2003, pp. 501–16, doi:<a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">10.1007/978-3-540-45063-4_32</a>.","short":"V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.","ista":"Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction using graph cuts. EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS, vol. 2683, 501–516.","ama":"Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction using graph cuts. In: Vol 2683. Springer; 2003:501-516. doi:<a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">10.1007/978-3-540-45063-4_32</a>","chicago":"Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi Camera Scene Reconstruction Using Graph Cuts,” 2683:501–16. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">https://doi.org/10.1007/978-3-540-45063-4_32</a>.","ieee":"V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.","apa":"Kolmogorov, V., Zabih, R., &#38; Gortler, S. (2003). Generalized multi camera scene reconstruction using graph cuts (Vol. 2683, pp. 501–516). Presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer. <a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">https://doi.org/10.1007/978-3-540-45063-4_32</a>"},"author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"},{"last_name":"Zabih","full_name":"Zabih, Ramin","first_name":"Ramin"},{"full_name":"Gortler, Steven","last_name":"Gortler","first_name":"Steven"}],"extern":1,"day":"26"},{"date_published":"2003-09-30T00:00:00Z","year":"2003","publist_id":"3510","conference":{"name":"ICCV: International Conference on Computer Vision"},"status":"public","type":"conference","doi":"10.1109/ICCV.2003.1238463","month":"09","_id":"3174","date_updated":"2021-01-12T07:41:35Z","quality_controlled":0,"day":"30","extern":1,"author":[{"first_name":"Junhwan","full_name":"Kim, Junhwan","last_name":"Kim"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov"},{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"}],"citation":{"ista":"Kim J, Kolmogorov V, Zabih R. 2003. Visual correspondence using energy minimization and mutual information. ICCV: International Conference on Computer Vision vol. 2, 1033–1040.","short":"J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.","ama":"Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization and mutual information. In: Vol 2. IEEE; 2003:1033-1040. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">10.1109/ICCV.2003.1238463</a>","chicago":"Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence Using Energy Minimization and Mutual Information,” 2:1033–40. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">https://doi.org/10.1109/ICCV.2003.1238463</a>.","mla":"Kim, Junhwan, et al. <i>Visual Correspondence Using Energy Minimization and Mutual Information</i>. Vol. 2, IEEE, 2003, pp. 1033–40, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">10.1109/ICCV.2003.1238463</a>.","apa":"Kim, J., Kolmogorov, V., &#38; Zabih, R. (2003). Visual correspondence using energy minimization and mutual information (Vol. 2, pp. 1033–1040). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">https://doi.org/10.1109/ICCV.2003.1238463</a>","ieee":"J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040."},"title":"Visual correspondence using energy minimization and mutual information","publication_status":"published","publisher":"IEEE","intvolume":"         2","page":"1033 - 1040","abstract":[{"lang":"eng","text":"We address visual correspondence problems without assuming that scene points have similar intensities in different views. This situation is common, usually due to non-lambertian scenes or to differences between cameras. We use maximization of mutual information, a powerful technique for registering images that requires no a priori model of the relationship between scene intensities in different views. However, it has proven difficult to use mutual information to compute dense visual correspondence. Comparing fixed-size windows via mutual information suffers from the well-known problems of fixed windows, namely poor performance at discontinuities and in low-texture regions. In this paper, we show how to compute visual correspondence using mutual information without suffering from these problems. Using 'a simple approximation, mutual information can be incorporated into the standard energy minimization framework used in early vision. The energy can then be efficiently minimized using graph cuts, which preserve discontinuities and handle low-texture regions. The resulting algorithm combines the accurate disparity maps that come from graph cuts with the tolerance for intensity changes that comes from mutual information."}],"volume":2,"date_created":"2018-12-11T12:01:49Z"},{"title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","publication_status":"published","citation":{"apa":"Pietrzak, K. Z. (2003). On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">https://doi.org/10.1016/S0022-0000(03)00078-3</a>","ieee":"K. Z. Pietrzak, “On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems,” <i>Journal of Computer and System Sciences</i>, vol. 67, no. 4. Elsevier, pp. 757–771, 2003.","ista":"Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.","short":"K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.","ama":"Pietrzak KZ. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. <i>Journal of Computer and System Sciences</i>. 2003;67(4):757-771. doi:<a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">10.1016/S0022-0000(03)00078-3</a>","chicago":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">https://doi.org/10.1016/S0022-0000(03)00078-3</a>.","mla":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” <i>Journal of Computer and System Sciences</i>, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:<a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">10.1016/S0022-0000(03)00078-3</a>."},"publication":"Journal of Computer and System Sciences","author":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"}],"day":"01","extern":1,"volume":67,"abstract":[{"text":"We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences.","lang":"eng"}],"date_created":"2018-12-11T12:02:01Z","page":"757 - 771","intvolume":"        67","publisher":"Elsevier","status":"public","type":"journal_article","year":"2003","date_published":"2003-12-01T00:00:00Z","publist_id":"3472","_id":"3209","quality_controlled":0,"date_updated":"2021-01-12T07:41:49Z","month":"12","doi":"10.1016/S0022-0000(03)00078-3","issue":"4"},{"alternative_title":["LNCS"],"type":"conference","status":"public","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"publist_id":"3473","year":"2003","date_published":"2003-06-04T00:00:00Z","quality_controlled":0,"date_updated":"2021-01-12T07:41:49Z","_id":"3210","doi":"10.1007/3-540-39200-9_34","month":"06","publication_status":"published","title":"The security of many round Luby Rackoff pseudo random permutations","author":[{"last_name":"Maurer","full_name":"Maurer, Ueli M","first_name":"Ueli"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak"}],"citation":{"short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.","ista":"Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656, 544–561.","ama":"Maurer U, Pietrzak KZ. The security of many round Luby Rackoff pseudo random permutations. In: Vol 2656. Springer; 2003:544-561. doi:<a href=\"https://doi.org/10.1007/3-540-39200-9_34\">10.1007/3-540-39200-9_34</a>","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “The Security of Many Round Luby Rackoff Pseudo Random Permutations,” 2656:544–61. Springer, 2003. <a href=\"https://doi.org/10.1007/3-540-39200-9_34\">https://doi.org/10.1007/3-540-39200-9_34</a>.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. <i>The Security of Many Round Luby Rackoff Pseudo Random Permutations</i>. Vol. 2656, Springer, 2003, pp. 544–61, doi:<a href=\"https://doi.org/10.1007/3-540-39200-9_34\">10.1007/3-540-39200-9_34</a>.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2003). The security of many round Luby Rackoff pseudo random permutations (Vol. 2656, pp. 544–561). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. <a href=\"https://doi.org/10.1007/3-540-39200-9_34\">https://doi.org/10.1007/3-540-39200-9_34</a>","ieee":"U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561."},"extern":1,"day":"04","date_created":"2018-12-11T12:02:02Z","abstract":[{"lang":"eng","text":"Luby and Rackoff showed how to construct a (super-)pseudo-random permutation {0,1}2n→ {0,1}2n from some number r of pseudo-random functions {0,1}n → {0,1}n. Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudo-random function f is defined as (L, R) → (R,L ⊕ f (R)), where L and R are the left and right part of the input and ⊕ denotes bitwise XOR or, in this paper, any other group operation on {0,1}n. The only non-trivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions {0,1}n → {0,1}n, denoted Ψ2nr is indistinguishable from a uniform random permutation {0,1}2n → {0,1}2n by any computationally unbounded adaptive distinguisher making at most O(2cn) combined chosen plaintext/ciphertext queries for any c &lt; α, where a is a security parameter. Luby and Rackoff proved α = 1/2 for r = 4. A natural problem, proposed by Pieprzyk is to improve on α for larger r. The best known result, α = 3/4 for r = 6, is due to Patarin. In this paper we prove a = 1 -O(1/r), i.e., the trivial upper bound α = 1 can be approached. The proof uses some new techniques that can be of independent interest. "}],"volume":2656,"page":"544 - 561","publisher":"Springer","intvolume":"      2656"},{"article_type":"original","extern":"1","citation":{"ista":"Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. 2003. Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. 59(25), 4525–4531.","short":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003) 4525–4531.","ama":"Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction of vinyl sulfones and sulfoxides. <i>Tetrahedron</i>. 2003;59(25):4525-4531. doi:<a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">10.1016/s0040-4020(03)00682-3</a>","chicago":"Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” <i>Tetrahedron</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">https://doi.org/10.1016/s0040-4020(03)00682-3</a>.","mla":"Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” <i>Tetrahedron</i>, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:<a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">10.1016/s0040-4020(03)00682-3</a>.","apa":"Michrowska, A., Bieniek, M., Kim, M., Klajn, R., &#38; Grela, K. (2003). Cross-metathesis reaction of vinyl sulfones and sulfoxides. <i>Tetrahedron</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">https://doi.org/10.1016/s0040-4020(03)00682-3</a>","ieee":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis reaction of vinyl sulfones and sulfoxides,” <i>Tetrahedron</i>, vol. 59, no. 25. Elsevier, pp. 4525–4531, 2003."},"author":[{"last_name":"Michrowska","full_name":"Michrowska, Anna","first_name":"Anna"},{"first_name":"Michał","full_name":"Bieniek, Michał","last_name":"Bieniek"},{"first_name":"Mikhail","last_name":"Kim","full_name":"Kim, Mikhail"},{"full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"},{"first_name":"Karol","last_name":"Grela","full_name":"Grela, Karol"}],"title":"Cross-metathesis reaction of vinyl sulfones and sulfoxides","page":"4525-4531","abstract":[{"text":"Cross-metathesis reactions of α,β-unsaturated sulfones and sulfoxides in the presence of molybdenum and ruthenium pre-catalysts were tested. A selective metahesis reaction was achieved between functionalized terminal olefins and vinyl sulfones by using the ‘second generation’ ruthenium catalysts 1c–h while the highly active Schrock catalyst 1b was found to be functional group incompatible with vinyl sulfones. The cross-metathesis products were isolated in good yields with an excellent (E)-selectivity. Both the molybdenum and ruthenium-based complexes were, however, incompatible with α,β- and β,γ-unsaturated sulfoxides.","lang":"eng"}],"date_created":"2023-08-01T10:39:34Z","year":"2003","oa_version":"None","scopus_import":"1","language":[{"iso":"eng"}],"day":"16","publication":"Tetrahedron","publication_status":"published","keyword":["Organic Chemistry","Drug Discovery","Biochemistry"],"intvolume":"        59","publisher":"Elsevier","publication_identifier":{"issn":["0040-4020"],"eissn":["1464-5416"]},"volume":59,"date_published":"2003-06-16T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","type":"journal_article","article_processing_charge":"No","issue":"25","month":"06","doi":"10.1016/s0040-4020(03)00682-3","_id":"13436","quality_controlled":"1","date_updated":"2023-08-08T12:44:17Z"},{"day":"01","extern":1,"publication_status":"published","title":"Mirror symmetry, langlands duality, and the Hitchin system","citation":{"ieee":"T. Hausel and M. Thaddeus, “Mirror symmetry, langlands duality, and the Hitchin system,” <i>Inventiones Mathematicae</i>, vol. 153, no. 1. Springer, pp. 197–229, 2003.","apa":"Hausel, T., &#38; Thaddeus, M. (2003). Mirror symmetry, langlands duality, and the Hitchin system. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-003-0286-7\">https://doi.org/10.1007/s00222-003-0286-7</a>","mla":"Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and the Hitchin System.” <i>Inventiones Mathematicae</i>, vol. 153, no. 1, Springer, 2003, pp. 197–229, doi:<a href=\"https://doi.org/10.1007/s00222-003-0286-7\">10.1007/s00222-003-0286-7</a>.","chicago":"Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and the Hitchin System.” <i>Inventiones Mathematicae</i>. Springer, 2003. <a href=\"https://doi.org/10.1007/s00222-003-0286-7\">https://doi.org/10.1007/s00222-003-0286-7</a>.","ama":"Hausel T, Thaddeus M. Mirror symmetry, langlands duality, and the Hitchin system. <i>Inventiones Mathematicae</i>. 2003;153(1):197-229. doi:<a href=\"https://doi.org/10.1007/s00222-003-0286-7\">10.1007/s00222-003-0286-7</a>","short":"T. Hausel, M. Thaddeus, Inventiones Mathematicae 153 (2003) 197–229.","ista":"Hausel T, Thaddeus M. 2003. Mirror symmetry, langlands duality, and the Hitchin system. Inventiones Mathematicae. 153(1), 197–229."},"publication":"Inventiones Mathematicae","author":[{"full_name":"Tamas Hausel","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas"},{"first_name":"Michael","full_name":"Thaddeus, Michael","last_name":"Thaddeus"}],"publisher":"Springer","intvolume":"       153","page":"197 - 229","volume":153,"abstract":[{"text":"Among the major mathematical approaches to mirror symmetry are those of Batyrev-Borisov and Stromdnger-Yau-Zaslow (SYZ). The first is explicit and amenable to computation but is not clearly related to the physical motivation; the second is the opposite. Furthermore, it is far from obvious that mirror partners in one sense will also be mirror partners in the other. This paper concerns a class of examples that can be shown to satisfy the requirements of SYZ, but whose Hodge numbers are also equal. This provides significant evidence in support of SYZ. Moreover, the examples are of great interest in their own right: they are spaces of flat SLr-connections on a smooth curve. The mirror is the corresponding space for the Langlands dual group PGLr. These examples therefore throw a bridge from mirror symmetry to the duality theory of Lie groups and, more broadly, to the geometric Langlands program.","lang":"eng"}],"date_created":"2018-12-11T11:52:08Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0205236"}],"status":"public","type":"journal_article","date_published":"2003-07-01T00:00:00Z","year":"2003","publist_id":"5738","doi":"10.1007/s00222-003-0286-7","oa":1,"month":"07","issue":"1","_id":"1457","quality_controlled":0,"date_updated":"2021-01-12T06:50:52Z"},{"volume":16,"abstract":[{"lang":"eng","text":"The moduli space of stable bundles of rank $2$ and degree $1$ on a Riemann surface has rational cohomology generated by the so-called universal classes. The work of Baranovsky, King-Newstead, Siebert-Tian and Zagier provided a complete set of relations between these classes, expressed in terms of a recursion in the genus. This paper accomplishes the same thing for the noncompact moduli spaces of Higgs bundles, in the sense of Hitchin and Simpson. There are many more independent relations than for stable bundles, but in a sense the answer is simpler, since the formulas are completely explicit, not recursive. The results of Kirwan on equivariant cohomology for holomorphic circle actions are of key importance."}],"date_created":"2018-12-11T11:52:08Z","acknowledgement":"The first author was supported by NSF grant DMS-97-29992. The second author was supported by NSF grant DMS-98-08529.","publisher":"American Mathematical Society","page":"303 - 329","intvolume":"        16","author":[{"last_name":"Hausel","full_name":"Tamas Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Thaddeus","full_name":"Thaddeus, Michael"}],"citation":{"mla":"Hausel, Tamás, and Michael Thaddeus. “Relations in the Cohomology Ring of the Moduli Space of Rank 2 Higgs Bundles.” <i>Journal of the American Mathematical Society</i>, vol. 16, no. 2, American Mathematical Society, 2003, pp. 303–29, doi:<a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">10.1090/S0894-0347-02-00417-4</a>.","short":"T. Hausel, M. Thaddeus, Journal of the American Mathematical Society 16 (2003) 303–329.","ista":"Hausel T, Thaddeus M. 2003. Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. Journal of the American Mathematical Society. 16(2), 303–329.","ama":"Hausel T, Thaddeus M. Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. <i>Journal of the American Mathematical Society</i>. 2003;16(2):303-329. doi:<a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">10.1090/S0894-0347-02-00417-4</a>","chicago":"Hausel, Tamás, and Michael Thaddeus. “Relations in the Cohomology Ring of the Moduli Space of Rank 2 Higgs Bundles.” <i>Journal of the American Mathematical Society</i>. American Mathematical Society, 2003. <a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">https://doi.org/10.1090/S0894-0347-02-00417-4</a>.","ieee":"T. Hausel and M. Thaddeus, “Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles,” <i>Journal of the American Mathematical Society</i>, vol. 16, no. 2. American Mathematical Society, pp. 303–329, 2003.","apa":"Hausel, T., &#38; Thaddeus, M. (2003). Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. <i>Journal of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">https://doi.org/10.1090/S0894-0347-02-00417-4</a>"},"publication":"Journal of the American Mathematical Society","title":"Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles","publication_status":"published","extern":1,"day":"01","_id":"1458","date_updated":"2021-01-12T06:50:53Z","quality_controlled":0,"issue":"2","oa":1,"month":"04","doi":"10.1090/S0894-0347-02-00417-4","date_published":"2003-04-01T00:00:00Z","year":"2003","publist_id":"5739","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0003094"}],"status":"public","type":"journal_article"},{"abstract":[{"text":"In this paper we explicitly calculate the analogue of the 't Hooft SU (2) Yang-Mills instantons on Gibbons-Hawking multi-centered gravitational instantons, which come in two parallel families: the multi-Eguchi-Hanson, or Ak ALE gravitational instantons and the multi-Taub-NUT spaces, or Ak ALF gravitational instantons. We calculate their energy and find the reducible ones. Following Kronheimer we also exploit the U(1) invariance of our solutions and study the corresponding explicit singular SU (2) magnetic monopole solutions of the Bogomolny equations on flat ℝ3.","lang":"eng"}],"volume":235,"date_created":"2018-12-11T11:52:09Z","acknowledgement":"We would like to acknowledge the financial support by Prof. P. Major (R ́ enyi Institute, Hungary) from his OTKA grant No. T26176 and of the Miller Institute for Basic Research in Science at UC Berkeley.","page":"275 - 288","intvolume":"       235","publisher":"Springer","author":[{"last_name":"Etesi","full_name":"Etesi, Gábor","first_name":"Gábor"},{"last_name":"Hausel","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas"}],"citation":{"ieee":"G. Etesi and T. Hausel, “On Yang-Mills instantons over multi-centered gravitational instantons,” <i>Communications in Mathematical Physics</i>, vol. 235, no. 2. Springer, pp. 275–288, 2003.","apa":"Etesi, G., &#38; Hausel, T. (2003). On Yang-Mills instantons over multi-centered gravitational instantons. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-003-0806-8\">https://doi.org/10.1007/s00220-003-0806-8</a>","mla":"Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered Gravitational Instantons.” <i>Communications in Mathematical Physics</i>, vol. 235, no. 2, Springer, 2003, pp. 275–88, doi:<a href=\"https://doi.org/10.1007/s00220-003-0806-8\">10.1007/s00220-003-0806-8</a>.","ama":"Etesi G, Hausel T. On Yang-Mills instantons over multi-centered gravitational instantons. <i>Communications in Mathematical Physics</i>. 2003;235(2):275-288. doi:<a href=\"https://doi.org/10.1007/s00220-003-0806-8\">10.1007/s00220-003-0806-8</a>","chicago":"Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered Gravitational Instantons.” <i>Communications in Mathematical Physics</i>. Springer, 2003. <a href=\"https://doi.org/10.1007/s00220-003-0806-8\">https://doi.org/10.1007/s00220-003-0806-8</a>.","short":"G. Etesi, T. Hausel, Communications in Mathematical Physics 235 (2003) 275–288.","ista":"Etesi G, Hausel T. 2003. On Yang-Mills instantons over multi-centered gravitational instantons. Communications in Mathematical Physics. 235(2), 275–288."},"publication":"Communications in Mathematical Physics","publication_status":"published","title":"On Yang-Mills instantons over multi-centered gravitational instantons","extern":1,"day":"01","_id":"1459","date_updated":"2021-01-12T06:50:53Z","quality_controlled":0,"issue":"2","doi":"10.1007/s00220-003-0806-8","oa":1,"month":"04","date_published":"2003-04-01T00:00:00Z","year":"2003","publist_id":"5740","main_file_link":[{"url":"http://arxiv.org/abs/hep-th/0207196","open_access":"1"}],"status":"public","type":"journal_article"},{"page":"62-70","date_created":"2024-10-15T11:20:53Z","abstract":[{"lang":"eng","text":"We present a novel 3D face recognition approach based on geometric invariants introduced by Elad and Kimmel. The key idea of the proposed algorithm is a representation of the facial surface, invariant to isometric deformations, such as those resulting from different expressions and postures of the face. The obtained geometric invariants allow mapping 2D facial texture images into special images that incorporate the 3D geometry of the face. These signature images are then decomposed into their principal components. The result is an efficient and accurate face recognition algorithm that is robust to facial expressions. We demonstrate the results of our method and compare it to existing 2D and 3D face recognition algorithms."}],"extern":"1","citation":{"mla":"Bronstein, Alex M., et al. “Expression-Invariant 3D Face Recognition.” <i>4th International Conference on Audio- and Video-Based Biometric Person Authentication</i>, vol. 2688, Springer Nature, 2003, pp. 62–70, doi:<a href=\"https://doi.org/10.1007/3-540-44887-x_8\">10.1007/3-540-44887-x_8</a>.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 4th International Conference on Audio- and Video-Based Biometric Person Authentication, Springer Nature, 2003, pp. 62–70.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2003. Expression-invariant 3D face recognition. 4th International Conference on Audio- and Video-Based Biometric Person Authentication. AVBPA: Conference on Audio- and Video-Based Biometric Person Authentication, LNCS, vol. 2688, 62–70.","ama":"Bronstein AM, Bronstein MM, Kimmel R. Expression-invariant 3D face recognition. In: <i>4th International Conference on Audio- and Video-Based Biometric Person Authentication</i>. Vol 2688. Springer Nature; 2003:62-70. doi:<a href=\"https://doi.org/10.1007/3-540-44887-x_8\">10.1007/3-540-44887-x_8</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Expression-Invariant 3D Face Recognition.” In <i>4th International Conference on Audio- and Video-Based Biometric Person Authentication</i>, 2688:62–70. Springer Nature, 2003. <a href=\"https://doi.org/10.1007/3-540-44887-x_8\">https://doi.org/10.1007/3-540-44887-x_8</a>.","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Expression-invariant 3D face recognition,” in <i>4th International Conference on Audio- and Video-Based Biometric Person Authentication</i>, Guildford, United Kingdom, 2003, vol. 2688, pp. 62–70.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2003). Expression-invariant 3D face recognition. In <i>4th International Conference on Audio- and Video-Based Biometric Person Authentication</i> (Vol. 2688, pp. 62–70). Guildford, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-44887-x_8\">https://doi.org/10.1007/3-540-44887-x_8</a>"},"author":[{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Ron","full_name":"Kimmel, Ron","last_name":"Kimmel"}],"title":"Expression-invariant 3D face recognition","oa_version":"None","scopus_import":"1","year":"2003","conference":{"location":"Guildford, United Kingdom","start_date":"2003-06-09","name":"AVBPA: Conference on Audio- and Video-Based Biometric Person Authentication","end_date":"2003-06-11"},"publisher":"Springer Nature","intvolume":"      2688","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783540403029"],"eisbn":["9783540448877"]},"volume":2688,"language":[{"iso":"eng"}],"day":"01","publication":"4th International Conference on Audio- and Video-Based Biometric Person Authentication","publication_status":"published","month":"01","doi":"10.1007/3-540-44887-x_8","date_updated":"2024-10-22T07:20:09Z","quality_controlled":"1","_id":"18324","OA_type":"closed access","date_published":"2003-01-01T00:00:00Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","article_processing_charge":"No","alternative_title":["LNCS"]},{"publisher":"Institute of Electrical and Electronics Engineers","intvolume":"        50","volume":50,"publication_identifier":{"issn":["0018-9499"],"eissn":["1558-1578"]},"day":"30","language":[{"iso":"eng"}],"publication_status":"published","publication":"IEEE Transactions on Nuclear Science","month":"06","doi":"10.1109/tns.2003.812434","issue":"3","_id":"18410","date_updated":"2024-10-22T06:48:53Z","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","type":"journal_article","date_published":"2003-06-30T00:00:00Z","OA_type":"closed access","article_processing_charge":"No","page":"421-426","abstract":[{"text":"The authors consider detection of high-energy photons in positron emission tomography using thick scintillation crystals. Parallax effect and multiple Compton interactions in such crystals significantly reduce the accuracy of conventional detection methods. In order to estimate the photon line of flight based on photomultiplier responses, the authors use asymptotically optimal nonlinear techniques, implemented by feedforward and radial basis function neural networks. Incorporation of information about angles of incidence of photons significantly improves accuracy of estimation. The proposed estimators are fast enough to perform detection, using conventional computers. Monte Carlo simulation results show that their approach significantly outperforms the conventional Anger algorithm.","lang":"eng"}],"date_created":"2024-10-15T11:20:54Z","extern":"1","article_type":"original","title":"Optimal nonlinear line-of-flight estimation in positron emission tomography","citation":{"ieee":"A. M. Bronstein, M. M. Bronstein, M. Zibulevsky, and Y. Y. Zeevi, “Optimal nonlinear line-of-flight estimation in positron emission tomography,” <i>IEEE Transactions on Nuclear Science</i>, vol. 50, no. 3. Institute of Electrical and Electronics Engineers, pp. 421–426, 2003.","apa":"Bronstein, A. M., Bronstein, M. M., Zibulevsky, M., &#38; Zeevi, Y. Y. (2003). Optimal nonlinear line-of-flight estimation in positron emission tomography. <i>IEEE Transactions on Nuclear Science</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tns.2003.812434\">https://doi.org/10.1109/tns.2003.812434</a>","mla":"Bronstein, Alex M., et al. “Optimal Nonlinear Line-of-Flight Estimation in Positron Emission Tomography.” <i>IEEE Transactions on Nuclear Science</i>, vol. 50, no. 3, Institute of Electrical and Electronics Engineers, 2003, pp. 421–26, doi:<a href=\"https://doi.org/10.1109/tns.2003.812434\">10.1109/tns.2003.812434</a>.","ista":"Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. 2003. Optimal nonlinear line-of-flight estimation in positron emission tomography. IEEE Transactions on Nuclear Science. 50(3), 421–426.","short":"A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, Y.Y. Zeevi, IEEE Transactions on Nuclear Science 50 (2003) 421–426.","chicago":"Bronstein, Alex M., M.M. Bronstein, M. Zibulevsky, and Y.Y. Zeevi. “Optimal Nonlinear Line-of-Flight Estimation in Positron Emission Tomography.” <i>IEEE Transactions on Nuclear Science</i>. Institute of Electrical and Electronics Engineers, 2003. <a href=\"https://doi.org/10.1109/tns.2003.812434\">https://doi.org/10.1109/tns.2003.812434</a>.","ama":"Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. Optimal nonlinear line-of-flight estimation in positron emission tomography. <i>IEEE Transactions on Nuclear Science</i>. 2003;50(3):421-426. doi:<a href=\"https://doi.org/10.1109/tns.2003.812434\">10.1109/tns.2003.812434</a>"},"author":[{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"full_name":"Bronstein, M.M.","last_name":"Bronstein","first_name":"M.M."},{"first_name":"M.","last_name":"Zibulevsky","full_name":"Zibulevsky, M."},{"last_name":"Zeevi","full_name":"Zeevi, Y.Y.","first_name":"Y.Y."}],"scopus_import":"1","oa_version":"None","year":"2003"}]