Log in

Relevant bibliographies by topics / Labelling / Journal articles

Journal articles on the topic 'Labelling'

To see the other types of publications on this topic, follow the link: Labelling.

Author: Grafiati

Published: 4 June 2021

Last updated: 18 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Labelling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Farhan, Muhammad, Henning Koehler, Robert Ohms, and Qing Wang. "Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks." Proceedings of the ACM on Management of Data 1, no. 4 (December 8, 2023): 1–25. http://dx.doi.org/10.1145/3626731.

Full text

Abstract:

Answering the shortest-path distance between two arbitrary locations is a fundamental problem in road networks. Labelling-based solutions are the current state-of-the-arts to render fast response time, which can generally be categorised into hub-based labellings, highway-based labellings, and tree decomposition labellings. Hub-based and highway-based labellings exploit hierarchical structures of road networks with the aim to reduce labelling size for improving query efficiency. However, these solutions still result in large search spaces on distance labels at query time, particularly when road networks are large. Tree decomposition labellings leverage a hierarchy of vertices to reduce search spaces over distance labels at query time, but such a hierarchy is generated using tree decomposition techniques, which may yield very large labelling sizes and slow querying. In this paper, we propose a novel solution hierarchical cut 2-hop labelling (HC2L) to address the drawbacks of the existing works. Our solution combines the benefits of hierarchical structures from both perspectives - reduce the size of a distance labelling at preprocessing time and further reduce the search space on a distance labelling at query time. At its core, we propose a new hierarchy, balanced tree hierarchy, which enables a fast, efficient data structure to reduce the size of distance labelling and to select a very small subset of labels to compute the shortest-path distance at query time. To speed up the construction process of HC2L, we further propose a parallel variant of our method, namely HC2L^p. We have evaluated our solution on 10 large real-world road networks through extensive experiments. The results show that our method is 1.5-4 times faster in terms of query processing while being comparable in terms of labelling construction time and achieving up to 60% smaller labelling size compared to the state-of-the-art approaches.

APA, Harvard, Vancouver, ISO, and other styles

2

Semenyuta, Marina F. "FIBONACCI AND SUPER FIBONACCI GRACEFUL LABELLINGS OF SOME TYPES OF GRAPHS." Journal of Automation and Information sciences 1 (January 1, 2021): 105–21. http://dx.doi.org/10.34229/0572-2691-2021-1-10.

Full text

Abstract:

We consider the basic theoretical information regarding the Fibonacci graceful graphs. An injective function is said a Fibonacci graceful labelling of a graph of a size , if it induces a bijective function on the set of edges , where by the rule , for any adjacent vertices A graph that allows such labelling is called Fibonacci graceful. In this paper, we introduce the concept of super Fibonacci graceful labelling, narrowing the set of vertex labels, i.e. Four types of problems to be studied are selected. In the problem of the first type, the following question is raised: is there a graph that allows a certain kind of labelling, and under what conditions does this take place? The problem of the second type is the problem of construction: it is necessary, for a given system of requirements for the graph, to construct (at least one) its labelling that would satisfy this system. The following two types of problems relate to enumeration problems: for a given graph, determine the number of different Fibonacci and / or super Fibonacci graceful labellings; build all the different labellings of a given kind. As a result of solving these problems, functions were found that generate Fibonacci and super Fibonacci graceful labellings for graphs of cyclic structure; necessary and sufficient conditions for the existence of Fibonacci graceful labelling for disjunctive union of cycles, super Fibonacci graceful labelling for cycles, Eulerian graphs are obtained; the number of non-equivalent labellings of the cycle is determined; conditions for the existence of a super Fibonacci graceful labelling of a one-point connection of arbitrary connected super Fibonacci graceful graphs … …, are presented

APA, Harvard, Vancouver, ISO, and other styles

3

Su, Jing, Hongyu Wang, and Bing Yao. "On Elegant Labelling and Magic Labelling of Large-Scale Graphs." Discrete Dynamics in Nature and Society 2022 (March 28, 2022): 1–10. http://dx.doi.org/10.1155/2022/6301674.

Full text

Abstract:

In this paper, we deduce the equivalence relationship among strongly c-elegant labelling, super-edge magic total labelling, edge antimagic total labelling, and super t , 1 -magical labelling. We study some properties of the graph with a strongly c-elegant labelling. On the basis of small-scale graphs with strongly c-elegant labelling, several types of large-scale graphs are constructed through graph operations, and we further prove the existence of their strongly c-elegant labelling. In addition, we also define a transformation of strongly c-elegant labelling, which provides a method for the transformation between several strongly c-elegant labellings of a graph.

APA, Harvard, Vancouver, ISO, and other styles

4

RIZVI, SYED TAHIR RAZA, MADIHA KHALID, KASHIF ALI, MIRKA MILLER, and JOE RYAN. "ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS." Bulletin of the Australian Mathematical Society 92, no. 1 (May 5, 2015): 11–18. http://dx.doi.org/10.1017/s0004972715000325.

Full text

Abstract:

Lladó and Moragas [‘Cycle-magic graphs’, Discrete Math.307 (2007), 2925–2933] showed the cyclic-magic and cyclic-supermagic behaviour of several classes of connected graphs. They discussed cycle-magic labellings of subdivided wheels and friendship graphs, but there are no further results on cycle-magic labellings of other families of subdivided graphs. In this paper, we find cycle-magic labellings for subdivided graphs. We show that if a graph has a cycle-(super)magic labelling, then its uniform subdivided graph also has a cycle-(super)magic labelling. We also discuss some cycle-supermagic labellings for nonuniform subdivided fans and triangular ladders.

APA, Harvard, Vancouver, ISO, and other styles

5

McCarthy, Brian J., and Brian C. Burdett. "Eco-labelling and textile eco-labelling." Review of Progress in Coloration and Related Topics 28, no. 1 (October 23, 2008): 61–70. http://dx.doi.org/10.1111/j.1478-4408.1998.tb00119.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sapunov, Seregy. "Collectives of automata on infinite grid graph with deterministic vertex labeling." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 33 (December 27, 2019): 170–87. http://dx.doi.org/10.37069/1683-4720-2019-33-14.

Full text

Abstract:

Automata walking on graphs are a mathematical formalization of autonomous mobile agents with limited memory operating in discrete environments. Under this model broad area of studies of the behaviour of automata in finite and infinite labyrinths (a labyrinth is an embedded directed graph of special form) arose and intensively developing. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. Automata operating in labyrinths can distinguish directions, that is, they have a compass. This paper examines vertex labellings of infinite square grid graph thanks to these labellings a finite automaton without a compass can walk along graph in any arbitrary direction. The automaton looking over neighbourhood of the current vertex and may move to some neighbouring vertex selected by its label. We propose a minimal deterministic traversable vertex labelling that satisfies the required property. A labelling is said to be deterministic if all vertices in closed neighbourhood of every vertex have different labels. It is shown that minimal deterministic traversable vertex labelling of square grid graph uses labels of five different types. Minimal deterministic traversable labelling of subgraphs of infinite square grid graph whose degrees are less than four are developed. The key problem for automata and labyrinths is the problem of constructing a finite automaton that traverse a given class of labyrinths. We say that automaton traverse infinite graph if it visits any randomly selected vertex of this graph in a finite time. It is proved that a collective of one automaton and three pebbles can traverse infinite square grid graph with deterministic labelling and any collective with fewer pebbles cannot. We consider pebbles as automata of the simplest form, whose positions are completely determined by the remaining automata of the collective. The results regarding to exploration of an infinite deterministic square grid graph coincide with the results of A.V. Andzhan (Andzans) regarding to traversal of an infinite mosaic labyrinth without holes. It follows from above that infinite grid graph after constructing a minimal traversable deterministic labelling on it and fixing two pairs of opposite directions on it becomes an analogue of an infinite mosaic labyrinth without holes.

APA, Harvard, Vancouver, ISO, and other styles

7

Sapunov, Sergiy. "Experiments on Recognition of Infinite Grid Graph Labelling." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 35 (October 25, 2021): 67–78. http://dx.doi.org/10.37069/1683-4720-2021-35-6.

Full text

Abstract:

In recent years, topics related to automaton analysis of geometric environment have attracted widespread attention. The interaction of an automaton and an environment is often represented as a process of an automaton walks along a graph (labyrinth) of environment. Treating environment as vertex-labelled graph was suggested as one approach to addressing the problem of automaton analysis of environment properties. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. This paper considers a four-way infinite lattice graph as a model of an environment for a graph-walking automaton. All vertices of this graph are labelled with labels from a known set but concrete labelling function is not a priori known. The automaton looking over neighbourhood of the current vertex and may travel to some neighbouring vertex selected by its label. The objective of the automaton is to determine two pairs of opposite directions on the aforementioned graph embedded onto integer lattice, i.e. recognizing the graph labelling. In previous work we have proposed a labelling thanks to which a finite automaton can walk on graph in any arbitrary direction. We have called this labelling deterministic. We have proved that minimal deterministic vertex labelling of infinite lattice graph uses labels of five different types. The paper demonstrates that there exists 240 different minimal deterministic labellings of the infinite lattice graph with a fixed set of labels. We prove that a single automaton cannot recognize minimal deterministic labelling of the infinite lattice graph, but automaton with one pebble can. The novelty associated with this paper is a new type of experiment with vertex labelled graphs designed to recognition their labelling. The method of constructing and performing recognition experiment for labelled infinite grid graph is proposed.

APA, Harvard, Vancouver, ISO, and other styles

8

Weinrich, Ramona, and Achim Spiller. "Developing food labelling strategies: Multi-level labelling." Journal of Cleaner Production 137 (November 2016): 1138–48. http://dx.doi.org/10.1016/j.jclepro.2016.07.156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Baroni, Pietro, and Regis Riveret. "Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems." Journal of Artificial Intelligence Research 66 (November 30, 2019): 793–860. http://dx.doi.org/10.1613/jair.1.11428.

Full text

Abstract:

In computational models of argumentation, the justification of statements has drawn less attention than the construction and justification of arguments. Significant losses of sensitivity or expressibility on statement statuses can be incurred by otherwise appealing formalisms. In order to reappraise statement statuses and, more generally, to support a uniform modelling of different phases of the argumentation process we introduce multi-labelling systems, a generic formalism devoted to represent reasoning processes consisting of a sequence of labelling stages. In the argumentation context, two families of multi-labelling systens, called argument-focused and statement-focused approach are identified and compared. Then they are shown to be able to encompass several prominent literature proposals as special cases, thereby enabling a systematic comparison evidencing their merits and limits. Further, we show that the proposed model supports tunability of statement justification by specifying a few alternative statement justification labellings, and we illustrate how they can be seamlessly integrated into different formalisms.

APA, Harvard, Vancouver, ISO, and other styles

10

Afzal, Hafiz Usman, Muhammad Javaid, Abdulaziz Mohammed Alanazi, and Maryam Gharamah Alshehri. "Computing Edge Weights of Symmetric Classes of Networks." Mathematical Problems in Engineering 2021 (March 19, 2021): 1–22. http://dx.doi.org/10.1155/2021/5562544.

Full text

Abstract:

Accessibility, robustness, and connectivity are the salient structural properties of networks. The labelling of networks with numeric numbers using the parameters of edge or vertex weights plays an eminent role in the study of the aforesaid properties. The systems interlinked in a network are transformed into a graphical network, and specific numeric labels assigned to the converted network under certain rules assist us in the regulation of data traffic, bandwidth, and coding/decoding of signals. Two major classes of such network labellings are magic and antimagic. The notion of super a , 0 edge-antimagic labelling on networks was identified in the late nineties. The present article addresses super a , 0 edge antimagicness of union of the networks’ star S n , the path P n , and copies of paths and the rooted product of cycle C n with K 2 , m . We also provide super a , 0 edge-antimagic labelling of the rooted product of cycle C n and planar pancyclic networks. Further, we design a super a , 0 edge-antimagic labelling on a pancyclic network containing chains of C 6 and three different symmetrically designed lattices. Moreover, our findings have also been recapitulated in the shape of 3- D plots and tables.

APA, Harvard, Vancouver, ISO, and other styles

11

Lalor, Daniel. "Medicines labelling." Australian Prescriber 34, no. 5 (October 1, 2011): 136–38. http://dx.doi.org/10.18773/austprescr.2011.072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Herreen, Paul, John Jackson, and Daniel Lalor. "Medicines labelling." Australian Prescriber 35, no. 2 (April 1, 2012): 39–42. http://dx.doi.org/10.18773/austprescr.2012.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Kelly, John P. "Labelling Authors." Chesterton Review 16, no. 2 (1990): 140. http://dx.doi.org/10.5840/chesterton199016251.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Rourke, Anne. "Professional labelling." Nursing Standard 4, no. 42 (July 11, 1990): 36–39. http://dx.doi.org/10.7748/ns.4.42.36.s47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Hågvar, Yngve Benestad. "Labelling Journalism." Nordicom Review 33, no. 2 (December 1, 2012): 27–42. http://dx.doi.org/10.2478/nor-2013-0012.

Full text

Abstract:

Abstract The present article explains why it is important to consider newspapers’ formats and content sections in discourse analyses. It performs a comparative analysis of the choice and naming of content sections in the print and online editions of three major Norwegian newspapers published in 2010. The concept of paratexts is stressed and used as an analytical tool through a four-dimensional framework. The analysis shows that sections that appear across paper brands and platforms refer quite conventionally to specific topics and genres, whereas sections that appear solely online rather tend to highlight social functions, social roles and social actors. Through their paratexts, the online-specific sections answer questions of who and why instead of what. In this sense, there seems to be a discursive development in the principles underlying text classification and navigation, turning towards a more dialogical and person-oriented discourse online.

APA, Harvard, Vancouver, ISO, and other styles

16

Creanor, S., and D. Conway. "Food labelling." British Dental Journal 199, no. 4 (August 2005): 188. http://dx.doi.org/10.1038/sj.bdj.4812659.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Staddon, Patsy. "Labelling Out." Journal of Lesbian Studies 9, no. 3 (September 27, 2005): 69–78. http://dx.doi.org/10.1300/j155v09n03_07.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Harries, Judith. "Positive labelling." Practical Pre-School 2016, Sup182 (March 2016): 9–10. http://dx.doi.org/10.12968/prps.2016.sup182.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Jones, Lyn H., and Eranthie Weerapana. "Protein labelling." Molecular BioSystems 12, no. 6 (2016): 1725–27. http://dx.doi.org/10.1039/c6mb90019d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Stockman, M. "Fur labelling." Veterinary Record 123, no. 9 (August 27, 1988): 236. http://dx.doi.org/10.1136/vr.123.9.236-b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Horton, Brendan. "Labelling techniques." Nature 382, no. 6589 (July 1996): 377–78. http://dx.doi.org/10.1038/382377a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Birch, Arthur J. "Labelling business." Nature 333, no. 6173 (June 1988): 510. http://dx.doi.org/10.1038/333510a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Smart, N. "Misleading labelling." Veterinary Record 125, no. 8 (August 19, 1989): 214. http://dx.doi.org/10.1136/vr.125.8.214-a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Nunn, D. S., and W. L. M. Baird. "Ampoule labelling." Anaesthesia 51, no. 1 (January 1996): 1–2. http://dx.doi.org/10.1111/j.1365-2044.1996.tb07644.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Graydon, Oliver. "Labelling worries." Nature Photonics 11, no. 7 (July 2017): 402. http://dx.doi.org/10.1038/nphoton.2017.110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Shannon, Bill. "Nutrition Labelling." British Food Journal 96, no. 4 (May 1994): 40–44. http://dx.doi.org/10.1108/00070709410061087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Lee, E. "Syringe labelling." Anaesthesia 58, no. 9 (August 1, 2003): 911. http://dx.doi.org/10.1046/j.1365-2044.2003.03362_1.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gershon, Diane. "Labelling technology." Nature 346, no. 6281 (July 1990): 298–300. http://dx.doi.org/10.1038/346298a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Wheelock, J. Verner, and Ann Freckleton. "Nutritional Labelling." Journal of the Institute of Health Education 23, no. 3 (January 1985): 99–110. http://dx.doi.org/10.1080/03073289.1985.10805591.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Strudwick, R. M. "Labelling patients." Radiography 22, no. 1 (February 2016): 50–55. http://dx.doi.org/10.1016/j.radi.2015.05.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Walker, D. M. "FOOD LABELLING." Lancet 327, no. 8480 (March 1986): 561. http://dx.doi.org/10.1016/s0140-6736(86)90919-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

MCKELVEY, DEREK. "Care labelling." Journal of the Society of Dyers and Colourists 114, no. 11 (October 22, 2008): 341. http://dx.doi.org/10.1111/j.1478-4408.1998.tb01933.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

MOORE, B. F. "Care labelling." Journal of the Society of Dyers and Colourists 114, no. 4 (October 22, 2008): 134. http://dx.doi.org/10.1111/j.1478-4408.1998.tb01966.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Dain, Steven. "Drug labelling." Canadian Journal of Anaesthesia 41, no. 8 (August 1994): 755. http://dx.doi.org/10.1007/bf03015635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Al-Khshemawee, Hasan, Manjree Agarwal, and Yonglin Ren. "Stable isotope labelling of Ceratitis capitata." Plant Protection Science 55, No. 1 (November 20, 2018): 54–60. http://dx.doi.org/10.17221/13/2018-pps.

Full text

Abstract:

The use of stable isotopes to label an insect species, the Mediterranean fruit fly Ceratitis capitata (Diptera: Tephidae) (medfly) was investigated. Labelling allows mating and life history characteristics to be investigated experimentally. <sup>13</sup>C<sub>6</sub>-glucose was incorporated into the diet of medflies at various stages of development by adding it to larval media or providing adults with sugar water. Data was collected from egg hatching until the death of adults. The results show that stable isotopes successfully labelled medflies in laboratory conditions. There were significant differences between labelled and unlabelled treatments in terms of eggs hatching rates, larval development, pupae emergence, adult survival, and mating behaviour. Labelling during larval development, and combined labelling at the larval and adult stages, resulted in detectable values. Labelling in the larval stage had no effect on mating behaviour, but that in the adult stage did. This study demonstrates that it is possible to label adult medflies and to detect the label after mating.

APA, Harvard, Vancouver, ISO, and other styles

36

Ben Youssef, Adel, and Rim Lahmandi-Ayed. "Eco-labelling, Competition and Environment: Endogenization of Labelling Criteria." Environmental and Resource Economics 41, no. 2 (December 16, 2007): 133–54. http://dx.doi.org/10.1007/s10640-007-9184-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Zurzolo, Giovanni A., Michael L. Mathai, Jennifer J. Koplin, and Katrina J. Allen. "Precautionary allergen labelling following new labelling practice in Australia." Journal of Paediatrics and Child Health 49, no. 4 (March 13, 2013): E306—E310. http://dx.doi.org/10.1111/jpc.12138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Brankov, Vladimir, Dragos Cvetkovic, Slobodan Simic, and Dragan Stevanovic. "Simultaneous editing and multilabelling of graphs in system newGraph." Publikacije Elektrotehnickog fakulteta - serija: matematika, no. 17 (2006): 112–21. http://dx.doi.org/10.2298/petf0617112b.

Full text

Abstract:

In our research in spectral graph theory we often encounter the need for the simultaneous editing of two or more interdependent graphs (e.g. a graph and its line graph), together with multiple labellings of their vertices and edges. Occasionally, labellings are of such kind that it could be beneficial to permit the user to modify the labelling and test whether it still satisfies a given property. Here we develop a methodology for treating such situations, which is implemented in system newGRAPH.

APA, Harvard, Vancouver, ISO, and other styles

39

Kaur, Ravneet, Parul Gupta, Vandana Agarwal, and Anee Mathur. "KI-67 LABELLING INDEX IN UROTHELIAL NEOPLASM." Era's Journal of Medical Research 10, no. 01 (June 2023): 13–18. http://dx.doi.org/10.24041/ejmr2023.2.

Full text

Abstract:

Urothelial neoplasms can be classified as non-invasive & invasive lesions. The major prognostic factors are degree of differentiation and depth of invasion in urothelial tumors. Ki-67 is a non- histone nuclear protein marker of cell proliferation which is encoded by MKi-67 gene in humans. This study evaluates and correlate immunohistochemical Ki-67 expression in Non-invasive & Invasive urothelial neoplasm. This retrospective study is done in the Department of Pathology of L.N. Medical College and J.K. Hospital, Bhopal. Urothelial Neoplasm cases diagnosed from January 2019 to January 2022 were included, & relevant clinico-pathological data and their Ki-67 Labelling Index was evaluated & correlated. Total 60 cases were studied, 30 had invasive carcinoma whereas, 30 had non-invasive neoplasm. Ki-67 expression (>13%) was seen maximum in invasive cancers i.e 40% cases, whereas (<13%) was seen maximum in non-invasive neoplasms i.e 38.3%. A statistically significant expression of Mean Ki-67 Labelling Index was observed that increased from papilloma to PUNLMP, Non- Invasive urothelial neoplasm Low grade & High grade in non-invasive urothelial neoplasm (p<0.001), and from lamina propria invasive to muscle invasive urothelial cancers (p=0.013). A Higher tumor proliferation of greater than 13% was significantly related to greater tumor size (p=0.04). Ki-67 labelling index being a measure of tumor proliferation is related to tumor histological grade. Large urothelial tumor size was associated to high Ki-67 LI and was not strongly associated with age and gender. Therefore Ki-67 expression can be used as Diagnostic & Prognostic marker in urothelial tumors.

APA, Harvard, Vancouver, ISO, and other styles

40

&NA;. "'Genotropin' labelling updated." Inpharma Weekly &NA;, no. 1398 (August 2003): 21. http://dx.doi.org/10.2165/00128413-200313980-00050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

&NA;. "Pemoline labelling updated." Reactions Weekly &NA;, no. 757 (June 1999): 4. http://dx.doi.org/10.2165/00128415-199907570-00007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

&NA;. "Haloperidol labelling updated." Reactions Weekly &NA;, no. 1170 (September 2007): 2. http://dx.doi.org/10.2165/00128415-200711700-00004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

&NA;. "Gleevec labelling updated." Reactions Weekly &NA;, no. 1125 (October 2006): 3. http://dx.doi.org/10.2165/00128415-200611250-00005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

&NA;. "Rocephin labelling updated." Reactions Weekly &NA;, no. 1160 (July 2007): 2. http://dx.doi.org/10.2165/00128415-200711600-00004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Wilson,, John T., Gregory L. Kearns,, Dianne Murphy, and Sumner J. Yaffe. "Paediatric Labelling Requirements." Clinical Pharmacokinetics 26, no. 4 (April 1994): 308–25. http://dx.doi.org/10.2165/00003088-199426040-00006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

&NA;. "Abacavir labelling strengthened." Reactions Weekly &NA;, no. 787 (February 2000): 2. http://dx.doi.org/10.2165/00128415-200007870-00001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

&NA;. "Capecitabine labelling updated." Reactions Weekly &NA;, no. 831 (December 2000): 4. http://dx.doi.org/10.2165/00128415-200008310-00005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

&NA;. "Misoprostol labelling changes." Reactions Weekly &NA;, no. 899 (April 2002): 3. http://dx.doi.org/10.2165/00128415-200208990-00004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

&NA;. "'Genotropin' labelling updated." Reactions Weekly &NA;, no. 962 (August 2003): 2. http://dx.doi.org/10.2165/00128415-200309620-00002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

&NA;. "Tamoxifen's labelling revised." Reactions Weekly &NA;, no. 498 (April 1994): 2. http://dx.doi.org/10.2165/00128415-199404980-00003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!