Abstract: One example method includes generating, from a relevancy graph, a first table and a second table, the relevancy graph comprising a plurality of nodes and a plurality of edges, wherein each node represents an individual and each edge connects two nodes and represents a relationship between the respective two nodes, the first table comprising information about each node in the relevancy graph and the second table comprising information about each edge in the relevancy graph; selecting a seed node from the plurality of nodes; generating a database query to obtain data for a relevancy table based on a set of neighbor nodes to the seed node and a set of corresponding edges connecting the seed node to each neighbor node of the set of neighbor nodes; distributing, to a plurality of computing nodes, portions of the database query to determine, in parallel, probability information for the relevancy table; generating the relevancy table comprising the seed node, the set of neighbor nodes, and, for the seed node and eac

Abstract: One example method includes generating, from a relevancy graph, a first table and a second table, the relevancy graph comprising a plurality of nodes and a plurality of edges, wherein each node represents an individual and each edge connects two nodes and represents a relationship between the respective two nodes, the first table comprising information about each node in the relevancy graph and the second table comprising information about each edge in the relevancy graph; selecting a seed node from the plurality of nodes; generating a database query to obtain data for a relevancy table based on a set of neighbor nodes to the seed node and a set of corresponding edges connecting the seed node to each neighbor node of the set of neighbor nodes; distributing, to a plurality of computing nodes, portions of the database query to determine, in parallel, probability information for the relevancy table; generating the relevancy table comprising the seed node, the set of neighbor nodes, and, for the seed node and eac

Abstract: A mutation site of an ideal brittle culm mutant ibc in rice, a controlling gene IBC, and use thereof are provided. The controlling gene IBC has: (1) a nucleotide sequence shown in SEQ ID NO: 1 or SEQ ID NO: 2; or (2) a nucleotide sequence of a mutant, an allele, or a derivative generated by adding, substituting, inserting or deleting one or more nucleotides. The present disclosure further provides an encoded protein of the controlling gene IBC, a recombinant construct, a recombinant host cell, a method for embrittling culms in a rice ripening stage by using the controlling gene IBC, and use thereof. In a mutant with allelic variation in the gene IBC and loss of gene editing function, culms exhibit a brittle culm phenotype at the late ripening stage, leaves are not brittle, yield traits are excellent, and other agronomic traits are not obviously changed.

Abstract: A mutation site of an ideal brittle culm mutant ibc in rice, a controlling gene IBC, and use thereof are provided. The controlling gene IBC has: (1) a nucleotide sequence shown in SEQ ID NO: 1 or SEQ ID NO: 2; or (2) a nucleotide sequence of a mutant, an allele, or a derivative generated by adding, substituting, inserting or deleting one or more nucleotides. The present disclosure further provides an encoded protein of the controlling gene IBC, a recombinant construct, a recombinant host cell, a method for embrittling culms in a rice ripening stage by using the controlling gene IBC, and use thereof. In a mutant with allelic variation in the gene IBC and loss of gene editing function, culms exhibit a brittle culm phenotype at the late ripening stage, leaves are not brittle, yield traits are excellent, and other agronomic traits are not obviously changed.