AI & ChatGPT searches , social queriess for STRING GRAPH
Search references for STRING GRAPH. Phrases containing STRING GRAPH
See searches and references containing STRING GRAPH!
Search references for STRING GRAPH. Phrases containing STRING GRAPH
See searches and references containing STRING GRAPH!STRING GRAPH
Intersection graph for curves in the plane
graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". Given a graph G, G is a string graph if
String_graph
Subgraph with contracted edges
study string graphs, the intersection graphs of plane curves, because every induced minor of a string graph is another string graph. The string graphs provide
Graph_minor
Graph representing intersections between given sets
In graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph can be represented as an
Intersection_graph
Type of knowledge base
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used
Knowledge_graph
Creating a new graph from an existing graph
computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It
Graph_rewriting
total path length spanning tree Slope number two testing Recognizing string graphs Subgraph isomorphism problem Treewidth Testing whether a tree may be
List_of_NP-complete_problems
Data query language developed by Facebook
brackets (for example, authors: [String]). type Query { currentUser: User } type User { id: ID! name: String! } A GraphQL query defines the exact shape
GraphQL
Split graph String graph Strongly regular graph Threshold graph Total graph Tree (graph theory). Trellis (graph) Turán graph Ultrahomogeneous graph Vertex-transitive
List_of_graph_theory_topics
Graph linking pairs of comparable elements in a partial order
graphs are a subclass of string graphs; the complement of every comparability graph is a string graph. Every complete graph is a comparability graph,
Comparability_graph
Database using graph structures for queries
A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key
Graph_database
Directed graph representing dependencies
mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other
Dependency_graph
Measure of similarity between two graphs
between two graphs is related to the string edit distance between strings. With the interpretation of strings as connected, directed acyclic graphs of maximum
Graph_edit_distance
Theory of subatomic structure
In physics, string theory is a theoretical framework in which the point-like particles of particle physics are replaced by one-dimensional objects called
String_theory
Data structure representing a finite set of strings
form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or
Deterministic acyclic finite state automaton
Deterministic_acyclic_finite_state_automaton
Intersection graph of a chord diagram
In graph theory, a circle graph is the intersection graph of a chord diagram. That is, it is an undirected graph whose vertices can be associated with
Circle_graph
Sequence of characters, data type
These are given in the article on string operations. Strings admit the following interpretation as nodes on a graph, where k {\displaystyle k} is the
String_(computer_science)
Graphical representation of a morphism
string diagrams more widespread. The existential graphs and diagrammatic reasoning of Charles Sanders Peirce are arguably the oldest form of string diagrams
String_diagram
String-searching algorithm
In computer science, the Aho–Corasick algorithm is a string-searching algorithm invented by Alfred V. Aho and Margaret J. Corasick in 1975. It is a kind
Aho–Corasick_algorithm
Structure on sequences of digits 1 and 2
Young–Fibonacci graph is an infinite graph, with a vertex for each string of the digits "1" and "2" (including the empty string). The neighbors of a string s are
Young–Fibonacci_lattice
Task of computing complete subgraphs
a valid proof string, one that is accepted by all runs of the checker, and this string will correspond to a large clique in the graph. However, if the
Clique_problem
Topics referred to by the same term
noodle dish String graph, an intersection graph of curves in the plane; each curve is called a "string" String group, in group theory STRING (Search Tool
String_(disambiguation)
Graph formed by adding isolated or universal vertices
In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations:
Threshold_graph
2023 edition of the SQL standard
into three main areas: Property graph queries, a graph query language built on top of SQL The new part 16, “Property Graph Queries (SQL/PGQ)”, has been added
SQL:2023
Algorithm used in data compression
Durbin, Richard (2010-06-15). "Efficient construction of an assembly string graph using the FM-index". Bioinformatics. 26 (12): i367–i373. doi:10
Burrows–Wheeler_transform
Compressed full-text substring index
Durbin, Richard (2010-06-15). "Efficient construction of an assembly string graph using the FM-index". Bioinformatics. 26 (12): i367–i373. doi:10
FM-index
Task in computational graph theory
In graph theory, a branch of mathematics, graph canonization is the problem of finding a canonical form of a given graph G. A canonical form is a labeled
Graph_canonization
Measure of distance in physical space
the sphere. In an unweighted graph, the length of a cycle, path, or walk is the number of edges it uses. In a weighted graph, it may instead be the sum
Length
In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and
Topological_graph
Problem of finding similarity between graphs
Graph matching is the problem of finding a similarity between graphs. Graphs are commonly used to encode structural information in many fields, including
Graph_matching
Subdivision of vertices into disjoint sets
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges
Graph_partition
Open-source data analytics cluster computing framework
Malak, Michael (14 June 2016). "Finding Graph Isomorphisms In GraphX And GraphFrames: Graph Processing vs. Graph Database". slideshare.net. sparksummit
Apache_Spark
Declarative graph query language
Cypher is a declarative graph query language that allows for expressive and efficient data querying in a property graph. Cypher was largely an invention
Cypher_(query_language)
2018 mathematics book by Marcus Schaefer
number k such that the graph can be drawn with at most k crossings per edge. Two chapters concern book embeddings and string graphs, and two more chapters
Crossing_Numbers_of_Graphs
Genome assembly algorithm
rather than experimental. Currently available assembler, such as Velvet, String Graph Assembler (SGA) and EULER-SR, were not designed to handle SCS assembly
SPAdes_(software)
Mathematical model used by graph-oriented databases
A property graph, labeled property graph, or attributed graph is a data model of various graph-oriented databases, where pairs of entities are associated
Property_graph
widely used in equality checking of graphs, polygons, automata and chemical structures. It is possible for a string to have multiple LMSRs, but for most
Lexicographically minimal string rotation
Lexicographically_minimal_string_rotation
Software in bioinformatics
speed of the analyses. Graph method assemblers come in two varieties: string and De Bruijn. String graph and De Bruijn graph method assemblers were introduced
De_novo_sequence_assemblers
in contrast to move-generation algorithms using a directed acyclic word graph (DAWG) such as the one used by Maven. It is generally twice as fast as the
GADDAG
Bruijn graphs for genomic sequence assembly Geohash: a public domain algorithm that encodes a decimal latitude/longitude pair as a hash string Vincenty's
List_of_algorithms
String in combinatorial math
In combinatorial mathematics, a superpermutation on n symbols is a string that contains each permutation of n symbols as a substring. While trivial superpermutations
Superpermutation
Family of graphs whose shallow minors are sparse graphs
biclique-free string graphs, since these all obey similar separator theorems to the planar graphs. In higher dimensional Euclidean spaces, intersection graphs of
Bounded_expansion
Data organization and storage formats
graph-based data structures are used in computer science and related fields: Graph Adjacency list Adjacency matrix Graph-structured stack Scene graph
List_of_data_structures
Searching for patterns in text
Clifford. Sequence alignment Graph matching Pattern matching Compressed pattern matching Matching wildcards Approximate string matching Full-text search
String-searching_algorithm
Electronic calculator capable of plotting graphs
A graphing calculator (also graphics calculator or graphic display calculator) is a handheld computer that is capable of plotting graphs, solving simultaneous
Graphing_calculator
Species of mammal endemic to Hispaniola
coverage and adopted a string graph-based assembler, Fermi, for contig construction. This approach proved superior to de Bruijn graph-based assembly for highly
Hispaniolan_solenodon
Hypothetical physical concept
theories is given in the following graph, where each unification step leads one level up on the graph. In this graph, electroweak unification occurs at
Theory_of_everything
Condensed matter physics model involving only closed loops
gravity appears to be a string net condensation ... Konopka, Tomasz; Markopoulou, Fotini; Smolin, Lee (2006). "Quantum Graphity". arXiv:hep-th/0611197
String-net_liquid
Object relationship in programming language
private: // Vertex gives access-rights to Graph. friend class Graph; HashSet<SharedPtr<Vertex>> edges; String name; using EdgesIterator = decltype(edges
Friend_class
although intersection graphs of convex shapes, circle graphs, and outerstring graphs are all special cases of string graphs, the string graphs themselves are
Chi-bounded
Database class for storage and retrieval of modeled data
databases use a single data structure—such as key–value pairs, wide columns, graphs, or documents—to hold information. Since this non-relational design does
NoSQL
Finite-state machine
that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string. Deterministic refers to the uniqueness
Deterministic finite automaton
Deterministic_finite_automaton
chapters, and deals with the topics of searching, sorting, basic graph algorithms, string processing, the fundamentals of cryptography and data compression
Algorithms_Unlocked
at Meta. XStream uses reflection to discover the structure of the object graph to serialize at run time, and doesn't require modifications to objects.
XStream
twin-width of an undirected graph is a natural number associated with the graph, used to study the parameterized complexity of graph algorithms. Intuitively
Twin-width
Software resource tracking technique
collection schemes, it is often helpful to think of the reference graph, which is a directed graph where the vertices are objects and there is an edge from an
Reference_counting
General-purpose programming language
exponentiation. Python uses the + operator for string concatenation. The language uses the * operator for duplicating a string a specified number of times. The @
Python_(programming_language)
Label="Label" DataType="String" /> <Property Id="Size" DataType="String" /> <Property Id="Start" DataType="DateTime" /> </Properties> </DirectedGraph> which looks
DGML
that adjacent characters in the string cannot be equal ( s i ≠ s i + 1 {\displaystyle s_{i}\neq s_{i+1}} ). The Kautz graph K M N + 1 {\displaystyle K_{M}^{N+1}}
Kautz_graph
Computing language
graph traversal language and virtual machine developed by Apache TinkerPop of the Apache Software Foundation. Gremlin works for both OLTP-based graph
Gremlin_(query_language)
Hungarian-American mathematician and computer scientist
update in 2017. abstract We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and
László_Babai
Israeli mathematician and computer scientist
string matching. Galil worked with other computer scientists to develop several currently-fastest graph algorithms. Examples include trivalent graph isomorphism
Zvi_Galil
Cycle through all length-k sequences
size-k alphabet A is a cyclic sequence in which every possible length-n string on A occurs exactly once as a substring (i.e., as a contiguous subsequence)
De_Bruijn_sequence
Finite state machine with two tapes (input, output)
(where ε is the empty string) is the transition relation. We can view (Q, δ) as a labeled directed graph, known as the transition graph of T: the set of vertices
Finite-state_transducer
Study of discrete mathematical structures
continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics
Discrete_mathematics
Process of generalization
they are not abstract in the sense of the objects in graph 1 below. We might look at other graphs, in a progression from cat to mammal to animal, and see
Abstraction
Deterministic finite automaton accepting set of all suffixes of particular string
given string S = s 1 s 2 … s n {\displaystyle S=s_{1}s_{2}\dots s_{n}} . The state graph of a suffix automaton is called a directed acyclic word graph (DAWG)
Suffix_automaton
Topic in computer science
are used to determine whether some combinatorial structure S (such as a graph or a boolean function) satisfies some property P, or is "far" from having
Property_testing
location every time an Y coordinate was received, so a graph line could be sent as a long string of numbers for subsequent Y locations instead of having
Waveform_graphics
Graphing calculator by Texas Instruments
TI-85 the first TI graphing calculator that could execute assembly programs. Programs written in assembly would be stored as string expressions and accessed
TI-85
Topics referred to by the same term
computer science, and logic, such as: Graph rewriting, technique of creating a new graph out of an original graph algorithmically Sender Rewriting Scheme
Rewrite
Open problem on 3x+1 and x/2 functions
considers the bottom-up method of growing the so-called Collatz graph. The Collatz graph is a graph defined by the inverse relation R ( n ) = { { 2 n } if n
Collatz_conjecture
many rows as nodes present within the graph. For each row (each node), a label will be calculated. A label is a string containing the distance information
Hub_labels
Computer science metric of string similarity
solutions to the Optimum Stack Generation problem. Graph edit distance String-to-string correction problem String metric Time Warp Edit Distance Navarro, Gonzalo
Edit_distance
Type of vector space in math
to the closed graph theorem, which asserts that a linear function from one Banach space to another is continuous if and only if its graph is a closed set
Hilbert_space
Theory in theoretical physics
In theoretical physics, topological string theory is a version of string theory. Topological string theory appeared in papers by theoretical physicists
Topological_string_theory
Limited form of tree data structure
and S is a singleton (a single–element set) containing the root. From a graph theory perspective, binary trees as defined here are arborescences. A binary
Binary_tree
Sequence of characters that forms a search pattern
that specifies a match pattern in text. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings
Regular_expression
Human-readable data serialization language
can contain nested lists and hashes, forming a tree structure; arbitrary graphs can be represented using YAML aliases (similar to XML in SOAP). YAML is
YAML
World Wide Web Consortium standard
Framework (RDF) graphs. SHACL has been designed to enhance the semantic and technical interoperability layers of ontologies expressed as RDF graphs. SHACL models
SHACL
Inherent difficulty of computational problems
the input string, otherwise it is said to reject the input. An example of a decision problem is the following. The input is an arbitrary graph. The problem
Computational complexity theory
Computational_complexity_theory
Generalized manifold
of each vertex is given by the corresponding Cayley graph, so is just the bipartite Heawood graph, i.e. exactly the same as in the affine building for
Orbifold
On line segment intersection graphs
intersection graph of segments. Chalopin, Gonçalves & Ochem (2007) proved that planar graphs are in 1-STRING, the class of intersection graphs of simple
Scheinerman's_conjecture
System with multiple networked computers
given graph G. Different fields might take the following approaches: Centralized algorithms The graph G is encoded as a string, and the string is given
Distributed_computing
Topics referred to by the same term
Zealand Link (unit), surveying length unit Link, a single sausage in a string Links (golf), a coastal golf course The Link (building), a skyscraper in
Link
Limit of the tangent line at a point that tends to infinity
oblique. For curves given by the graph of a function y = ƒ(x), horizontal asymptotes are horizontal lines that the graph of the function approaches as x
Asymptote
Computer science string term
come from sets of partial words that all match at least one common string. This graph-theoretical interpretation of compatibility of partial words plays
Partial_word
Overview of the graphic calculators made by Casio
Casio produced the world's first graphing calculator, the fx-7000G. Since then, the company has released many more graphic calculators, with the FX-CG100
Casio_graphic_calculators
theory Elimination theory Ergodic theory Extremal graph theory Field theory Galois theory Game theory Graph theory Group theory Hodge theory Homology theory
List_of_mathematical_theories
Natural number
parenthesizing five items. The largest graceful graph on 14 nodes has exactly 68 edges. There are 68 different undirected graphs with six edges and no isolated nodes
68_(number)
British mathematician (1924–2019)
primarily on enumeration of graphs, graph isomorphism, chromatic polynomials, and particularly, the use of computers in graph-theoretical research. Read's
Ronald_C._Read
On linear-time algorithms for graph logic
study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided
Courcelle's_theorem
Formal language for describing data models
Resource Description Framework (RDF) is a method to describe and exchange graph data. It was originally designed as a data model for metadata by the World
Resource Description Framework
Resource_Description_Framework
Components included in all Microsoft Office products
Access to create charts and graphs. The program is available as an OLE application object in Visual Basic. Microsoft Graph supports many different types
Microsoft_Office_shared_tools
Spreadsheet editor by Microsoft
iOS and iPadOS. It features calculation or computation capabilities, graphing tools, pivot tables, and a macro programming language called Visual Basic
Microsoft_Excel
Analysing a string of symbols, according to the rules of a formal grammar
Parsing, syntax analysis, or syntactic analysis is a process of analyzing a string of symbols, either in natural language, computer languages or data structures
Parsing
During compilation, selecting which implementation of a method or function to use
monomorphised, with specific data types deduced and traced through the call graph, in order to instantiate specific versions of generic functions, and select
Static_dispatch
Replacing subterm in a formula with another term
reformulated for HRSs as well. Graph rewrite systems are another generalization of term rewrite systems, operating on graphs instead of (ground-) terms /
Rewriting
Topological invariant in mathematics
into a planar graph of points and curves, in such a way that the perimeter of the missing face is placed externally, surrounding the graph obtained, as
Euler_characteristic
NP-hard problem in combinatorial optimization
version of the TSP (where given a length L, the task is to decide whether the graph has a tour whose length is at most L) belongs to the class of NP-complete
Travelling_salesman_problem
Complexity class used to classify decision problems
subgraph isomorphism problem of determining whether graph G contains a subgraph that is isomorphic to graph H. Turing machine – Computation model defining
NP_(complexity)
STRING GRAPH
STRING GRAPH
Surname or Lastname
English
English : perhaps be a nickname from Middle English daring ‘trembling’, ‘crouching or transfixed with fear’.
Surname or Lastname
English
English : of uncertain origin. Early examples, as for example William Spring (Yorkshire 1280), all point to a personal name or nickname, perhaps going back to an Old English byname derived from the verb springan ‘to jump or leap’ (see Springer 1). Alternatively, it could be a topographic name from Middle English spring ‘young wood’, ‘spring’. Compare Springer. Reaney derives the surname from the word denoting the season, although the word is not attested in this sense until the 16th century, the usual Middle English word being lenten. Compare Lenz. The surname has also been established in Ireland (County Kerry) for several centuries.German : from Middle High German sprinc, Middle Low German sprink ‘spring’, ‘well’, hence a topographic name for someone who lived by a spring or well, or habitational name from Springe near Hannover.Jewish (Ashkenazic) : variant of Springer.John Spring emigrated from England and settled in Watertown, MA, in 1634.
Female
English
Variant spelling of English Serena, SARINA means "serene, tranquil."
Female
English
English variant spelling of Latin Serena, SERINA means "serene, tranquil."
Surname or Lastname
English
English : metonymic occupational name for a maker of strings or bow strings, from Middle English streng ‘string’, ‘cord’.
Girl/Female
American, Australian, Bengali, British, Christian, English, Indian
Springtime; Spring Season; Rapid Movement
Surname or Lastname
English
English : habitational name from places in Oxfordshire and West Sussex named Goring, from Old English GÄringas ‘people of GÄra’, a short form of the various compound names with the first element gÄr ‘spear’.German (Göring) : see Goering.
Surname or Lastname
English
English : unexplained.
Surname or Lastname
English
English : occupational name for a maker of string or bow strings, from an agent derivative of Middle English streng ‘string’. In Yorkshire, where it is still particularly common, Redmonds argues that the surname may have been connected with iron working, a stringer having operated some form of specialist hearth.
Boy/Male
American, Australian, British, English
Powerful
Surname or Lastname
German and Jewish (Ashkenazic)
German and Jewish (Ashkenazic) : from Middle High German hærinc ‘herring’, German Hering, a nickname for someone supposedly resembling a herring or a metonymic occupational name for a fish seller. In some cases the Jewish surname is ornamental.English : variant spelling of Herring.
Boy/Male
British, English
Spike of Grain
Surname or Lastname
English
English : from Middle English strong, strang ‘strong’, generally a nickname for a strong man but perhaps sometimes applied ironically to a weakling.French : translation of Trahand, a metonymic occupational name for a silkworker who drew out the thread from the cocoons (see Trahan).Translation of Ashkenazic Jewish Stark.
Boy/Male
Assamese, Indian
Sining
Girl/Female
Indian
Lively, Entertainer, From a stream or a Spring, The Spring season, The Spring season
Female
Romanian
Feminine form of Romanian Sorin, SORINA means "sun."
Girl/Female
Hindu, Indian
Strong; Caring
Female
English
English name derived from the season name, "spring," (Mar. 21 thru Jun. 21), derived from the verb spring, "to burst forth," from Proto-Indo-European *sprengh-, SPRING means "rapid movement."Â
Surname or Lastname
English
English : variant of Spring.
Boy/Male
Anglo, British, English
Strong
STRING GRAPH
STRING GRAPH
Male
Greek
Variant spelling of Greek Iesous, IESOS means "God is salvation."
Boy/Male
Tamil
Fanishwar | பநிஷà¯à®µà®°Â
Lord of serpents, Vasuki
Girl/Female
Bengali, Indian
God Gift; Relationship with God; God's Blessing
Female
Hungarian
Pet form of Hungarian Katalin, KATÓ means "pure."
Girl/Female
Indian, Tamil
The Constellations or Stars
Boy/Male
Tamil
Consort of Uma
Boy/Male
Tamil
Lotus
Surname or Lastname
English and Scottish (of Norman origin) and French
English and Scottish (of Norman origin) and French : habitational name from any of various places named Malpas, because of the difficulty of the terrain, from Old French mal pas ‘bad passage’ (Latin malus passus). It is a common French minor place name, and places in Cheshire, Cornwall, Gwent, and elsewhere in England were given this name by Norman settlers. A place in Rousillon (southeastern France) that had this name in the 12th century was subsequently renamed Bonpas for the sake of a better omen.
Surname or Lastname
North German
North German : occupational name for a peddler (see Haack 1).North German : topographic name for someone who lived by a hedge (see Heck 2).North German : perhaps also a topographic name from hach, hack ‘dirty, boggy water’.Frisian, Dutch, and North German : from a Frisian personal name, Hake.Jewish (Ashkenazic) : metonymic occupational name from Yiddish hak ‘axe’.English : variant of Hake 1.George Hack (c. 1623–c. 1665) was born in Cologne, Germany, of a Schleswig-Holstein family, and emigrated to New Amsterdam where he practiced medicine and entered the VA tobacco trade. Colony records show that he and his wife, Anna, were formally made naturalized citizens of VA in 1658. He had two daughters, neither of whom married, and two sons: George Nicholas Hack, the founder of the Norfolk branch of the family; and Peter, for many years a member of the VA House of Burgesses, the founder of the Maryland branch. Hack’s descendants eventually changed the spelling of the name to Heck.
Boy/Male
Indian, Sanskrit
Lord of the Stars
STRING GRAPH
STRING GRAPH
STRING GRAPH
STRING GRAPH
STRING GRAPH
superl.
Having great military or naval force; powerful; as, a strong army or fleet; a nation strong at sea.
superl.
Solid; nourishing; as, strong meat.
a.
Strong.
superl.
Affecting any sense powerfully; as, strong light, colors, etc.; a strong flavor of onions; a strong scent.
imp.
of String
n.
A small cord, a line, a twine, or a slender strip of leather, or other substance, used for binding together, fastening, or tying things; a cord, larger than a thread and smaller than a rope; as, a shoe string; a bonnet string; a silken string.
superl.
Ardent; eager; zealous; earnestly engaged; as, a strong partisan; a strong Whig or Tory.
n.
A thread or cord on which a number of objects or parts are strung or arranged in close and orderly succession; hence, a line or series of things arranged on a thread, or as if so arranged; a succession; a concatenation; a chain; as, a string of shells or beads; a string of dried apples; a string of houses; a string of arguments.
superl.
Having virtues of great efficacy; or, having a particular quality in a great degree; as, a strong powder or tincture; a strong decoction; strong tea or coffee.
v. t.
To deprive of strings; to strip the strings from; as, to string beans. See String, n., 9.
superl.
Having passive physical power; having ability to bear or endure; firm; hale; sound; robust; as, a strong constitution; strong health.
superl.
Well established; firm; not easily overthrown or altered; as, a strong custom; a strong belief.
superl.
Moving with rapidity or force; violent; forcible; impetuous; as, a strong current of water or wind; the wind was strong from the northeast; a strong tide.
v. t.
To furnish with strings; as, to string a violin.
v. t.
To put on a string; to file; as, to string beads.
a.
Consisting of strings, or small threads; fibrous; filamentous; as, a stringy root.
superl.
Adapted to make a deep or effectual impression on the mind or imagination; striking or superior of the kind; powerful; forcible; cogent; as, a strong argument; strong reasons; strong evidence; a strong example; strong language.
p. p.
of String