Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: de Bruijn sequence | Statement: [N. G. de Bruijn, notableWork, de Bruijn sequence]

Target entity: de Bruijn sequence
Context triple: [N. G. de Bruijn, notableWork, de Bruijn sequence]

• A. Look-and-say sequence
  The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
• B. Berlekamp–Massey algorithm
  The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
• C. Ulam sequence
  The Ulam sequence is an integer sequence starting with 1 and 2 in which each subsequent term is the smallest integer that can be written uniquely as the sum of two distinct earlier terms.
• D. Alexander–Briggs notation
  Alexander–Briggs notation is a classical system for naming and classifying knots in knot theory, assigning each distinct knot a unique label based on its crossing number and order in knot tables.
• E. Knuth–Morris–Pratt algorithm
  The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: de Bruijn sequence
Triple: [N. G. de Bruijn, notableWork, de Bruijn sequence]

A de Bruijn sequence is a cyclic sequence over a given alphabet in which every possible subsequence of a fixed length appears exactly once.

Target entity: de Bruijn sequence
Target entity description: A de Bruijn sequence is a cyclic sequence over a given alphabet in which every possible subsequence of a fixed length appears exactly once.

• A. Look-and-say sequence
  The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
• B. Berlekamp–Massey algorithm
  The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
• C. Ulam sequence
  The Ulam sequence is an integer sequence starting with 1 and 2 in which each subsequent term is the smallest integer that can be written uniquely as the sum of two distinct earlier terms.
• D. Alexander–Briggs notation
  Alexander–Briggs notation is a classical system for naming and classifying knots in knot theory, assigning each distinct knot a unique label based on its crossing number and order in knot tables.
• E. Knuth–Morris–Pratt algorithm
  The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
• F. None of above. chosen