LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 10 of total 116

Search options

  1. Book ; Thesis: Untersuchungen der mimischen Muskulatur im Speziellen des Musculus Occipitofrontalis

    Welter, Laura

    2021  

    Author's details von Laura Welter
    Language German
    Size VI, 62 Blätter, Illustrationen, 31 cm
    Publishing place Dresden
    Publishing country Germany
    Document type Book ; Thesis
    Thesis / German Habilitation thesis Dissertation, Technische Universität Dresden, 2021
    HBZ-ID HT021423553
    Database Catalogue ZB MED Medicine, Health

    More links

    Kategorien

    In stock of ZB MED Cologne/Königswinter

    Shelf markLoan statusLocation
    2022 E 827 order for loan Magazin

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

  2. Article: Human Frontalis Muscle Innervation and Morphology.

    Welter, Laura / Bramke, Silvia / May, Christian Albrecht

    Plastic and reconstructive surgery. Global open

    2022  Volume 10, Issue 3, Page(s) e4200

    Abstract: Due to its clinical importance and due to a suggestion regarding the afferent innervation, the microscopic appearance of the frontalis muscle was investigated.: Methods: From seven human cadavers, serial sections of the frontalis muscle were studied ... ...

    Abstract Due to its clinical importance and due to a suggestion regarding the afferent innervation, the microscopic appearance of the frontalis muscle was investigated.
    Methods: From seven human cadavers, serial sections of the frontalis muscle were studied using light microscopy. Immunhistochemistry was performed using antibodies against collagen XXII and neurofilament.
    Results: The macroscopic appearance of the muscle was in accordance with the literature. At both insertion sides, the muscle fiber endings expressed collagen XXII, a marker for myotendinous junctions, although no tendons were present at the origin side. Neuromuscular junctions were seen in the middle part of the muscle belly (insertion of the nerve fibers of the facialis nerve) and in the cranial part toward the galea aponeurotica (possible afferent fibers?).
    Conclusions: This study summarizes the microscopic appearance of the frontalis muscle. It is a first example that collagen XXII can be expressed even without tendon formation. It confirms the absence of corpuscular afferent neuronal structures within the muscle.
    Language English
    Publishing date 2022-03-18
    Publishing country United States
    Document type Journal Article
    ZDB-ID 2851682-5
    ISSN 2169-7574 ; 2169-7574
    ISSN (online) 2169-7574
    ISSN 2169-7574
    DOI 10.1097/GOX.0000000000004200
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

    In stock of ZB MED Cologne/Königswinter

    Zs.A 7091: Show issues Location:
    Je nach Verfügbarkeit (siehe Angabe bei Bestand)
    bis Jg. 2021: Bestellungen von Artikeln über das Online-Bestellformular
    ab Jg. 2022: Lesesaal (EG)

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

  3. Article ; Online: Phospholipid

    Kleetz, Julia / Welter, Leon / Mizza, Ann-Sophie / Aktas, Meriyem / Narberhaus, Franz

    Applied and environmental microbiology

    2021  Volume 87, Issue 19, Page(s) e0110521

    Abstract: One of the most common pathways for the biosynthesis of the phospholipid phosphatidylcholine (PC) in bacteria is the successive 3- ... ...

    Abstract One of the most common pathways for the biosynthesis of the phospholipid phosphatidylcholine (PC) in bacteria is the successive 3-fold
    MeSH term(s) Bacteria/enzymology ; Bacteria/genetics ; Methylation ; Phosphatidyl-N-Methylethanolamine N-Methyltransferase/genetics ; Phosphatidyl-N-Methylethanolamine N-Methyltransferase/metabolism ; Phosphatidylethanolamines/metabolism
    Chemical Substances Phosphatidylethanolamines ; Phosphatidyl-N-Methylethanolamine N-Methyltransferase (EC 2.1.1.71)
    Language English
    Publishing date 2021-09-10
    Publishing country United States
    Document type Journal Article ; Research Support, Non-U.S. Gov't
    ZDB-ID 223011-2
    ISSN 1098-5336 ; 0099-2240
    ISSN (online) 1098-5336
    ISSN 0099-2240
    DOI 10.1128/AEM.01105-21
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

    In stock of ZB MED Cologne/Königswinter

    Zs.B 201: Show issues Location:
    Je nach Verfügbarkeit (siehe Angabe bei Bestand)
    bis Jg. 2021: Bestellungen von Artikeln über das Online-Bestellformular
    ab Jg. 2022: Lesesaal (EG)

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

  4. Book ; Online: Achievable Rates of Concatenated Codes in DNA Storage under Substitution Errors

    Lenz, Andreas / Welter, Lorenz / Puchinger, Sven

    2020  

    Abstract: In this paper, we study achievable rates of concatenated coding schemes over a deoxyribonucleic acid (DNA) storage channel. Our channel model incorporates the main features of DNA-based data storage. First, information is stored on many, short DNA ... ...

    Abstract In this paper, we study achievable rates of concatenated coding schemes over a deoxyribonucleic acid (DNA) storage channel. Our channel model incorporates the main features of DNA-based data storage. First, information is stored on many, short DNA strands. Second, the strands are stored in an unordered fashion inside the storage medium and each strand is replicated many times. Third, the data is accessed in an uncontrollable manner, i.e., random strands are drawn from the medium and received, possibly with errors. As one of our results, we show that there is a significant gap between the channel capacity and the achievable rate of a standard concatenated code in which one strand corresponds to an inner block. This is in fact surprising as for other channels, such as $q$-ary symmetric channels, concatenated codes are known to achieve the capacity. We further propose a modified concatenated coding scheme by combining several strands into one inner block, which allows to narrow the gap and achieve rates that are close to the capacity.

    Comment: Extended version of a paper submitted to International Symposium on Information Theory and Its Applications (ISITA) 2020
    Keywords Computer Science - Information Theory
    Subject code 003
    Publishing date 2020-04-30
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  5. Book ; Online: Feedback Insertion-Deletion Codes

    Maringer, Georg / Polyanskii, Nikita / Vorobyev, Ilya / Welter, Lorenz

    2020  

    Abstract: In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that we can transmit $n$ binary symbols one-by-one over the channel, in which some symbols can be deleted and ... ...

    Abstract In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that we can transmit $n$ binary symbols one-by-one over the channel, in which some symbols can be deleted and some additional symbols can be inserted. After each transmission, the encoder is notified about the insertions or deletions that have occurred within the previous transmission and the encoding strategy can be adapted accordingly. The goal is to design an encoder which is able to transmit as much information as possible under the assumption that the total number of deletions and insertions is limited by $\tau n$, $0<\tau<1$. We show how this problem can be reduced to the problem of transmitting messages over the substitution channel. Thereby, the maximal asymptotic rate of feedback insertion-deletion codes is completely established. For the substitution channel with random errors, an optimal algorithm with a nice intuition behind it was presented in 1963 by Horstein. However, the analysis of this algorithm for the adversarial substitution channel is quite complicated and was completed only 13 years later by Zigangirov. We revisit Zigangirov's result and present a more elaborate version of his proof.

    Comment: 34 pages, 9 figures
    Keywords Computer Science - Information Theory ; Computer Science - Discrete Mathematics
    Subject code 003
    Publishing date 2020-10-29
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  6. Book ; Online: Multiple Criss-Cross Deletion-Correcting Codes

    Welter, Lorenz / Bitar, Rawad / Wachter-Zeh, Antonia / Yaakobi, Eitan

    2021  

    Abstract: This paper investigates the problem of correcting multiple criss-cross deletions in arrays. More precisely, we study the unique recovery of $n \times n$ arrays affected by any combination of $t_\mathrm{r}$ row and $t_\mathrm{c}$ column deletions such ... ...

    Abstract This paper investigates the problem of correcting multiple criss-cross deletions in arrays. More precisely, we study the unique recovery of $n \times n$ arrays affected by any combination of $t_\mathrm{r}$ row and $t_\mathrm{c}$ column deletions such that $t_\mathrm{r} + t_\mathrm{c} = t$ for a given $t$. We refer to these type of deletions as $t$-criss-cross deletions. We show that a code capable of correcting $t$-criss-cross deletions has redundancy at least $tn + t \log n - \log(t!)$. Then, we present an existential construction of a code capable of correcting $t$-criss-cross deletions where its redundancy is bounded from above by $tn + \mathcal{O}(t^2 \log^2 n)$. The main ingredients of the presented code are systematic binary $t$-deletion correcting codes and Gabidulin codes. The first ingredient helps locating the indices of the deleted rows and columns, thus transforming the deletion-correction problem into an erasure-correction problem which is then solved using the second ingredient.
    Keywords Computer Science - Information Theory
    Subject code 005
    Publishing date 2021-02-04
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  7. Article ; Online: Reaction of PIWI cultivars and selections to Ripe rot during grape physiological maturation in south of Brazil

    Hilha, Andressa / Modesto, Lenon / Brighenti, Alberto / De Souza, André / Welter, Leocir / Nodari, Rubens Onofre

    2022  

    Keywords Text ; abstract_or_summary ; ddc:630 ; Coletotrichum spp ; disease resistance ; Ripe rot of grape ; grapevine ; Vitis vinifera
    Language English
    Publisher Julius Kühn-Institut
    Publishing country de
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  8. Book ; Audio / Video ; Online: Reaction of PIWI cultivars and selections to ripe rot during grape physiological maturation in south of Brazil

    Hilha, Andressa / Modesto, Lenon / Brighenti, Alberto / de Souza, André / Welter, Leocir / Nodari, Rubens Onofre

    2022  

    Keywords Text ; ddc:630
    Language English
    Publisher Julius Kühn-Institute, Germany
    Publishing country de
    Document type Book ; Audio / Video ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  9. Book ; Online: Equivalence of Insertion/Deletion Correcting Codes for $d$-dimensional Arrays

    Stylianou, Evagoras / Welter, Lorenz / Bitar, Rawad / Wachter-Zeh, Antonia / Yaakobi, Eitan

    2022  

    Abstract: We consider the problem of correcting insertion and deletion errors in the $d$-dimensional space. This problem is well understood for vectors (one-dimensional space) and was recently studied for arrays (two-dimensional space). For vectors and arrays, the ...

    Abstract We consider the problem of correcting insertion and deletion errors in the $d$-dimensional space. This problem is well understood for vectors (one-dimensional space) and was recently studied for arrays (two-dimensional space). For vectors and arrays, the problem is motivated by several practical applications such as DNA-based storage and racetrack memories. From a theoretical perspective, it is interesting to know whether the same properties of insertion/deletion correcting codes generalize to the $d$-dimensional space. In this work, we show that the equivalence between insertion and deletion correcting codes generalizes to the $d$-dimensional space. As a particular result, we show the following missing equivalence for arrays: a code that can correct $t_\mathrm{r}$ and $t_\mathrm{c}$ row/column deletions can correct any combination of $t_\mathrm{r}^{\mathrm{ins}}+t_\mathrm{r}^{\mathrm{del}}=t_\mathrm{r}$ and $t_\mathrm{c}^{\mathrm{ins}}+t_\mathrm{c}^{\mathrm{del}}=t_\mathrm{c}$ row/column insertions and deletions. The fundamental limit on the redundancy and a construction of insertion/deletion correcting codes in the $d$-dimensional space remain open for future work.

    Comment: Accepted to IEEE International Symposium on Information Theory 2022
    Keywords Computer Science - Information Theory
    Subject code 005
    Publishing date 2022-08-10
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  10. Book ; Online: Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel

    Welter, Lorenz / Maarouf, Issam / Lenz, Andreas / Wachter-Zeh, Antonia / Rosnes, Eirik / Amat, Alexandre Graell i

    2022  

    Abstract: We consider error-correcting coding for DNA-based storage. We model the DNA storage channel as a multi-draw IDS channel where the input data is chunked into $M$ short DNA strands, which are copied a random number of times, and the channel outputs a ... ...

    Abstract We consider error-correcting coding for DNA-based storage. We model the DNA storage channel as a multi-draw IDS channel where the input data is chunked into $M$ short DNA strands, which are copied a random number of times, and the channel outputs a random selection of $N$ noisy DNA strands. The retrieved DNA strands are prone to insertion, deletion, and substitution (IDS) errors. We propose an index-based concatenated coding scheme consisting of the concatenation of an outer code, an index code, and an inner synchronization code, where the latter two tackle IDS errors. We further propose a mismatched joint index-synchronization code maximum a posteriori probability decoder with optional clustering to infer symbolwise a posterior probabilities for the outer decoder. We compute achievable information rates for the outer code and present Monte-Carlo simulations for information-outage probabilities and frame error rates on synthetic and experimental data, respectively.

    Comment: accepted to IEEE Information Theory Workshop (ITW) 2023
    Keywords Computer Science - Information Theory
    Subject code 003 ; 612
    Publishing date 2022-12-20
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

To top